./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label32_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label32_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/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 3c0664b7713eb65e7600fbc10e17bb0e628a6c66 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-0cd3be1 [2018-11-28 13:31:06,895 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:31:06,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:31:06,905 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:31:06,905 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:31:06,906 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:31:06,907 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:31:06,908 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:31:06,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:31:06,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:31:06,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:31:06,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:31:06,911 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:31:06,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:31:06,912 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:31:06,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:31:06,913 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:31:06,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:31:06,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:31:06,917 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:31:06,918 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:31:06,918 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:31:06,920 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:31:06,920 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:31:06,920 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:31:06,921 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:31:06,922 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:31:06,922 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:31:06,923 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:31:06,924 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:31:06,924 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:31:06,924 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:31:06,924 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:31:06,925 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:31:06,925 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:31:06,926 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:31:06,926 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 13:31:06,937 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:31:06,937 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:31:06,938 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:31:06,938 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:31:06,938 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:31:06,939 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:31:06,939 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:31:06,939 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:31:06,939 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:31:06,939 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:31:06,939 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:31:06,940 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:31:06,940 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:31:06,940 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:31:06,940 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:31:06,940 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:31:06,940 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:31:06,940 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:31:06,940 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:31:06,941 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:31:06,941 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:31:06,941 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:31:06,941 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:31:06,941 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:31:06,941 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:31:06,942 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:31:06,942 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:31:06,942 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:31:06,942 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:31:06,942 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:31:06,942 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:31:06,943 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:31:06,943 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_066f15a2-4649-4ef8-950a-a70651f245f9/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 -> 3c0664b7713eb65e7600fbc10e17bb0e628a6c66 [2018-11-28 13:31:06,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:31:06,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:31:06,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:31:06,977 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:31:06,977 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:31:06,977 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label32_true-unreach-call_false-termination.c [2018-11-28 13:31:07,017 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/data/409e3b3b2/4633a7af978f47dfb26c08bc852fabd4/FLAG2df9a02ed [2018-11-28 13:31:07,462 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:31:07,462 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/sv-benchmarks/c/eca-rers2012/Problem02_label32_true-unreach-call_false-termination.c [2018-11-28 13:31:07,471 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/data/409e3b3b2/4633a7af978f47dfb26c08bc852fabd4/FLAG2df9a02ed [2018-11-28 13:31:07,483 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/data/409e3b3b2/4633a7af978f47dfb26c08bc852fabd4 [2018-11-28 13:31:07,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:31:07,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:31:07,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:31:07,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:31:07,490 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:31:07,490 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:31:07" (1/1) ... [2018-11-28 13:31:07,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28035eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:31:07, skipping insertion in model container [2018-11-28 13:31:07,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:31:07" (1/1) ... [2018-11-28 13:31:07,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:31:07,527 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:31:07,759 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:31:07,763 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:31:07,906 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:31:07,919 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:31:07,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:31:07 WrapperNode [2018-11-28 13:31:07,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:31:07,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:31:07,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:31:07,920 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:31:07,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:31:07" (1/1) ... [2018-11-28 13:31:07,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:31:07" (1/1) ... [2018-11-28 13:31:07,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:31:07,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:31:07,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:31:07,966 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:31:07,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:31:07" (1/1) ... [2018-11-28 13:31:07,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:31:07" (1/1) ... [2018-11-28 13:31:07,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:31:07" (1/1) ... [2018-11-28 13:31:07,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:31:07" (1/1) ... [2018-11-28 13:31:07,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:31:07" (1/1) ... [2018-11-28 13:31:07,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:31:07" (1/1) ... [2018-11-28 13:31:08,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:31:07" (1/1) ... [2018-11-28 13:31:08,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:31:08,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:31:08,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:31:08,008 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:31:08,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:31:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:08,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:31:08,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:31:08,843 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:31:08,843 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 13:31:08,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:31:08 BoogieIcfgContainer [2018-11-28 13:31:08,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:31:08,844 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:31:08,844 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:31:08,847 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:31:08,847 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:31:08,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:31:07" (1/3) ... [2018-11-28 13:31:08,848 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31d6b2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:31:08, skipping insertion in model container [2018-11-28 13:31:08,848 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:31:08,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:31:07" (2/3) ... [2018-11-28 13:31:08,849 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31d6b2ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:31:08, skipping insertion in model container [2018-11-28 13:31:08,849 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:31:08,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:31:08" (3/3) ... [2018-11-28 13:31:08,851 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label32_true-unreach-call_false-termination.c [2018-11-28 13:31:08,888 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:31:08,889 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:31:08,889 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:31:08,889 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:31:08,889 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:31:08,889 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:31:08,889 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:31:08,889 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:31:08,889 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:31:08,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-28 13:31:08,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-28 13:31:08,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:31:08,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:31:08,937 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:31:08,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:31:08,937 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:31:08,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-28 13:31:08,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-28 13:31:08,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:31:08,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:31:08,944 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:31:08,944 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:31:08,950 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2018-11-28 13:31:08,950 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2018-11-28 13:31:08,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:08,955 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 13:31:08,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:08,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:08,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:08,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:08,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:09,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:09,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-11-28 13:31:09,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:09,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:09,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:09,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:09,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:09,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:09,052 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-11-28 13:31:09,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:09,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:09,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:09,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:09,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:31:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:31:09,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:31:09,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:31:09,225 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:31:09,225 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:31:09,226 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:31:09,226 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:31:09,226 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:31:09,226 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:09,226 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:31:09,226 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:31:09,226 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label32_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-28 13:31:09,226 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:31:09,227 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:31:09,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,449 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:31:09,449 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:09,453 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:09,453 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:09,464 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:09,464 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:09,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:09,480 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:09,486 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:09,486 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:09,502 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:09,502 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:09,506 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:09,507 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:09,538 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:09,539 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:09,542 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:09,542 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:09,571 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:09,571 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:09,584 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:09,585 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:09,606 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:09,606 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:09,608 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:09,609 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:09,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:09,626 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:09,630 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:09,630 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:09,667 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:09,667 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:09,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:31:09,686 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:09,707 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 13:31:09,709 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:31:09,709 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:31:09,709 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:31:09,709 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:31:09,709 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:31:09,709 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:09,710 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:31:09,710 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:31:09,710 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label32_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-28 13:31:09,710 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:31:09,710 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:31:09,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:09,927 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:31:09,930 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:31:09,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:09,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:09,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:09,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:09,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:09,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:09,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:31:09,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:09,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:09,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:09,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:09,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:09,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:09,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:09,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:09,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:31:09,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:09,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:09,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-11-28 13:31:09,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:09,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:09,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:09,949 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 13:31:09,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:09,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:09,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:09,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:09,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:09,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:09,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:09,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:09,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:09,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:09,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:31:09,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:09,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:09,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:09,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:09,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:09,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:09,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:09,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:09,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:31:09,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:09,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:09,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:09,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:09,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:09,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:09,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:09,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:09,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:31:09,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:09,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:09,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:09,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:09,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:09,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:09,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:09,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:09,987 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:31:09,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:09,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:09,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:09,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:09,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:09,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:09,989 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:09,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:09,990 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:09,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:09,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:09,995 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 13:31:09,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:09,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:09,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:09,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:09,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:09,996 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:09,997 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:09,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,006 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,006 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:10,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,010 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 13:31:10,010 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,012 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 13:31:10,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,031 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,031 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:10,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,037 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,037 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:10,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,041 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,041 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:10,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,045 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,046 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:10,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,048 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:10,048 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:10,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,054 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 13:31:10,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,056 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,057 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,066 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,067 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,071 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 13:31:10,071 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,073 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 13:31:10,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,119 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,120 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,124 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,125 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,128 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,128 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,131 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,132 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,137 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:10,137 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,138 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:31:10,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,143 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 13:31:10,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,145 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,146 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:10,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,154 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,155 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:10,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,157 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 13:31:10,157 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,162 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 13:31:10,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,175 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,176 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:10,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,183 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,183 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:10,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,186 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,186 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:10,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,189 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,189 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:10,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:10,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,191 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:10,191 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,191 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 13:31:10,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,195 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 13:31:10,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,196 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,196 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,197 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,197 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:10,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,209 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,210 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,210 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:10,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,213 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,214 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,215 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 13:31:10,215 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,216 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-28 13:31:10,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,239 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,240 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,240 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:10,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,244 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,244 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,245 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,245 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:10,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,248 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,248 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,248 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,249 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:10,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,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-11-28 13:31:10,252 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,252 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,252 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,252 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:10,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,254 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,254 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:10,254 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:10,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:10,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,260 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 13:31:10,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-11-28 13:31:10,260 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,260 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:10,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,261 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,262 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,273 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,273 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:10,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,273 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,276 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,279 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,279 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:10,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,279 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 13:31:10,279 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,282 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 13:31:10,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,305 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,305 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:10,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,307 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,308 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,312 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,313 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:10,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,313 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,314 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,317 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,317 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:10,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,317 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,318 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,321 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,321 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:10,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,322 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,322 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,324 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,324 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:10,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,325 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:10,325 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,326 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:31:10,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,331 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 13:31:10,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-11-28 13:31:10,332 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,332 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,332 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,334 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:10,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,342 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,342 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,343 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,343 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:10,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,348 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,348 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,348 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 13:31:10,348 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,352 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-28 13:31:10,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,381 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,381 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,381 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,383 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:10,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,388 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,388 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,389 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,389 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:10,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,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-11-28 13:31:10,393 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,394 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,394 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,395 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:10,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,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-11-28 13:31:10,399 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,399 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,399 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,400 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:10,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,402 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,402 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,402 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:10,402 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:10,404 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 13:31:10,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,412 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 13:31:10,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,413 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,413 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,413 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,414 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,421 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,423 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,423 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,424 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,426 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,427 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,427 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 13:31:10,427 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,428 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 13:31:10,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,441 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,442 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,442 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,442 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,447 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,447 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,448 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,448 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,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-11-28 13:31:10,450 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,450 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,451 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,451 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,453 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,453 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,454 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,454 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:10,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,456 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,456 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:10,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,456 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:10,456 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:10,457 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:31:10,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,462 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 13:31:10,463 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,463 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,463 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,464 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:10,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:10,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,487 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,487 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,488 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:10,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:10,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,491 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,492 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,492 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-28 13:31:10,492 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:10,498 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-28 13:31:10,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,555 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,555 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,556 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:10,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:10,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,563 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,564 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,564 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:10,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:10,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,568 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,568 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,568 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:10,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:10,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,576 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,576 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:10,576 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:10,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:10,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:10,580 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:10,580 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:10,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:10,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:10,580 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:10,580 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:10,581 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 13:31:10,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:10,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:10,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:31:10,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:31:10,599 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-11-28 13:31:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:31:11,128 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2018-11-28 13:31:11,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:31:11,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2018-11-28 13:31:11,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-11-28 13:31:11,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2018-11-28 13:31:11,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-11-28 13:31:11,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-11-28 13:31:11,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2018-11-28 13:31:11,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:31:11,147 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-11-28 13:31:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2018-11-28 13:31:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-11-28 13:31:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-28 13:31:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2018-11-28 13:31:11,180 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-11-28 13:31:11,180 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-11-28 13:31:11,180 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:31:11,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2018-11-28 13:31:11,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2018-11-28 13:31:11,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:31:11,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:31:11,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:31:11,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:31:11,183 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 635#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 636#L606-2 [2018-11-28 13:31:11,184 INFO L796 eck$LassoCheckResult]: Loop: 636#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 721#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 752#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 758#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 789#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 713#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 714#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 707#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 638#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 639#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 636#L606-2 [2018-11-28 13:31:11,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:11,184 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 13:31:11,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:11,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:11,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:11,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:11,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:11,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:11,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-11-28 13:31:11,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:11,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:11,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:11,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:31:11,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:11,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:11,206 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-11-28 13:31:11,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:11,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:11,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:11,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:11,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:31:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:31:11,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:31:11,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:31:11,314 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:31:11,315 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:31:11,315 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:31:11,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:31:11,315 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:31:11,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:11,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:31:11,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:31:11,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label32_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-28 13:31:11,315 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:31:11,315 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:31:11,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,435 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:31:11,435 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:11,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:11,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:11,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:11,440 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:11,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:11,456 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:11,459 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:11,459 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:11,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:11,474 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:11,476 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:11,476 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:11,492 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:11,492 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:11,494 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:11,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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:11,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:11,510 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:11,512 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:11,513 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:11,528 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:11,528 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:11,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:31:11,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:11,566 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 13:31:11,567 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:31:11,567 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:31:11,567 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:31:11,567 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:31:11,567 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:31:11,568 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:11,568 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:31:11,568 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:31:11,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label32_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-28 13:31:11,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:31:11,568 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:31:11,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:11,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-11-28 13:31:11,703 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:31:11,704 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:31:11,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:11,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:31:11,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,707 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:11,708 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:11,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:11,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:31:11,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:11,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:31:11,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,713 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:11,717 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:11,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,720 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:11,720 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:11,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:11,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:31:11,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:31:11,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:31:11,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,731 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 13:31:11,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,732 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,733 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:11,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,735 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,735 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:11,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,737 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,737 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:11,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,739 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,739 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:11,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,741 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,742 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:11,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,745 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,745 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:11,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,751 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,751 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:11,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,755 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,756 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:11,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,757 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 13:31:11,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,759 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,759 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:11,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,825 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,825 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,825 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:31:11,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,826 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,827 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:11,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,828 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,828 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:11,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,830 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,830 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,831 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:31:11,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,834 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,834 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,834 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:31:11,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,840 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,840 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:11,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,851 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,851 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:11,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,853 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 13:31:11,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,866 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,866 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:11,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,869 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,869 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,869 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 13:31:11,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,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-11-28 13:31:11,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,870 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,870 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:11,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,872 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,872 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:11,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,874 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,874 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,875 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 13:31:11,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,878 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,878 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,879 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 13:31:11,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,884 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,885 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:11,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:31:11,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,889 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,889 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:11,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,891 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 13:31:11,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,892 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,892 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:11,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,892 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,892 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:11,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,895 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,895 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:11,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,895 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,895 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:11,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,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-11-28 13:31:11,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,897 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:11,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,897 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,897 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:11,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,898 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,898 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:11,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,899 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,899 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:11,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,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-11-28 13:31:11,901 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,901 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:11,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,902 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,902 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:11,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,906 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:11,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,906 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,906 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:11,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,913 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,913 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:11,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,913 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,914 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:11,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,920 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,920 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:11,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,920 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 13:31:11,921 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 13:31:11,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,923 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 13:31:11,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,924 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:11,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,924 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,925 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:11,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,928 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,928 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:11,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,928 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,928 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,929 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:31:11,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,931 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,931 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:11,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,931 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,932 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:11,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,933 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:11,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,934 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,934 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:11,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,937 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,937 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:11,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,937 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,937 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,938 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:31:11,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,944 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,944 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:11,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,945 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,945 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,946 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:31:11,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,956 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,956 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:11,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,956 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,957 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:11,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,963 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,963 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 13:31:11,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,963 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:11,964 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:11,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,967 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 13:31:11,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,968 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,968 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:11,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,968 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,969 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:11,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,973 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,973 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:11,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,974 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,974 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,975 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 13:31:11,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,977 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:11,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,977 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,978 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:11,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,979 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,979 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:11,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:11,979 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,980 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:11,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,985 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:11,985 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,985 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,985 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,986 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 13:31:11,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:11,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:11,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:11,995 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:11,995 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:11,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:11,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:11,996 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:11,996 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:11,998 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-28 13:31:11,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,018 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:12,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:12,018 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:12,020 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:12,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,036 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,036 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:12,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:12,036 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 13:31:12,037 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 13:31:12,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,043 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 13:31:12,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,044 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:12,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:12,044 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:12,045 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:12,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,047 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,047 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:12,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,047 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:12,047 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:12,048 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:31:12,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,050 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,050 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:12,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:12,050 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:12,050 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:12,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,052 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:12,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:12,052 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:12,053 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:12,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,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-11-28 13:31:12,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,055 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:12,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,055 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:12,055 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:12,056 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:31:12,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,060 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,060 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:12,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,061 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:12,061 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:12,062 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:31:12,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,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-11-28 13:31:12,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,069 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:12,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:12,069 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:12,071 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:12,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,078 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,078 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 13:31:12,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:12,079 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 13:31:12,079 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 13:31:12,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,082 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 13:31:12,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,083 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:12,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:12,083 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:12,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:12,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,086 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,086 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:12,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,087 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:12,087 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:12,087 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 13:31:12,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,090 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,090 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:12,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:12,090 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:12,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:12,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,093 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,093 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:12,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:12,093 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:12,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:12,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,096 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,097 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:12,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,097 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:12,097 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:12,098 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 13:31:12,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,110 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,110 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:12,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,110 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 13:31:12,110 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:12,112 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-28 13:31:12,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,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-11-28 13:31:12,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,129 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:12,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:12,129 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:12,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:12,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:31:12,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 13:31:12,156 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 13:31:12,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:31:12,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:31:12,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:31:12,157 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 13:31:12,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:31:12,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:31:12,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:31:12,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:31:12,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:31:12,175 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-11-28 13:31:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:31:12,499 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2018-11-28 13:31:12,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:31:12,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2018-11-28 13:31:12,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-11-28 13:31:12,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2018-11-28 13:31:12,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2018-11-28 13:31:12,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2018-11-28 13:31:12,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2018-11-28 13:31:12,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:31:12,519 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 13:31:12,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2018-11-28 13:31:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-11-28 13:31:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-11-28 13:31:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2018-11-28 13:31:12,536 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 13:31:12,536 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-11-28 13:31:12,536 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:31:12,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2018-11-28 13:31:12,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-11-28 13:31:12,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:31:12,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:31:12,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:31:12,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:31:12,544 INFO L794 eck$LassoCheckResult]: Stem: 1666#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1539#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1540#L606-2 [2018-11-28 13:31:12,545 INFO L796 eck$LassoCheckResult]: Loop: 1540#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1657#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1663#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1536#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1898#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1894#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1890#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1695#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1674#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 1675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1848#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 1844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 1840#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 1836#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 1832#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 1828#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 1824#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 1820#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1815#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 1814#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 1745#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 1746#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 1806#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 1805#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 1804#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 1803#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 1743#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 1744#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 1797#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1793#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 1788#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 1787#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1786#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1784#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 1782#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 1777#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 1774#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 1773#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1772#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 1771#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 1769#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1767#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1708#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1872#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 1868#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 1864#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1862#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 1861#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1859#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1857#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 1855#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 1853#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1679#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1540#L606-2 [2018-11-28 13:31:12,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-28 13:31:12,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:12,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:12,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:12,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:12,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:12,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:12,561 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-11-28 13:31:12,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:12,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:12,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:31:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:31:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:31:12,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:31:12,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:31:12,621 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:31:12,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:31:12,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:31:12,622 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2018-11-28 13:31:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:31:13,271 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2018-11-28 13:31:13,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:31:13,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2018-11-28 13:31:13,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2018-11-28 13:31:13,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2018-11-28 13:31:13,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-11-28 13:31:13,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-11-28 13:31:13,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2018-11-28 13:31:13,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:31:13,283 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2018-11-28 13:31:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2018-11-28 13:31:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2018-11-28 13:31:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-11-28 13:31:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2018-11-28 13:31:13,302 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-11-28 13:31:13,302 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-11-28 13:31:13,302 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:31:13,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2018-11-28 13:31:13,306 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2018-11-28 13:31:13,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:31:13,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:31:13,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:31:13,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:31:13,308 INFO L794 eck$LassoCheckResult]: Stem: 3434#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3291#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3292#L606-2 [2018-11-28 13:31:13,309 INFO L796 eck$LassoCheckResult]: Loop: 3292#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3683#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3682#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3681#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3680#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3679#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3678#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3677#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3288#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3909#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3904#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3892#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3338#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3875#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3872#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3869#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3863#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3859#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3857#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3856#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3855#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3850#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3849#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3848#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3847#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3845#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3843#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3841#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3839#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3837#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3835#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3833#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3831#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3829#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3827#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3825#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3823#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3821#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3819#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 3817#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3815#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3813#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3811#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 3809#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 3807#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 3805#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3803#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 3801#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 3799#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 3797#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 3795#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 3793#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3791#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 3789#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 3787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 3785#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 3783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 3781#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 3779#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 3772#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 3685#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3684#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3292#L606-2 [2018-11-28 13:31:13,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:13,309 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-28 13:31:13,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:13,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:13,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:13,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:13,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:13,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:13,317 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-11-28 13:31:13,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:13,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:13,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:13,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:31:13,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:31:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:31:13,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:31:13,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:31:13,356 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:31:13,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:31:13,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:31:13,356 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2018-11-28 13:31:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:31:13,624 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2018-11-28 13:31:13,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:31:13,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2018-11-28 13:31:13,631 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 13:31:13,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-11-28 13:31:13,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-11-28 13:31:13,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-11-28 13:31:13,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2018-11-28 13:31:13,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:31:13,685 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 13:31:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2018-11-28 13:31:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2018-11-28 13:31:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-11-28 13:31:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-11-28 13:31:13,701 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 13:31:13,701 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-11-28 13:31:13,701 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:31:13,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2018-11-28 13:31:13,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 13:31:13,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:31:13,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:31:13,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:31:13,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:31:13,707 INFO L794 eck$LassoCheckResult]: Stem: 5882#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 5738#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 5739#L606-2 [2018-11-28 13:31:13,708 INFO L796 eck$LassoCheckResult]: Loop: 5739#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6148#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6147#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6145#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6143#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6141#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6140#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6139#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6138#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6136#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6135#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6134#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6132#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 5812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6335#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6332#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6329#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 5786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6333#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6330#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6327#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6324#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6321#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6318#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6316#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6315#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6314#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6313#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6312#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6311#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6310#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6309#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6307#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6305#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6303#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6301#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6299#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6297#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6295#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6293#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6291#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6289#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6287#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6285#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6283#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6281#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6279#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6277#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6275#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6273#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6271#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6269#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6267#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6265#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6263#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6261#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6259#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6257#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6255#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6253#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6250#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6248#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6246#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6244#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6241#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6236#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6150#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6149#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 5739#L606-2 [2018-11-28 13:31:13,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:13,708 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-28 13:31:13,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:13,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:13,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:13,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:13,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:13,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:13,712 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-11-28 13:31:13,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:13,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:13,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:13,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:31:13,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:31:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:31:13,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:31:13,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:31:13,757 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:31:13,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:31:13,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:31:13,757 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2018-11-28 13:31:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:31:14,078 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2018-11-28 13:31:14,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:31:14,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2018-11-28 13:31:14,082 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 13:31:14,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-11-28 13:31:14,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2018-11-28 13:31:14,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2018-11-28 13:31:14,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2018-11-28 13:31:14,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:31:14,085 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 13:31:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2018-11-28 13:31:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2018-11-28 13:31:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-11-28 13:31:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-11-28 13:31:14,095 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 13:31:14,095 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-11-28 13:31:14,095 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:31:14,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2018-11-28 13:31:14,098 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-11-28 13:31:14,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:31:14,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:31:14,099 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:31:14,099 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:31:14,100 INFO L794 eck$LassoCheckResult]: Stem: 8462#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 8325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 8326#L606-2 [2018-11-28 13:31:14,100 INFO L796 eck$LassoCheckResult]: Loop: 8326#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8712#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8710#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8708#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8706#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8704#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8702#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8685#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8683#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8680#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8677#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8674#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8671#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8668#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8665#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8662#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8659#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8656#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8652#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8649#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8646#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8643#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8640#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8637#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8634#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8631#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8628#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8625#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8622#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 8374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8682#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8679#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8676#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8673#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8670#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8667#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8664#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8661#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8658#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8654#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8651#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8648#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8645#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8642#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8639#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8636#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8633#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8630#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8627#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8624#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8621#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8618#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8615#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8612#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8609#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8606#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8603#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8600#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8597#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 8594#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 8591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 8588#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 8585#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 8582#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8579#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 8576#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 8573#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 8566#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 8564#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 8561#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8558#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 8555#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 8552#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 8549#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 8546#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 8543#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 8540#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 8536#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 8532#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 8533#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8326#L606-2 [2018-11-28 13:31:14,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:14,100 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-28 13:31:14,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:14,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:14,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:14,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:14,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:14,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:14,104 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-11-28 13:31:14,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:14,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:14,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:14,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:31:14,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:31:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:31:14,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:31:14,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:31:14,156 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:31:14,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:31:14,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:31:14,157 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2018-11-28 13:31:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:31:14,287 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2018-11-28 13:31:14,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:31:14,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2018-11-28 13:31:14,291 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-11-28 13:31:14,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-11-28 13:31:14,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2018-11-28 13:31:14,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2018-11-28 13:31:14,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2018-11-28 13:31:14,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:31:14,297 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 13:31:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2018-11-28 13:31:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2018-11-28 13:31:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-11-28 13:31:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-11-28 13:31:14,312 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 13:31:14,312 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-11-28 13:31:14,312 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:31:14,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2018-11-28 13:31:14,316 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-11-28 13:31:14,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:31:14,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:31:14,317 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:31:14,317 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:31:14,317 INFO L794 eck$LassoCheckResult]: Stem: 11021#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 10900#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 10901#L606-2 [2018-11-28 13:31:14,318 INFO L796 eck$LassoCheckResult]: Loop: 10901#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 11770#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 11768#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11765#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 11763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 11761#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 11726#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 11727#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11802#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 11800#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 11798#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 11796#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 11794#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 11792#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 11790#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 11788#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 11786#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 11784#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 11782#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 11780#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 11778#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 11776#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 11774#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 11772#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11771#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 11769#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 11767#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 11728#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 11729#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12096#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12095#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 12094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12093#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12091#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 12089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12085#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 12083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12081#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 12078#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 11924#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 11922#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 11921#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 11735#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 11736#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 11746#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 11744#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 11742#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 11740#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 11719#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 11049#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 11028#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 11015#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 11016#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 10913#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 10914#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 10969#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 10970#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 10975#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 10976#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12158#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11037#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 10890#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 10891#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 10972#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 10965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 10956#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 10957#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 10954#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 10955#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10886#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 10887#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 11000#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 11031#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 10884#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 10885#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10924#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10918#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10888#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10889#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11036#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11032#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11025#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11026#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10995#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10996#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10953#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10925#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10917#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10882#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10883#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11046#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11029#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11024#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10999#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10994#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10958#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10951#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10952#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12125#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12124#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12123#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12122#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12121#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12120#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12119#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12118#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12117#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12116#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12115#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12114#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12107#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11936#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11935#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11934#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11932#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11931#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11810#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11809#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11807#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11805#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11804#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11803#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11801#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11799#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11797#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11795#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11793#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11791#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11789#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11787#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11785#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11783#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11781#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11779#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11777#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11775#L594-1 calculate_output_#res := -2; 11773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10901#L606-2 [2018-11-28 13:31:14,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:14,318 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-28 13:31:14,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:14,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:14,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:14,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:14,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:14,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:14,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-11-28 13:31:14,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:14,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:14,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:14,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:14,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:14,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:14,361 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-11-28 13:31:14,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:14,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:14,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:14,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:14,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:31:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:31:14,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:31:14,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:31:15,397 WARN L180 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-28 13:31:15,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:31:15,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:31:15,460 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2018-11-28 13:31:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:31:15,890 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2018-11-28 13:31:15,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:31:15,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2018-11-28 13:31:15,893 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-11-28 13:31:15,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2018-11-28 13:31:15,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2018-11-28 13:31:15,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2018-11-28 13:31:15,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2018-11-28 13:31:15,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:31:15,897 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 13:31:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2018-11-28 13:31:15,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2018-11-28 13:31:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-11-28 13:31:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2018-11-28 13:31:15,908 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 13:31:15,908 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-11-28 13:31:15,908 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 13:31:15,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2018-11-28 13:31:15,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-11-28 13:31:15,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:31:15,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:31:15,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:31:15,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:31:15,912 INFO L794 eck$LassoCheckResult]: Stem: 13549#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 13429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14305#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14303#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14301#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 13503#L597 [2018-11-28 13:31:15,912 INFO L796 eck$LassoCheckResult]: Loop: 13503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13505#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13539#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13543#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13558#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13498#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13499#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 13503#L597 [2018-11-28 13:31:15,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:15,912 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-11-28 13:31:15,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:15,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:15,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:15,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:15,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:15,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:15,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-11-28 13:31:15,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:15,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:15,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:15,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:15,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:15,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:31:15,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-11-28 13:31:15,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:31:15,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:31:15,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:15,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:31:15,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:31:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:31:16,084 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:31:16,084 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:31:16,084 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:31:16,084 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:31:16,084 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 13:31:16,084 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,084 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:31:16,084 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:31:16,084 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label32_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-28 13:31:16,084 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:31:16,084 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:31:16,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 13:31:16,269 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:31:16,269 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,273 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,273 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,275 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,275 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,291 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,293 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,293 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,309 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,311 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,311 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,327 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,327 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,329 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,329 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,344 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,346 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,347 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,363 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,365 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,365 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,381 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,381 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,383 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,383 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,399 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,400 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,400 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,421 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,423 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,423 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,439 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,441 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,441 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,457 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,459 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,459 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,485 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,487 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,487 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,502 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,503 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,505 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,505 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,523 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,525 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,525 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,540 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,540 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,542 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,542 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,557 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,557 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,576 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:31:16,576 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,734 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,734 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,750 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,752 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,752 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,767 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,767 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,769 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,769 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,783 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,784 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,800 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 13:31:16,800 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,934 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,935 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,950 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,950 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,952 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,952 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_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:31:16,967 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 13:31:16,967 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 13:31:16,969 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 13:31:16,969 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-28 13:31:17,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:31:17 BoogieIcfgContainer [2018-11-28 13:31:17,003 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:31:17,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:31:17,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:31:17,003 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:31:17,004 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:31:08" (3/4) ... [2018-11-28 13:31:17,006 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 13:31:17,044 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_066f15a2-4649-4ef8-950a-a70651f245f9/bin-2019/uautomizer/witness.graphml [2018-11-28 13:31:17,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:31:17,044 INFO L168 Benchmark]: Toolchain (without parser) took 9558.84 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 431.5 MB). Free memory was 957.1 MB in the beginning and 1.3 GB in the end (delta: -315.7 MB). Peak memory consumption was 115.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:31:17,045 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:31:17,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:31:17,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.87 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:31:17,046 INFO L168 Benchmark]: Boogie Preprocessor took 41.92 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: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:31:17,046 INFO L168 Benchmark]: RCFGBuilder took 835.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.2 MB in the end (delta: 100.0 MB). Peak memory consumption was 100.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:31:17,046 INFO L168 Benchmark]: BuchiAutomizer took 8158.98 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 317.2 MB). Free memory was 988.2 MB in the beginning and 1.3 GB in the end (delta: -296.0 MB). Peak memory consumption was 526.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:31:17,047 INFO L168 Benchmark]: Witness Printer took 40.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:31:17,048 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 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 432.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.87 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.92 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: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 835.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.2 MB in the end (delta: 100.0 MB). Peak memory consumption was 100.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8158.98 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 317.2 MB). Free memory was 988.2 MB in the beginning and 1.3 GB in the end (delta: -296.0 MB). Peak memory consumption was 526.1 MB. Max. memory is 11.5 GB. * Witness Printer took 40.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 8.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.0s. Construction of modules took 1.9s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s 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.9s 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: 63ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - 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@46bca974=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32c8dbb6=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@46bca974=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32c8dbb6=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@46bca974=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@32c8dbb6=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...