./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label35_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label35_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/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 f6b5db140f0af5d4dbaefce619ea0ad631629d04 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-11-10 00:10:29,717 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 00:10:29,719 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 00:10:29,727 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 00:10:29,727 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 00:10:29,728 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 00:10:29,729 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 00:10:29,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 00:10:29,732 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 00:10:29,733 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 00:10:29,733 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 00:10:29,734 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 00:10:29,734 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 00:10:29,735 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 00:10:29,736 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 00:10:29,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 00:10:29,738 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 00:10:29,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 00:10:29,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 00:10:29,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 00:10:29,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 00:10:29,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 00:10:29,746 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 00:10:29,746 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 00:10:29,746 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 00:10:29,747 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 00:10:29,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 00:10:29,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 00:10:29,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 00:10:29,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 00:10:29,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 00:10:29,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 00:10:29,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 00:10:29,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 00:10:29,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 00:10:29,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 00:10:29,752 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 00:10:29,762 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 00:10:29,762 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 00:10:29,763 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 00:10:29,764 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 00:10:29,764 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 00:10:29,764 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 00:10:29,764 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 00:10:29,764 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 00:10:29,764 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 00:10:29,765 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 00:10:29,765 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 00:10:29,765 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 00:10:29,765 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 00:10:29,765 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 00:10:29,765 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 00:10:29,765 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 00:10:29,766 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 00:10:29,766 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 00:10:29,766 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 00:10:29,766 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 00:10:29,766 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 00:10:29,766 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 00:10:29,767 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 00:10:29,767 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 00:10:29,767 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 00:10:29,767 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 00:10:29,767 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 00:10:29,767 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 00:10:29,768 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 00:10:29,768 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 00:10:29,769 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 00:10:29,769 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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 -> f6b5db140f0af5d4dbaefce619ea0ad631629d04 [2018-11-10 00:10:29,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 00:10:29,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 00:10:29,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 00:10:29,810 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 00:10:29,810 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 00:10:29,811 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label35_true-unreach-call_false-termination.c [2018-11-10 00:10:29,861 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/bin-2019/uautomizer/data/696bdec85/8a3479e81dc7423db024d2bb3dbdfad9/FLAG453747f4c [2018-11-10 00:10:30,267 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 00:10:30,268 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/sv-benchmarks/c/eca-rers2012/Problem02_label35_true-unreach-call_false-termination.c [2018-11-10 00:10:30,278 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/bin-2019/uautomizer/data/696bdec85/8a3479e81dc7423db024d2bb3dbdfad9/FLAG453747f4c [2018-11-10 00:10:30,292 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/bin-2019/uautomizer/data/696bdec85/8a3479e81dc7423db024d2bb3dbdfad9 [2018-11-10 00:10:30,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 00:10:30,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 00:10:30,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 00:10:30,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 00:10:30,301 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 00:10:30,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:10:30" (1/1) ... [2018-11-10 00:10:30,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:30, skipping insertion in model container [2018-11-10 00:10:30,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:10:30" (1/1) ... [2018-11-10 00:10:30,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 00:10:30,355 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 00:10:30,641 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:10:30,646 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 00:10:30,718 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 00:10:30,731 INFO L193 MainTranslator]: Completed translation [2018-11-10 00:10:30,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:30 WrapperNode [2018-11-10 00:10:30,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 00:10:30,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 00:10:30,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 00:10:30,732 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 00:10:30,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:30" (1/1) ... [2018-11-10 00:10:30,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:30" (1/1) ... [2018-11-10 00:10:30,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 00:10:30,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 00:10:30,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 00:10:30,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 00:10:30,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:30" (1/1) ... [2018-11-10 00:10:30,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:30" (1/1) ... [2018-11-10 00:10:30,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:30" (1/1) ... [2018-11-10 00:10:30,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:30" (1/1) ... [2018-11-10 00:10:30,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:30" (1/1) ... [2018-11-10 00:10:30,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:30" (1/1) ... [2018-11-10 00:10:30,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:30" (1/1) ... [2018-11-10 00:10:30,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 00:10:30,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 00:10:30,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 00:10:30,896 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 00:10:30,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 00:10:30,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 00:10:31,906 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 00:10:31,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:10:31 BoogieIcfgContainer [2018-11-10 00:10:31,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 00:10:31,907 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 00:10:31,908 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 00:10:31,911 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 00:10:31,912 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:10:31,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:10:30" (1/3) ... [2018-11-10 00:10:31,913 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c49e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:10:31, skipping insertion in model container [2018-11-10 00:10:31,913 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:10:31,913 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:10:30" (2/3) ... [2018-11-10 00:10:31,914 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c49e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:10:31, skipping insertion in model container [2018-11-10 00:10:31,914 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 00:10:31,914 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:10:31" (3/3) ... [2018-11-10 00:10:31,917 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label35_true-unreach-call_false-termination.c [2018-11-10 00:10:31,966 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 00:10:31,967 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 00:10:31,967 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 00:10:31,967 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 00:10:31,967 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 00:10:31,967 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 00:10:31,968 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 00:10:31,968 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 00:10:31,968 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 00:10:31,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 00:10:32,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 00:10:32,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:10:32,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:10:32,027 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 00:10:32,027 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 00:10:32,027 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 00:10:32,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 00:10:32,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 00:10:32,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:10:32,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:10:32,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 00:10:32,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 00:10:32,043 INFO L793 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~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 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-11-10 00:10:32,044 INFO L795 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#L30true assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-11-10 00:10:32,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:32,050 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 00:10:32,052 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:32,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:32,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:32,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:32,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:32,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:32,148 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 00:10:32,148 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:32,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:32,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:32,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:32,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:32,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:32,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 00:10:32,175 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:32,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:32,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:10:32,248 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-10 00:10:32,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:10:32,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 00:10:32,372 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:10:32,373 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:10:32,373 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:10:32,373 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:10:32,374 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 00:10:32,374 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:10:32,374 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:10:32,374 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:10:32,374 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label35_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 00:10:32,375 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:10:32,375 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:10:32,394 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-10 00:10:32,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:10:32,433 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-10 00:10:32,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:10:32,441 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-10 00:10:32,444 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-10 00:10:32,446 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-10 00:10:32,453 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-10 00:10:32,648 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:10:32,649 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:32,654 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:32,654 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:32,686 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:32,686 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:32,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:32,692 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:32,699 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:32,699 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:32,721 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:32,721 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:32,751 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:32,751 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:32,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:32,756 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:32,771 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:32,771 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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) [2018-11-10 00:10:32,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:32,806 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:10:32,851 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:32,851 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:32,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:32,862 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:32,879 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:32,879 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:32,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:32,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:32,931 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:32,931 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:32,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:32,960 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:32,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 00:10:32,984 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:33,021 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 00:10:33,022 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:10:33,023 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:10:33,023 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:10:33,023 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:10:33,023 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:10:33,023 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:10:33,023 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:10:33,023 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:10:33,023 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label35_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 00:10:33,024 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:10:33,024 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:10:33,025 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-10 00:10:33,040 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-10 00:10:33,042 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-10 00:10:33,085 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-10 00:10:33,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-10 00:10:33,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-10 00:10:33,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-10 00:10:33,097 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-10 00:10:33,339 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2018-11-10 00:10:33,371 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:10:33,378 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:10:33,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-10 00:10:33,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:33,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:10:33,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:33,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:10:33,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,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-10 00:10:33,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,413 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 00:10:33,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:33,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:33,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,435 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:33,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:10:33,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:33,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:10:33,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,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-10 00:10:33,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:33,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:10:33,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:33,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:10:33,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,457 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,458 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:33,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:33,459 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,462 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 00:10:33,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-10 00:10:33,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,464 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,465 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:33,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,474 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,475 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:33,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,482 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 00:10:33,482 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,486 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 00:10:33,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,504 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,504 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:33,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,513 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,513 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:33,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,520 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,520 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:33,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,527 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,527 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:33,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,530 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:33,530 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:33,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,536 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 00:10:33,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,537 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,538 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,546 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,547 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,548 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,554 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 00:10:33,555 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,556 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 00:10:33,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,572 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,573 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,578 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,578 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,582 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,587 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,616 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,616 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,619 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:33,619 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,620 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:10:33,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,624 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 00:10:33,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,626 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,631 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:33,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,641 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,642 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:33,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,648 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 00:10:33,648 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,650 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 00:10:33,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,664 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,668 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,669 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:33,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,676 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,676 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:33,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,683 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,683 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:33,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,687 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,687 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:33,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:33,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,689 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:33,689 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,690 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 00:10:33,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,695 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,695 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 00:10:33,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,696 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,696 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:33,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,697 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,698 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:33,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,711 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,712 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,712 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:33,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,713 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,713 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:33,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,721 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,721 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:33,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,721 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 00:10:33,721 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,723 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 00:10:33,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,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-10 00:10:33,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,751 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:33,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,752 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,752 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:33,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,756 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,757 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:33,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,757 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,757 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:33,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,764 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:33,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,765 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,765 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:33,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,768 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,769 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:33,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,769 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,770 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:33,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,772 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,772 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:33,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,772 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:33,772 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:33,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:33,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,778 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 00:10:33,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,779 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:33,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,780 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,781 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,795 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:33,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,796 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,796 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,801 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,801 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:33,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,802 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 00:10:33,802 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,805 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 00:10:33,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,838 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:33,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,840 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,845 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,846 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,846 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:33,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,847 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,847 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,850 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,852 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:33,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,852 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,853 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,856 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,857 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,857 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:33,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,858 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,858 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,860 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,860 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:33,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,861 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:33,861 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,862 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:10:33,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,871 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 00:10:33,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-10 00:10:33,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,872 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:33,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,872 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,875 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:33,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,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-10 00:10:33,888 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,889 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:33,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,889 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,890 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:33,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,896 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,897 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:33,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,898 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 00:10:33,898 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,903 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 00:10:33,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,947 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,947 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:33,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,948 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,949 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:33,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,958 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,958 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:33,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,958 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,959 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:33,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,965 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,965 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:33,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,965 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,966 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:33,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,972 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,972 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:33,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,972 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,973 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:33,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,974 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:33,975 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,975 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:33,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,975 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:33,975 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:33,977 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 00:10:33,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:33,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:33,988 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 00:10:33,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-10 00:10:33,989 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:33,989 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:33,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:33,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:33,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:33,990 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:33,990 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:33,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:34,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,003 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:34,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:34,003 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:34,003 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:34,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:34,006 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,006 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:34,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,007 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 00:10:34,007 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:34,008 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 00:10:34,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:34,029 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,029 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:34,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:34,029 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:34,030 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:34,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,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-10 00:10:34,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,035 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:34,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:34,036 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:34,036 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:34,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:34,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,039 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:34,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:34,040 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:34,040 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:34,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:34,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,043 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:34,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:34,044 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:34,044 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:34,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:34,046 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,046 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:34,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,047 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:34,047 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:34,048 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:10:34,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,055 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 00:10:34,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-10 00:10:34,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,055 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:34,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:34,056 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:34,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:34,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,092 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,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-10 00:10:34,093 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,093 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:34,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:34,094 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:34,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:34,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,097 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:34,098 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,098 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:34,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,099 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 00:10:34,099 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:34,102 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 00:10:34,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:34,188 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,188 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:34,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:34,188 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:34,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:34,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,202 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:34,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,203 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:34,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:34,204 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:34,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:34,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:34,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,208 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:34,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:34,208 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:34,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:34,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:34,213 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,213 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:34,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:34,213 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:34,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:34,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:34,217 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:34,217 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:34,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:34,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:34,218 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:34,218 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:34,219 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 00:10:34,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:34,228 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:34,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:10:34,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:10:34,247 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 00:10:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:10:34,949 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 00:10:34,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:10:34,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 00:10:34,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 00:10:34,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 00:10:34,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 00:10:34,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 00:10:34,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 00:10:34,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:10:34,966 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 00:10:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 00:10:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 00:10:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 00:10:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 00:10:34,999 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 00:10:34,999 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 00:10:34,999 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 00:10:34,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 00:10:35,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 00:10:35,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:10:35,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:10:35,002 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 00:10:35,002 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:10:35,002 INFO L793 eck$LassoCheckResult]: Stem: 752#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 633#L606-3 [2018-11-10 00:10:35,002 INFO L795 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 978#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 977#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 886#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 887#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 761#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 696#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 697#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 853#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 634#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 635#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 633#L606-3 [2018-11-10 00:10:35,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:35,003 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 00:10:35,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:35,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:35,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:35,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:35,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:35,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:35,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 00:10:35,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:35,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:35,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:35,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:10:35,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:35,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:35,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 00:10:35,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:35,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:35,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:35,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:35,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:10:35,056 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-10 00:10:35,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:10:35,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 00:10:35,167 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-11-10 00:10:35,200 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:10:35,200 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:10:35,200 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:10:35,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:10:35,200 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 00:10:35,200 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:10:35,200 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:10:35,200 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:10:35,200 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label35_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 00:10:35,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:10:35,201 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:10:35,202 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-10 00:10:35,208 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-10 00:10:35,221 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-10 00:10:35,224 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-10 00:10:35,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:10:35,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:10:35,234 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-10 00:10:35,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:10:35,363 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:10:35,363 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:35,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:35,376 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:35,407 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:35,407 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:35,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:35,415 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:35,420 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:35,420 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:35,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:35,452 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:35,455 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:35,455 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=-2} Honda state: {~a19~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:35,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:35,499 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:35,502 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:35,502 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:35,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:35,523 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:35,547 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:35,547 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:35,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:35,555 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:35,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 00:10:35,579 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:35,616 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 00:10:35,617 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:10:35,618 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:10:35,618 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:10:35,618 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:10:35,618 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 00:10:35,618 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:10:35,618 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:10:35,618 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:10:35,618 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label35_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 00:10:35,619 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:10:35,619 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:10:35,620 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-10 00:10:35,648 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-10 00:10:35,657 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-10 00:10:35,661 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-10 00:10:35,671 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-10 00:10:35,675 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-10 00:10:35,680 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-10 00:10:35,696 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-10 00:10:35,920 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:10:35,920 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 00:10:35,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:35,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:10:35,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:35,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:10:35,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,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-10 00:10:35,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,928 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:35,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:35,928 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:35,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:35,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:10:35,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,931 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:35,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:10:35,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,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-10 00:10:35,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,934 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:35,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:35,934 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:35,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,937 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:35,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:35,937 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:35,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 00:10:35,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 00:10:35,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,943 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 00:10:35,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,944 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:35,944 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:35,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,947 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:35,947 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:35,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,950 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:35,950 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:35,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:35,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,951 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,952 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:35,952 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:35,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,954 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:35,954 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:35,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,955 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,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-10 00:10:35,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,956 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:35,956 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:35,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:35,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,960 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:35,960 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:35,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:35,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,965 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:35,965 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:35,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,968 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 00:10:35,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-10 00:10:35,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,969 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:35,969 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:35,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,972 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:35,972 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:35,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,974 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,975 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:35,975 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:35,976 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:10:35,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,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-10 00:10:35,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,977 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:35,978 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:35,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,979 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:35,980 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:35,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,982 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:35,982 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:35,982 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:10:35,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,986 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:35,986 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:35,987 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:10:35,987 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,991 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,993 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:35,993 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:35,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:35,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:35,997 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 00:10:35,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:35,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:35,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:35,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:35,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:35,998 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:35,998 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:35,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:36,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,001 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,001 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:36,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:36,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,005 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,005 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,005 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 00:10:36,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:36,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,007 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,007 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:36,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:36,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,009 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,009 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:36,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:36,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,012 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,012 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,013 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 00:10:36,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:36,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,017 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,017 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,018 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 00:10:36,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 00:10:36,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,024 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,025 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:36,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,029 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 00:10:36,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-10 00:10:36,029 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,029 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,030 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:36,030 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:36,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,033 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,033 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,034 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:36,034 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:36,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,038 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,038 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,039 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,039 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:36,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:36,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,041 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,041 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,041 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:36,041 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:36,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,043 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,043 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:36,044 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:36,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,046 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,047 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,047 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,047 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:36,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:36,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,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-10 00:10:36,052 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,053 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,053 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,053 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:36,054 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:36,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,062 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,062 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,062 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 00:10:36,063 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 00:10:36,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,067 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 00:10:36,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-10 00:10:36,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,068 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:36,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,069 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,069 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:36,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,072 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,073 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,073 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:36,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,073 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,074 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:36,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,079 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,079 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:36,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,080 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,080 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,080 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:10:36,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,082 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,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-10 00:10:36,082 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,083 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:36,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,083 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,083 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:36,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,085 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:36,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,086 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,086 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:36,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,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-10 00:10:36,090 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,090 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:36,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,090 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,090 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,091 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:10:36,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,099 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,099 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:36,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,099 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,099 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,101 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:10:36,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,114 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,114 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 00:10:36,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,115 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,116 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:36,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,122 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 00:10:36,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-10 00:10:36,123 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,123 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,124 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,125 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:36,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,130 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,130 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,130 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,131 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:36,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,139 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,139 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,139 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,139 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,141 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 00:10:36,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,142 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,143 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,143 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,144 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:36,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,145 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,146 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,147 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:36,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,152 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,152 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,152 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,152 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,154 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 00:10:36,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,165 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,165 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,165 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,168 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 00:10:36,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,187 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,187 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 00:10:36,189 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 00:10:36,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,199 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 00:10:36,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,200 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,200 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,200 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,201 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:36,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,202 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,203 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,204 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,204 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:36,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,208 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,208 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,209 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,209 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,209 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:10:36,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,211 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,212 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,212 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,212 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,213 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:36,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,215 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,215 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,215 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,215 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:36,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,218 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,218 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,218 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,218 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,219 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:10:36,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,224 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,225 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,225 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,226 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 00:10:36,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,234 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 00:10:36,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,234 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 00:10:36,235 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 00:10:36,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,241 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 00:10:36,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,242 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,242 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,242 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:36,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:36,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,246 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,247 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:36,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:36,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,255 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,256 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,256 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:36,256 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 00:10:36,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,259 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,259 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:36,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:36,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,262 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,263 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,263 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,263 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:36,264 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:36,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,266 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,267 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,267 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,268 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,268 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:36,269 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 00:10:36,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,278 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,278 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,279 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 00:10:36,279 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:36,280 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 00:10:36,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,302 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 00:10:36,303 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 00:10:36,303 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 00:10:36,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 00:10:36,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 00:10:36,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 00:10:36,303 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 00:10:36,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 00:10:36,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 00:10:36,326 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 00:10:36,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:10:36,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:10:36,327 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 00:10:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:10:36,824 INFO L93 Difference]: Finished difference Result 660 states and 919 transitions. [2018-11-10 00:10:36,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:10:36,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 919 transitions. [2018-11-10 00:10:36,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 00:10:36,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 919 transitions. [2018-11-10 00:10:36,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 00:10:36,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 00:10:36,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 919 transitions. [2018-11-10 00:10:36,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:10:36,840 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 00:10:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 919 transitions. [2018-11-10 00:10:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 00:10:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 00:10:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 919 transitions. [2018-11-10 00:10:36,862 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 00:10:36,862 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 00:10:36,862 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 00:10:36,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 919 transitions. [2018-11-10 00:10:36,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 00:10:36,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:10:36,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:10:36,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 00:10:36,871 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [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, 1, 1, 1] [2018-11-10 00:10:36,871 INFO L793 eck$LassoCheckResult]: Stem: 1798#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-11-10 00:10:36,873 INFO L795 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 2240#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2239#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2238#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 2237#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1685#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2279#L606-3 assume true; 2278#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2277#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2271#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1981#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 1982#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 1738#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 1739#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 1908#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 1674#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 1675#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 2275#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 2253#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 1962#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 1817#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 1818#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2265#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2263#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2264#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 2269#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 2268#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2267#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 2266#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2261#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2262#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 1771#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 1772#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 1773#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 1774#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 1831#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2151#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2149#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2147#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 2145#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2143#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2141#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2139#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 2138#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2137#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2136#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 1944#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 1762#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 1730#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 1731#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 1842#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 1843#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 1950#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 1764#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 1765#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 1766#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 2241#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-10 00:10:36,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:36,873 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 00:10:36,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:36,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:36,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:36,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:36,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:36,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 00:10:36,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:36,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:36,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:36,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:10:36,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:10:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:10:36,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:10:36,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 00:10:36,993 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:10:36,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 00:10:36,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 00:10:36,993 INFO L87 Difference]: Start difference. First operand 660 states and 919 transitions. cyclomatic complexity: 260 Second operand 4 states. [2018-11-10 00:10:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:10:37,709 INFO L93 Difference]: Finished difference Result 1228 states and 1700 transitions. [2018-11-10 00:10:37,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 00:10:37,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1700 transitions. [2018-11-10 00:10:37,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 00:10:37,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1700 transitions. [2018-11-10 00:10:37,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 00:10:37,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 00:10:37,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1700 transitions. [2018-11-10 00:10:37,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:10:37,725 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1700 transitions. [2018-11-10 00:10:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1700 transitions. [2018-11-10 00:10:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 00:10:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 00:10:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1694 transitions. [2018-11-10 00:10:37,747 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1694 transitions. [2018-11-10 00:10:37,747 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1694 transitions. [2018-11-10 00:10:37,747 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 00:10:37,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1694 transitions. [2018-11-10 00:10:37,752 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 00:10:37,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:10:37,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:10:37,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 00:10:37,754 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 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-10 00:10:37,754 INFO L793 eck$LassoCheckResult]: Stem: 3692#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-11-10 00:10:37,756 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4697#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4696#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3838#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 3839#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 3701#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 3630#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 3631#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 3799#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3579#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3855#L606-3 assume true; 4655#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4654#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4632#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3670#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4629#L606-3 assume true; 4628#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4626#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4624#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4623#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4622#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4620#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4618#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4616#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4614#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 4612#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 4610#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 4608#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 4606#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4604#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 4602#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4600#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4598#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4597#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 4595#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 4593#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4591#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 4589#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4587#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4585#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 4583#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4581#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 4579#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 4577#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4575#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4573#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4571#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4570#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 4568#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4566#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4564#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4562#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 4560#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4558#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4556#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 4555#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4552#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 4549#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 4545#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4541#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 4536#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4484#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4483#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 4482#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 4481#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 4030#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-11-10 00:10:37,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:37,757 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 00:10:37,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:37,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:37,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:37,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:37,762 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 00:10:37,762 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:37,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:37,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:37,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:10:37,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:10:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 00:10:37,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:10:37,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:10:37,853 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:10:37,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:10:37,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:10:37,854 INFO L87 Difference]: Start difference. First operand 1225 states and 1694 transitions. cyclomatic complexity: 471 Second operand 3 states. [2018-11-10 00:10:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:10:38,342 INFO L93 Difference]: Finished difference Result 1509 states and 2003 transitions. [2018-11-10 00:10:38,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:10:38,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2003 transitions. [2018-11-10 00:10:38,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 00:10:38,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2003 transitions. [2018-11-10 00:10:38,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 00:10:38,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 00:10:38,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2003 transitions. [2018-11-10 00:10:38,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:10:38,364 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2003 transitions. [2018-11-10 00:10:38,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2003 transitions. [2018-11-10 00:10:38,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 00:10:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 00:10:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2001 transitions. [2018-11-10 00:10:38,387 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2001 transitions. [2018-11-10 00:10:38,387 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2001 transitions. [2018-11-10 00:10:38,387 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 00:10:38,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2001 transitions. [2018-11-10 00:10:38,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 00:10:38,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:10:38,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:10:38,396 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 00:10:38,397 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 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-10 00:10:38,397 INFO L793 eck$LassoCheckResult]: Stem: 6429#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-10 00:10:38,397 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7536#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7534#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7528#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7527#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7525#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7523#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7521#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7519#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7517#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7515#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7513#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7511#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7509#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7507#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7505#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7503#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7501#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7499#L106 assume (~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6543#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6918#L606-3 assume true; 6916#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6914#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6912#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6736#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7309#L606-3 assume true; 7307#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7305#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7303#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7301#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7299#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7297#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7295#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7293#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7291#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7289#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7287#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7285#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7283#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7282#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7281#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7279#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7277#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7275#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 7273#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 7271#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 7269#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 7267#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 7265#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 7263#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 7261#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 7259#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 7257#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 7255#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 7253#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 7251#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 7249#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 7247#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 7245#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 7243#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7241#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 7239#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 7237#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 7235#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 7233#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 7231#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 7229#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 7227#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 7225#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 7223#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 7221#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 7219#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 7217#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 7215#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 7212#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 7213#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-11-10 00:10:38,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:38,397 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 00:10:38,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:38,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:38,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:38,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:38,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:38,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 00:10:38,403 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:38,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:38,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:38,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:10:38,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:10:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 00:10:38,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:10:38,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:10:38,448 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:10:38,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:10:38,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:10:38,449 INFO L87 Difference]: Start difference. First operand 1508 states and 2001 transitions. cyclomatic complexity: 495 Second operand 3 states. [2018-11-10 00:10:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:10:38,983 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-11-10 00:10:38,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:10:38,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-11-10 00:10:38,990 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 00:10:38,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 00:10:38,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 00:10:38,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 00:10:38,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-11-10 00:10:38,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:10:38,998 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 00:10:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-11-10 00:10:39,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 00:10:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 00:10:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 00:10:39,013 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 00:10:39,014 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 00:10:39,014 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 00:10:39,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-11-10 00:10:39,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 00:10:39,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:10:39,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:10:39,021 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 00:10:39,021 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, 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-10 00:10:39,021 INFO L793 eck$LassoCheckResult]: Stem: 9450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-10 00:10:39,021 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10759#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9430#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9431#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9600#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10196#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 10369#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10368#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 10366#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10364#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 10362#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 10360#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 10358#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 10356#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10354#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 10352#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10350#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10348#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 10337#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9588#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9399#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9400#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9622#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10609#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10604#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 10599#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10595#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 10591#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 10584#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9789#L165 assume (~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9679#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9782#L606-3 assume true; 9780#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9778#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9776#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9774#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9772#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9770#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9768#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9766#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9764#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9762#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9760#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9758#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9756#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9754#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9752#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9750#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9748#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9746#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9744#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9742#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9740#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9738#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9736#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9734#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 9732#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9730#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 9728#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 9725#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9723#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9721#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9719#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9717#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 9715#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9713#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9711#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9709#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 9707#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9705#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9703#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 9701#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9699#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 9697#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 9695#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9693#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 9691#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9689#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9687#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 9685#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9682#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9683#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-10 00:10:39,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:39,022 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 00:10:39,022 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:39,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:39,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:39,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:39,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:39,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 00:10:39,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:39,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:39,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:39,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 00:10:39,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:10:39,100 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 00:10:39,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:10:39,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 00:10:39,101 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 00:10:39,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 00:10:39,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 00:10:39,102 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-10 00:10:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:10:39,310 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-11-10 00:10:39,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 00:10:39,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-11-10 00:10:39,316 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 00:10:39,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 00:10:39,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 00:10:39,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 00:10:39,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-11-10 00:10:39,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:10:39,322 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 00:10:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-11-10 00:10:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 00:10:39,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 00:10:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 00:10:39,336 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 00:10:39,336 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 00:10:39,336 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 00:10:39,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-11-10 00:10:39,341 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 00:10:39,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:10:39,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:10:39,342 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 00:10:39,342 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, 1] [2018-11-10 00:10:39,342 INFO L793 eck$LassoCheckResult]: Stem: 12458#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-10 00:10:39,343 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13357#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13355#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13354#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 13352#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13351#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 13350#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13349#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 13347#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13345#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13339#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 13338#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 13336#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 13334#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13332#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 13330#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13328#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13326#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13324#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 13322#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 13320#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13318#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 13316#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13314#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13312#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 13310#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13308#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 13306#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 13304#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 13302#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 13300#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13298#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13296#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 13294#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13292#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13290#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13288#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 13286#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13284#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13282#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 13280#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13278#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13276#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 13274#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13272#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 13270#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 13268#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 13266#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 13264#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 13262#L253 assume !((~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9); 13260#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13258#L261 assume !(~a17~0 == 9 && ~a21~0 == 1 && ~a11~0 == 1 && (calculate_output_~input == 3 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a19~0 == 1); 13256#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13254#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13252#L283 assume !((((~a17~0 == 8 && (calculate_output_~input == 6 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a21~0 == 1) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a19~0 == 1); 13250#L286 assume !((!(~a11~0 == 1) && (!(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 11) || (~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13248#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13246#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13244#L297 assume !(~a11~0 == 1 && (~a17~0 == 9 && ~a28~0 == 9 && ~a19~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a21~0 == 1); 13242#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13240#L314 assume !(~a19~0 == 1 && ~a21~0 == 1 && ((calculate_output_~input == 5 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a11~0 == 1) && ~a17~0 == 9); 13238#L328 assume !((~a19~0 == 1 && ((!(~a11~0 == 1) && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a28~0 == 10) && ~a21~0 == 1) && ~a17~0 == 8); 13236#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13234#L337 assume !(((!(~a19~0 == 1) && (calculate_output_~input == 4 && (((!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13232#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13230#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 13228#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13226#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 13224#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13222#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13220#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13218#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 13216#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13214#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 13212#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13210#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13208#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13206#L409 assume !(~a19~0 == 1 && ~a17~0 == 8 && ((((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3) && !(~a11~0 == 1)) && ~a21~0 == 1); 13204#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13202#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13200#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13198#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13196#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13194#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13192#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13190#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13188#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12356#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13185#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13183#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13181#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13179#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13177#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13175#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13173#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13171#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13169#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13166#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13164#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13162#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13160#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13158#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13156#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13154#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13152#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13150#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13148#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13147#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13146#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13144#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13142#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13140#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13139#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12488#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13412#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13410#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13408#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13406#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13404#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13402#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13400#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13398#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13396#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13394#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13392#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13390#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13388#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13386#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13384#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13382#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13380#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13378#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13376#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13374#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13372#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13370#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13368#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13366#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13364#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13362#L594-1 calculate_output_#res := -2; 13360#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-11-10 00:10:39,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 00:10:39,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:39,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:39,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:39,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:39,348 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 00:10:39,348 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:39,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:39,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:39,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:39,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:39,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:39,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 00:10:39,395 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:39,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:39,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:39,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:39,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 00:10:39,749 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-10 00:10:39,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 00:10:39,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 00:10:40,530 WARN L179 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 00:10:40,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 00:10:40,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 00:10:40,616 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-10 00:10:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 00:10:41,542 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-11-10 00:10:41,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 00:10:41,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-11-10 00:10:41,559 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 00:10:41,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-11-10 00:10:41,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 00:10:41,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 00:10:41,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-11-10 00:10:41,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 00:10:41,572 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-11-10 00:10:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-11-10 00:10:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 00:10:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 00:10:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-11-10 00:10:41,599 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 00:10:41,600 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 00:10:41,600 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 00:10:41,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-11-10 00:10:41,607 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 00:10:41,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 00:10:41,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 00:10:41,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:10:41,608 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 00:10:41,608 INFO L793 eck$LassoCheckResult]: Stem: 15663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16952#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16949#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16946#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16295#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 15805#L597 [2018-11-10 00:10:41,608 INFO L795 eck$LassoCheckResult]: Loop: 15805#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16271#L606-3 assume true; 16269#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16267#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16265#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16263#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16261#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 16259#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16257#L47 assume ((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10;~a25~0 := 0;calculate_output_#res := -1; 15805#L597 [2018-11-10 00:10:41,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:41,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 00:10:41,608 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:41,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:41,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:41,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:41,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:41,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:41,617 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 00:10:41,618 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:41,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:41,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:41,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:41,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:41,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 00:10:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 00:10:41,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 00:10:41,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 00:10:41,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:41,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 00:10:41,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 00:10:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 00:10:41,855 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2018-11-10 00:10:41,887 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 00:10:41,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 00:10:41,887 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 00:10:41,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 00:10:41,887 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 00:10:41,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 00:10:41,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 00:10:41,888 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 00:10:41,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label35_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 00:10:41,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 00:10:41,888 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 00:10:41,890 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-10 00:10:41,896 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-10 00:10:41,898 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-10 00:10:41,900 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-10 00:10:41,901 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-10 00:10:41,903 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-10 00:10:41,908 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-10 00:10:41,910 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-10 00:10:41,912 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-10 00:10:41,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:10:41,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 00:10:41,920 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-10 00:10:41,924 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-10 00:10:41,927 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-10 00:10:41,930 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-10 00:10:41,933 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-10 00:10:41,948 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-10 00:10:41,957 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-10 00:10:41,963 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-10 00:10:41,966 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-10 00:10:41,969 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-10 00:10:42,108 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 00:10:42,108 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,112 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,115 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,115 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,136 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,136 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,157 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,157 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,164 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,164 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,185 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,185 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,188 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,188 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,212 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,213 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,234 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,255 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,255 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,258 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,261 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,261 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,282 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,302 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,302 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,306 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,306 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,327 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,327 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,330 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,333 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,333 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,354 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,354 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,375 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,375 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,379 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,379 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,400 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,400 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,404 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,404 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,410 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,411 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,431 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,432 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,434 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,434 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,454 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,455 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,475 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,476 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,479 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,506 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 00:10:42,506 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,755 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,755 INFO L446 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=4, ULTIMATE.start_calculate_output_~input=3, ULTIMATE.start_main_~input~0=5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-4, ULTIMATE.start_calculate_output_~input=-3, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [1, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,776 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:42,779 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:42,779 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:42,799 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:42,822 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 00:10:42,822 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:43,002 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:43,002 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:43,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:43,022 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:43,042 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:43,042 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:43,046 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:43,046 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:43,048 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:43,049 INFO L446 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_5371ee55-12be-4887-9afb-e9e79ec8cee3/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-10 00:10:43,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 00:10:43,069 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 00:10:43,072 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 00:10:43,072 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-10 00:10:43,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:10:43 BoogieIcfgContainer [2018-11-10 00:10:43,116 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 00:10:43,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 00:10:43,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 00:10:43,117 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 00:10:43,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:10:31" (3/4) ... [2018-11-10 00:10:43,124 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 00:10:43,163 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5371ee55-12be-4887-9afb-e9e79ec8cee3/bin-2019/uautomizer/witness.graphml [2018-11-10 00:10:43,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 00:10:43,164 INFO L168 Benchmark]: Toolchain (without parser) took 12867.63 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 493.9 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). Peak memory consumption was 371.2 MB. Max. memory is 11.5 GB. [2018-11-10 00:10:43,164 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:10:43,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.74 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 924.3 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-10 00:10:43,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 924.3 MB in the beginning and 1.2 GB in the end (delta: -226.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-10 00:10:43,165 INFO L168 Benchmark]: Boogie Preprocessor took 47.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. [2018-11-10 00:10:43,165 INFO L168 Benchmark]: RCFGBuilder took 1010.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.6 MB). Peak memory consumption was 110.6 MB. Max. memory is 11.5 GB. [2018-11-10 00:10:43,166 INFO L168 Benchmark]: BuchiAutomizer took 11209.23 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 332.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -43.8 MB). Peak memory consumption was 531.2 MB. Max. memory is 11.5 GB. [2018-11-10 00:10:43,166 INFO L168 Benchmark]: Witness Printer took 46.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 00:10:43,168 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 433.74 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 924.3 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 924.3 MB in the beginning and 1.2 GB in the end (delta: -226.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1010.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.6 MB). Peak memory consumption was 110.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11209.23 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 332.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -43.8 MB). Peak memory consumption was 531.2 MB. Max. memory is 11.5 GB. * Witness Printer took 46.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 6.6s. Construction of modules took 3.0s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3082 SDslu, 490 SDs, 0 SdLazy, 3702 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s 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: 88ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - 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@2f9b75d4=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@226ad43c=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@2f9b75d4=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@226ad43c=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@2f9b75d4=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@226ad43c=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 4 + -4*0^k + -4*k + -5*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 5 + -5*0^k + -5*k + -5*0^k, input=6 + sum_{k=0}^i 3 + -3*0^k + -3*k + -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 6GEVs Lambdas: [1, 0, 0, 0, 0, 0] Mus: [1, 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)) [L614] CALL calculate_output(input) [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] RET, EXPR calculate_output(input) [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)) [L614] CALL calculate_output(input) [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...