./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.3_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.3_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/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 94ba032acbdf60cd08371ca325fec24fa00e036a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-aa41828 [2018-11-23 06:21:16,879 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:21:16,880 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:21:16,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:21:16,887 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:21:16,888 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:21:16,889 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:21:16,890 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:21:16,891 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:21:16,891 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:21:16,892 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:21:16,892 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:21:16,893 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:21:16,894 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:21:16,894 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:21:16,895 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:21:16,895 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:21:16,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:21:16,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:21:16,900 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:21:16,900 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:21:16,901 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:21:16,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:21:16,903 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:21:16,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:21:16,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:21:16,904 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:21:16,905 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:21:16,906 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:21:16,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:21:16,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:21:16,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:21:16,908 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:21:16,908 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:21:16,908 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:21:16,909 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:21:16,909 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 06:21:16,920 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:21:16,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:21:16,921 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:21:16,921 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:21:16,922 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:21:16,922 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:21:16,922 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:21:16,922 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:21:16,922 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:21:16,922 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:21:16,922 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:21:16,922 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:21:16,922 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:21:16,923 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:21:16,923 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:21:16,923 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:21:16,923 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:21:16,923 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:21:16,923 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:21:16,923 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:21:16,923 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:21:16,924 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:21:16,924 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:21:16,924 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:21:16,924 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:21:16,924 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:21:16,924 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:21:16,924 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:21:16,924 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:21:16,924 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:21:16,924 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:21:16,925 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:21:16,925 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_27f4df66-8e99-416a-acf1-53847e475453/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 -> 94ba032acbdf60cd08371ca325fec24fa00e036a [2018-11-23 06:21:16,948 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:21:16,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:21:16,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:21:16,959 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:21:16,959 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:21:16,959 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/mem_slave_tlm.3_true-unreach-call_false-termination.cil.c [2018-11-23 06:21:16,996 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/bin-2019/uautomizer/data/91e12b62f/29a7fe1a514d45fe8151f74812ac82be/FLAGac37175fb [2018-11-23 06:21:17,437 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:21:17,438 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/sv-benchmarks/c/systemc/mem_slave_tlm.3_true-unreach-call_false-termination.cil.c [2018-11-23 06:21:17,447 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/bin-2019/uautomizer/data/91e12b62f/29a7fe1a514d45fe8151f74812ac82be/FLAGac37175fb [2018-11-23 06:21:17,455 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/bin-2019/uautomizer/data/91e12b62f/29a7fe1a514d45fe8151f74812ac82be [2018-11-23 06:21:17,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:21:17,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:21:17,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:21:17,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:21:17,462 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:21:17,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:21:17" (1/1) ... [2018-11-23 06:21:17,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f3324f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:21:17, skipping insertion in model container [2018-11-23 06:21:17,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:21:17" (1/1) ... [2018-11-23 06:21:17,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:21:17,504 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:21:17,674 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:21:17,677 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:21:17,730 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:21:17,741 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:21:17,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:21:17 WrapperNode [2018-11-23 06:21:17,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:21:17,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:21:17,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:21:17,742 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:21:17,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:21:17" (1/1) ... [2018-11-23 06:21:17,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:21:17" (1/1) ... [2018-11-23 06:21:17,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:21:17,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:21:17,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:21:17,826 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:21:17,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:21:17" (1/1) ... [2018-11-23 06:21:17,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:21:17" (1/1) ... [2018-11-23 06:21:17,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:21:17" (1/1) ... [2018-11-23 06:21:17,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:21:17" (1/1) ... [2018-11-23 06:21:17,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:21:17" (1/1) ... [2018-11-23 06:21:17,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:21:17" (1/1) ... [2018-11-23 06:21:17,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:21:17" (1/1) ... [2018-11-23 06:21:17,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:21:17,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:21:17,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:21:17,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:21:17,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:21:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/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-23 06:21:17,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:21:17,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:21:18,672 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:21:18,672 INFO L280 CfgBuilder]: Removed 39 assue(true) statements. [2018-11-23 06:21:18,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:21:18 BoogieIcfgContainer [2018-11-23 06:21:18,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:21:18,673 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:21:18,673 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:21:18,675 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:21:18,676 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:21:18,676 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:21:17" (1/3) ... [2018-11-23 06:21:18,677 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@255f11a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:21:18, skipping insertion in model container [2018-11-23 06:21:18,677 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:21:18,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:21:17" (2/3) ... [2018-11-23 06:21:18,677 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@255f11a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:21:18, skipping insertion in model container [2018-11-23 06:21:18,677 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:21:18,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:21:18" (3/3) ... [2018-11-23 06:21:18,679 INFO L375 chiAutomizerObserver]: Analyzing ICFG mem_slave_tlm.3_true-unreach-call_false-termination.cil.c [2018-11-23 06:21:18,711 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:21:18,712 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:21:18,712 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:21:18,712 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:21:18,712 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:21:18,712 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:21:18,712 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:21:18,712 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:21:18,713 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:21:18,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states. [2018-11-23 06:21:18,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 245 [2018-11-23 06:21:18,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:21:18,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:21:18,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:21:18,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:21:18,760 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:21:18,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 269 states. [2018-11-23 06:21:18,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 245 [2018-11-23 06:21:18,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:21:18,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:21:18,768 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:21:18,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:21:18,774 INFO L794 eck$LassoCheckResult]: Stem: 97#ULTIMATE.startENTRYtrue ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; 6#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 119#L1172true assume !(1 == ~m_run_i~0);~m_run_st~0 := 2; 123#L1172-2true assume !(1 == ~s_run_i~0);~s_run_st~0 := 2; 3#L1177-1true assume 1 == ~m_run_pc~0; 137#L1183true assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 101#L1222true assume !(2 == ~s_run_pc~0); 11#L1243true assume !(1 == ~s_run_pc~0); 70#L1338-1true [2018-11-23 06:21:18,774 INFO L796 eck$LassoCheckResult]: Loop: 70#L1338-1true assume !false; 185#L1256true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 89#L1145true assume !true; 118#L1161true start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 258#L1263true assume 1 == ~m_run_pc~0; 68#L1264true assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 38#L1303true assume !(2 == ~s_run_pc~0); 226#L1324true assume !(1 == ~s_run_pc~0); 37#L1325true assume 0 == ~m_run_st~0; 70#L1338-1true [2018-11-23 06:21:18,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:18,778 INFO L82 PathProgramCache]: Analyzing trace with hash 180491512, now seen corresponding path program 1 times [2018-11-23 06:21:18,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:18,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:18,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:18,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:21:18,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:21:18,880 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-23 06:21:18,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:21:18,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:21:18,884 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:21:18,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:18,885 INFO L82 PathProgramCache]: Analyzing trace with hash 965799094, now seen corresponding path program 1 times [2018-11-23 06:21:18,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:18,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:18,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:18,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:21:18,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:21:18,889 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-23 06:21:18,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:21:18,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:21:18,890 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:21:18,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:21:18,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:21:18,901 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 3 states. [2018-11-23 06:21:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:21:18,926 INFO L93 Difference]: Finished difference Result 269 states and 463 transitions. [2018-11-23 06:21:18,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:21:18,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 269 states and 463 transitions. [2018-11-23 06:21:18,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 240 [2018-11-23 06:21:18,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 269 states to 260 states and 454 transitions. [2018-11-23 06:21:18,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2018-11-23 06:21:18,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2018-11-23 06:21:18,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 260 states and 454 transitions. [2018-11-23 06:21:18,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:21:18,940 INFO L705 BuchiCegarLoop]: Abstraction has 260 states and 454 transitions. [2018-11-23 06:21:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states and 454 transitions. [2018-11-23 06:21:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2018-11-23 06:21:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-23 06:21:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 454 transitions. [2018-11-23 06:21:18,967 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 454 transitions. [2018-11-23 06:21:18,968 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 454 transitions. [2018-11-23 06:21:18,968 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:21:18,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 454 transitions. [2018-11-23 06:21:18,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 240 [2018-11-23 06:21:18,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:21:18,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:21:18,970 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:21:18,970 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:21:18,970 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; 556#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 557#L1172 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 751#L1172-2 assume !(1 == ~s_run_i~0);~s_run_st~0 := 2; 547#L1177-1 assume 1 == ~m_run_pc~0; 548#L1183 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 573#L1222 assume !(2 == ~s_run_pc~0); 564#L1243 assume !(1 == ~s_run_pc~0); 566#L1338-1 [2018-11-23 06:21:18,971 INFO L796 eck$LassoCheckResult]: Loop: 566#L1338-1 assume !false; 684#L1256 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 608#L1145 assume !false; 710#L1120 assume !(0 == ~m_run_st~0); 781#L1124 assume !(0 == ~s_run_st~0); 749#L1161 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 750#L1263 assume 1 == ~m_run_pc~0; 682#L1264 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 628#L1303 assume 2 == ~s_run_pc~0; 629#L1318 assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0; 626#L1325 assume 0 == ~m_run_st~0; 566#L1338-1 [2018-11-23 06:21:18,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:18,971 INFO L82 PathProgramCache]: Analyzing trace with hash 123233210, now seen corresponding path program 1 times [2018-11-23 06:21:18,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:18,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:18,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:18,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:21:18,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:21:19,006 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-23 06:21:19,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:21:19,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:21:19,007 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:21:19,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:19,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1351850848, now seen corresponding path program 1 times [2018-11-23 06:21:19,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:19,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:19,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:19,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:21:19,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:19,090 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:21:19,091 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:21:19,091 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:21:19,091 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:21:19,091 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:21:19,092 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:21:19,092 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:21:19,092 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:21:19,092 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.3_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2018-11-23 06:21:19,092 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:21:19,092 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:21:19,105 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-23 06:21:19,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:21:19,119 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-23 06:21:19,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:21:19,134 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-23 06:21:19,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:21:19,138 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-23 06:21:19,139 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-23 06:21:19,141 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-23 06:21:19,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:21:19,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:21:19,219 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:21:19,220 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/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-23 06:21:19,223 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:21:19,223 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/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-23 06:21:19,242 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:21:19,242 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:21:19,263 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 06:21:19,264 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:21:19,264 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:21:19,264 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:21:19,264 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:21:19,264 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:21:19,264 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:21:19,264 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:21:19,264 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:21:19,264 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.3_true-unreach-call_false-termination.cil.c_Iteration2_Loop [2018-11-23 06:21:19,264 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:21:19,264 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:21:19,266 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-23 06:21:19,270 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-23 06:21:19,271 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-23 06:21:19,273 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-23 06:21:19,282 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-23 06:21:19,286 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-23 06:21:19,288 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-23 06:21:19,294 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-23 06:21:19,295 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-23 06:21:19,297 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-23 06:21:19,298 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-23 06:21:19,369 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:21:19,373 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:21:19,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,376 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:19,377 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:19,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:19,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:19,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:19,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,392 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:19,393 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:19,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:19,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:19,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:19,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:19,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:19,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:19,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:19,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:19,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:19,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:19,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:19,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:19,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:19,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,420 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 06:21:19,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,421 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,421 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:19,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,429 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,430 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,432 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,432 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,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-23 06:21:19,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,436 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,436 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:19,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,444 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,445 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,449 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,449 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,453 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,453 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,457 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,458 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,460 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,461 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,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-23 06:21:19,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,464 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,465 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,467 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,468 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,469 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 06:21:19,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,470 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,470 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,471 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:21:19,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,478 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,479 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,481 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,481 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,486 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,486 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,487 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:21:19,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,494 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,494 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,498 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,499 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,504 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,504 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,511 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,512 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,518 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,518 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,523 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,523 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,525 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,526 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,527 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 06:21:19,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,528 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,528 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,529 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:21:19,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,536 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,537 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,539 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,539 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,543 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,543 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,544 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:21:19,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,551 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,552 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,555 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,556 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,560 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,560 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,564 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,565 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,567 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,568 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,571 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,572 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:19,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,574 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,575 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,576 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 06:21:19,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,577 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,577 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,577 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,577 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:19,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,587 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,588 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,588 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,589 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,591 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,591 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,591 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,592 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,599 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,599 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,599 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,599 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:19,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,608 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,608 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,609 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,609 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,613 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,613 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,614 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,614 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,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-23 06:21:19,618 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,619 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,619 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,620 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,624 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,624 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,625 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,626 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,627 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,628 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,628 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,632 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,632 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,633 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,633 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,635 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,636 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:19,637 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:19,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,638 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 06:21:19,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,638 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,639 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:19,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,639 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,639 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,641 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:21:19,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,651 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,651 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:19,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,652 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,653 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,655 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,655 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:19,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,655 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,656 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,660 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,660 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:19,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,660 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,660 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,662 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:21:19,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,670 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:19,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,671 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,671 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,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-23 06:21:19,675 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,675 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:19,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,676 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,676 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,680 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:19,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,681 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,681 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,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-23 06:21:19,686 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,687 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:19,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,687 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,688 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,690 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:19,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,690 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,691 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,695 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,695 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:19,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,695 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,696 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,698 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,698 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:19,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,698 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,699 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,700 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 06:21:19,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,701 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,701 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,701 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,701 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,703 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:21:19,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,715 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,715 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,716 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,717 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,719 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,719 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,719 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,720 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,727 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,727 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,727 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,727 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,730 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:21:19,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,743 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,743 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,744 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,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-23 06:21:19,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,750 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,751 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,752 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,758 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,758 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,759 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,760 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,767 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,767 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,767 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,769 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,771 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,771 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,773 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,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-23 06:21:19,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,780 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,780 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,781 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,783 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,783 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,784 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:19,785 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:19,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,786 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 06:21:19,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,787 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,787 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,787 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,788 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:21:19,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,794 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,794 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,795 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,795 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,798 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,798 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,799 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,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-23 06:21:19,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,802 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,802 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,802 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,803 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:21:19,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,809 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,809 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,810 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,810 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,813 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,814 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,814 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,817 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,818 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,818 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,823 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,823 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,823 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,824 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,826 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,827 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,827 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,831 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,831 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,831 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,832 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,835 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:19,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,835 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:19,836 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:19,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,838 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 06:21:19,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-23 06:21:19,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,839 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,839 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,839 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:19,841 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 06:21:19,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,904 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,904 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,904 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:19,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:19,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,907 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,907 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,907 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:19,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:19,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,910 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,910 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,910 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:19,910 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:19,911 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 06:21:19,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,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-23 06:21:19,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,922 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,922 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:19,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:19,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,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-23 06:21:19,925 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,925 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,926 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:19,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:19,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,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-23 06:21:19,930 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,930 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,930 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:19,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:19,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,937 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,937 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,938 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:19,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:19,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,941 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,941 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,941 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:19,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:19,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:19,945 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,945 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,946 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:19,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:19,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,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-23 06:21:19,949 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:19,949 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:19,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:19,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:19,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:19,950 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:19,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:19,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:19,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:19,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:21:19,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:21:19,953 INFO L87 Difference]: Start difference. First operand 260 states and 454 transitions. cyclomatic complexity: 195 Second operand 3 states. [2018-11-23 06:21:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:21:19,973 INFO L93 Difference]: Finished difference Result 260 states and 453 transitions. [2018-11-23 06:21:19,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:21:19,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 260 states and 453 transitions. [2018-11-23 06:21:19,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 240 [2018-11-23 06:21:19,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 260 states to 260 states and 453 transitions. [2018-11-23 06:21:19,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 260 [2018-11-23 06:21:19,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2018-11-23 06:21:19,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 260 states and 453 transitions. [2018-11-23 06:21:19,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:21:19,981 INFO L705 BuchiCegarLoop]: Abstraction has 260 states and 453 transitions. [2018-11-23 06:21:19,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states and 453 transitions. [2018-11-23 06:21:19,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2018-11-23 06:21:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-23 06:21:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 453 transitions. [2018-11-23 06:21:19,989 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 453 transitions. [2018-11-23 06:21:19,989 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 453 transitions. [2018-11-23 06:21:19,989 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:21:19,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 453 transitions. [2018-11-23 06:21:19,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 240 [2018-11-23 06:21:19,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:21:19,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:21:19,992 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:21:19,992 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:21:19,992 INFO L794 eck$LassoCheckResult]: Stem: 1252#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; 1082#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1083#L1172 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 1277#L1172-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 1073#L1177-1 assume 1 == ~m_run_pc~0; 1074#L1183 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 1099#L1222 assume !(2 == ~s_run_pc~0); 1090#L1243 assume !(1 == ~s_run_pc~0); 1092#L1338-1 [2018-11-23 06:21:19,992 INFO L796 eck$LassoCheckResult]: Loop: 1092#L1338-1 assume !false; 1210#L1256 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1134#L1145 assume !false; 1236#L1120 assume !(0 == ~m_run_st~0); 1307#L1124 assume !(0 == ~s_run_st~0); 1275#L1161 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 1276#L1263 assume 1 == ~m_run_pc~0; 1208#L1264 assume 1 == ~c_m_ev~0;~m_run_st~0 := 0; 1154#L1303 assume 2 == ~s_run_pc~0; 1155#L1318 assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0; 1152#L1325 assume 0 == ~m_run_st~0; 1092#L1338-1 [2018-11-23 06:21:19,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:19,992 INFO L82 PathProgramCache]: Analyzing trace with hash 121386168, now seen corresponding path program 1 times [2018-11-23 06:21:19,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:19,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:19,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:19,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:21:19,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:21:20,012 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-23 06:21:20,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:21:20,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:21:20,013 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 06:21:20,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:20,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1351850848, now seen corresponding path program 2 times [2018-11-23 06:21:20,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:20,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:20,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:20,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:21:20,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:20,069 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:21:20,069 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:21:20,069 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:21:20,069 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:21:20,069 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 06:21:20,069 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:21:20,070 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:21:20,070 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:21:20,070 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.3_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-23 06:21:20,070 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:21:20,070 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:21:20,071 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-23 06:21:20,080 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-23 06:21:20,081 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-23 06:21:20,082 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-23 06:21:20,084 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-23 06:21:20,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-23 06:21:20,089 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-23 06:21:20,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-23 06:21:20,092 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-23 06:21:20,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-23 06:21:20,096 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-23 06:21:20,172 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:21:20,173 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/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-23 06:21:20,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:21:20,175 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:21:20,182 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:21:20,182 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~s_run_pc~0=2} Honda state: {~s_run_pc~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/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-23 06:21:20,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:21:20,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:21:20,221 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:21:20,221 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:21:20,254 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:21:20,254 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:21:20,258 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:21:20,258 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/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-23 06:21:20,290 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:21:20,290 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:21:20,302 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:21:20,303 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~m_run_pc~0=1} Honda state: {~m_run_pc~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/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-23 06:21:20,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:21:20,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:21:20,337 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 06:21:20,337 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c_write_req_ev~0=1} Honda state: {~c_write_req_ev~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/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-23 06:21:20,361 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 06:21:20,362 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/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-23 06:21:20,385 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 06:21:20,385 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 06:21:20,404 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 06:21:20,405 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:21:20,405 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:21:20,405 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:21:20,405 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:21:20,405 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:21:20,405 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:21:20,405 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:21:20,405 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:21:20,405 INFO L131 ssoRankerPreferences]: Filename of dumped script: mem_slave_tlm.3_true-unreach-call_false-termination.cil.c_Iteration3_Loop [2018-11-23 06:21:20,406 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:21:20,406 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:21:20,406 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-23 06:21:20,409 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-23 06:21:20,410 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-23 06:21:20,411 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-23 06:21:20,412 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-23 06:21:20,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:21:20,416 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-23 06:21:20,417 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-23 06:21:20,420 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-23 06:21:20,423 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-23 06:21:20,425 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-23 06:21:20,486 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:21:20,486 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:21:20,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:20,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:20,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:20,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:20,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:20,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:20,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:20,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:20,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:20,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:20,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,496 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:20,496 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:20,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:20,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:20,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:20,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,503 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:20,504 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:20,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:20,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:21:20,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:21:20,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,509 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 06:21:20,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,509 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,510 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,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-23 06:21:20,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,512 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,512 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,515 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,516 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,517 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,517 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,519 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,519 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,521 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,521 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:20,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,524 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,525 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,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-23 06:21:20,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,526 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,527 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,528 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,528 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:20,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,532 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,532 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,534 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,534 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,535 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 06:21:20,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,536 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,536 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,543 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,543 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,546 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,546 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,548 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,548 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,551 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,551 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,553 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,553 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,553 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:21:20,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,556 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,557 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,559 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,559 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,561 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,561 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,562 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:21:20,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,565 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,565 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,569 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,569 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,570 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 06:21:20,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,571 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,571 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,573 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,573 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,576 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,576 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,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-23 06:21:20,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,577 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,578 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,580 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,580 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,582 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,582 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,583 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:21:20,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,586 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,587 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,588 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,588 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,591 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,591 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,592 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:21:20,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,602 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,602 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:21:20,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,604 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,604 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,605 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 06:21:20,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,606 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,607 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,607 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,610 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,610 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,610 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,611 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,613 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,613 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,614 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,614 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,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-23 06:21:20,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,615 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,615 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,616 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,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-23 06:21:20,618 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,618 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,619 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,619 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,624 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,624 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,624 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,624 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:20,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,630 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,630 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,631 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,631 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,633 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,633 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,633 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,634 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,636 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,636 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,637 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,637 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:20,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,642 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,642 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,642 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,643 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,644 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,644 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,644 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 06:21:20,645 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 06:21:20,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,645 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 06:21:20,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-23 06:21:20,646 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,646 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:20,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,646 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,647 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,650 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,650 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:20,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,650 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,651 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,654 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,654 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:20,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,654 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,655 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,657 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:20,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,657 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,657 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,660 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,660 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:20,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,661 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,661 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,664 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,665 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:20,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,665 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,665 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,666 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:21:20,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,672 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,672 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:20,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,672 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,673 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,674 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,675 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:20,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,675 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,675 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,681 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,681 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:20,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,681 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,681 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,682 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:21:20,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,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-23 06:21:20,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,689 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:20,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,689 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,689 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,691 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,691 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 06:21:20,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,691 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,692 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,693 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 06:21:20,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,694 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,694 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,695 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,700 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,700 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,700 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,701 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,706 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,706 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,707 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,708 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,708 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,709 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,709 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,714 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,715 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,715 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,716 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,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-23 06:21:20,720 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,720 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,720 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,720 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,722 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:21:20,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,732 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,733 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,733 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,735 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,737 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,737 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,737 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,738 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,743 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,743 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,743 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,747 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 06:21:20,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,756 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,756 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,757 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,758 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,758 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,759 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 06:21:20,759 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 06:21:20,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,760 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 06:21:20,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,761 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,761 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,761 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,762 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,764 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,765 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,765 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,769 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,771 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,771 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,773 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,773 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,774 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,774 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,777 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,778 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,779 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,781 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,782 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,782 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,782 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,783 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:21:20,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,787 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,788 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,788 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,790 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,790 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,790 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,793 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,793 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,793 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,793 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,794 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:21:20,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,800 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,800 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,800 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,801 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,804 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,804 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 06:21:20,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,804 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 06:21:20,804 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 06:21:20,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,806 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 06:21:20,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,806 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,806 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,807 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:20,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:20,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,810 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,810 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,811 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:20,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:20,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,816 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,816 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,816 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:20,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:20,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,820 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,820 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:20,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:20,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,824 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,824 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:20,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:20,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,828 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,828 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,828 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,828 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:20,829 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 06:21:20,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,837 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,837 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,837 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:20,838 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:20,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,841 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,841 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,841 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:20,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:20,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,845 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,845 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,845 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 06:21:20,845 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:20,846 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 06:21:20,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,856 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,856 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:20,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:20,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:21:20,860 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 06:21:20,860 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 06:21:20,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:21:20,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:21:20,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:21:20,860 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 06:21:20,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:21:20,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:21:20,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:21:20,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:21:20,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:21:20,864 INFO L87 Difference]: Start difference. First operand 260 states and 453 transitions. cyclomatic complexity: 194 Second operand 3 states. [2018-11-23 06:21:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:21:21,352 INFO L93 Difference]: Finished difference Result 434 states and 678 transitions. [2018-11-23 06:21:21,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:21:21,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 434 states and 678 transitions. [2018-11-23 06:21:21,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 420 [2018-11-23 06:21:21,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 434 states to 434 states and 678 transitions. [2018-11-23 06:21:21,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 434 [2018-11-23 06:21:21,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 434 [2018-11-23 06:21:21,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 678 transitions. [2018-11-23 06:21:21,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:21:21,360 INFO L705 BuchiCegarLoop]: Abstraction has 434 states and 678 transitions. [2018-11-23 06:21:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 678 transitions. [2018-11-23 06:21:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 428. [2018-11-23 06:21:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-23 06:21:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 672 transitions. [2018-11-23 06:21:21,372 INFO L728 BuchiCegarLoop]: Abstraction has 428 states and 672 transitions. [2018-11-23 06:21:21,372 INFO L608 BuchiCegarLoop]: Abstraction has 428 states and 672 transitions. [2018-11-23 06:21:21,372 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:21:21,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 428 states and 672 transitions. [2018-11-23 06:21:21,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 414 [2018-11-23 06:21:21,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:21:21,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:21:21,377 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:21:21,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:21:21,378 INFO L794 eck$LassoCheckResult]: Stem: 1948#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; 1780#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1781#L1172 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 1989#L1172-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 1773#L1177-1 assume !(1 == ~m_run_pc~0); 1774#L1189 assume !(2 == ~m_run_pc~0); 1958#L1197 assume !(3 == ~m_run_pc~0); 2000#L1205 assume !(4 == ~m_run_pc~0); 2001#L1213 assume !(5 == ~m_run_pc~0); 1795#L1221 assume !(6 == ~m_run_pc~0); 1796#L1222 assume !(2 == ~s_run_pc~0); 1788#L1243 assume !(1 == ~s_run_pc~0); 1790#L1338-1 [2018-11-23 06:21:21,378 INFO L796 eck$LassoCheckResult]: Loop: 1790#L1338-1 assume !false; 1903#L1256 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 1824#L1145 assume !false; 1930#L1120 assume !(0 == ~m_run_st~0); 2024#L1124 assume !(0 == ~s_run_st~0); 1987#L1161 start_simulation_~kernel_st~0 := 2;start_simulation_~kernel_st~0 := 3; 1988#L1263 assume !(1 == ~m_run_pc~0); 1847#L1270 assume !(2 == ~m_run_pc~0); 1848#L1278 assume !(3 == ~m_run_pc~0); 1894#L1286 assume !(4 == ~m_run_pc~0); 1895#L1294 assume !(5 == ~m_run_pc~0); 1904#L1302 assume !(6 == ~m_run_pc~0); 1844#L1303 assume 2 == ~s_run_pc~0; 1845#L1318 assume 1 == ~c_write_req_ev~0;~s_run_st~0 := 0; 1842#L1325 assume 0 == ~m_run_st~0; 1790#L1338-1 [2018-11-23 06:21:21,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:21,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1577837401, now seen corresponding path program 1 times [2018-11-23 06:21:21,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:21,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:21,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:21:21,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:21,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:21,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1292185185, now seen corresponding path program 1 times [2018-11-23 06:21:21,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:21,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:21,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:21:21,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:21:21,398 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-23 06:21:21,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:21:21,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:21:21,398 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:21:21,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:21:21,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:21:21,399 INFO L87 Difference]: Start difference. First operand 428 states and 672 transitions. cyclomatic complexity: 245 Second operand 3 states. [2018-11-23 06:21:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:21:21,476 INFO L93 Difference]: Finished difference Result 692 states and 1109 transitions. [2018-11-23 06:21:21,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:21:21,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 692 states and 1109 transitions. [2018-11-23 06:21:21,481 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 669 [2018-11-23 06:21:21,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 692 states to 692 states and 1109 transitions. [2018-11-23 06:21:21,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 692 [2018-11-23 06:21:21,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 692 [2018-11-23 06:21:21,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 692 states and 1109 transitions. [2018-11-23 06:21:21,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:21:21,487 INFO L705 BuchiCegarLoop]: Abstraction has 692 states and 1109 transitions. [2018-11-23 06:21:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states and 1109 transitions. [2018-11-23 06:21:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 686. [2018-11-23 06:21:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-11-23 06:21:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1103 transitions. [2018-11-23 06:21:21,502 INFO L728 BuchiCegarLoop]: Abstraction has 686 states and 1103 transitions. [2018-11-23 06:21:21,502 INFO L608 BuchiCegarLoop]: Abstraction has 686 states and 1103 transitions. [2018-11-23 06:21:21,502 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:21:21,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 686 states and 1103 transitions. [2018-11-23 06:21:21,505 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 663 [2018-11-23 06:21:21,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:21:21,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:21:21,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:21:21,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 06:21:21,506 INFO L794 eck$LassoCheckResult]: Stem: 3080#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; 2906#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 2907#L1172 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 3117#L1172-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 2899#L1177-1 assume !(1 == ~m_run_pc~0); 2900#L1189 assume !(2 == ~m_run_pc~0); 3089#L1197 assume !(3 == ~m_run_pc~0); 3130#L1205 assume !(4 == ~m_run_pc~0); 3131#L1213 assume !(5 == ~m_run_pc~0); 2922#L1221 assume !(6 == ~m_run_pc~0); 2923#L1222 assume !(2 == ~s_run_pc~0); 2915#L1243 assume !(1 == ~s_run_pc~0); 2917#L1338-1 assume !false; 3376#L1256 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 3372#L1145 [2018-11-23 06:21:21,506 INFO L796 eck$LassoCheckResult]: Loop: 3372#L1145 assume !false; 3370#L1120 assume 0 == ~m_run_st~0; 3371#L1124-1 assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 3063#L1134 assume !(0 != eval_~tmp~0); 3064#L1130 assume !(0 == ~s_run_st~0); 3372#L1145 [2018-11-23 06:21:21,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:21,506 INFO L82 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 1 times [2018-11-23 06:21:21,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:21,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:21,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:21:21,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:21,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:21,518 INFO L82 PathProgramCache]: Analyzing trace with hash 151895579, now seen corresponding path program 1 times [2018-11-23 06:21:21,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:21,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:21,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:21:21,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:21,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:21,525 INFO L82 PathProgramCache]: Analyzing trace with hash -840624511, now seen corresponding path program 1 times [2018-11-23 06:21:21,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:21,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:21,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:21:21,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:21:21,542 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-23 06:21:21,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:21:21,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 06:21:21,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:21:21,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:21:21,555 INFO L87 Difference]: Start difference. First operand 686 states and 1103 transitions. cyclomatic complexity: 420 Second operand 3 states. [2018-11-23 06:21:21,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:21:21,612 INFO L93 Difference]: Finished difference Result 1294 states and 2078 transitions. [2018-11-23 06:21:21,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:21:21,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1294 states and 2078 transitions. [2018-11-23 06:21:21,619 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1263 [2018-11-23 06:21:21,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1294 states to 1294 states and 2078 transitions. [2018-11-23 06:21:21,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1294 [2018-11-23 06:21:21,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1294 [2018-11-23 06:21:21,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1294 states and 2078 transitions. [2018-11-23 06:21:21,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:21:21,627 INFO L705 BuchiCegarLoop]: Abstraction has 1294 states and 2078 transitions. [2018-11-23 06:21:21,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states and 2078 transitions. [2018-11-23 06:21:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1098. [2018-11-23 06:21:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2018-11-23 06:21:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1770 transitions. [2018-11-23 06:21:21,641 INFO L728 BuchiCegarLoop]: Abstraction has 1098 states and 1770 transitions. [2018-11-23 06:21:21,641 INFO L608 BuchiCegarLoop]: Abstraction has 1098 states and 1770 transitions. [2018-11-23 06:21:21,641 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:21:21,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1098 states and 1770 transitions. [2018-11-23 06:21:21,645 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1067 [2018-11-23 06:21:21,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:21:21,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:21:21,646 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:21:21,646 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 06:21:21,646 INFO L794 eck$LassoCheckResult]: Stem: 5071#ULTIMATE.startENTRY ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; 4894#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 4895#L1172 assume 1 == ~m_run_i~0;~m_run_st~0 := 0; 5108#L1172-2 assume 1 == ~s_run_i~0;~s_run_st~0 := 0; 4887#L1177-1 assume !(1 == ~m_run_pc~0); 4888#L1189 assume !(2 == ~m_run_pc~0); 5078#L1197 assume !(3 == ~m_run_pc~0); 5125#L1205 assume !(4 == ~m_run_pc~0); 5126#L1213 assume !(5 == ~m_run_pc~0); 4912#L1221 assume !(6 == ~m_run_pc~0); 4913#L1222 assume !(2 == ~s_run_pc~0); 4906#L1243 assume !(1 == ~s_run_pc~0); 4908#L1338-1 assume !false; 5020#L1256 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; 4940#L1145 [2018-11-23 06:21:21,646 INFO L796 eck$LassoCheckResult]: Loop: 4940#L1145 assume !false; 5866#L1120 assume 0 == ~m_run_st~0; 5865#L1124-1 assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 5863#L1134 assume !(0 != eval_~tmp~0); 5156#L1130 assume 0 == ~s_run_st~0;eval_~tmp___0~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 4938#L1149 assume !(0 != eval_~tmp___0~0); 4940#L1145 [2018-11-23 06:21:21,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:21,647 INFO L82 PathProgramCache]: Analyzing trace with hash 178290651, now seen corresponding path program 2 times [2018-11-23 06:21:21,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:21,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:21,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:21:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:21,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:21,657 INFO L82 PathProgramCache]: Analyzing trace with hash 413786765, now seen corresponding path program 1 times [2018-11-23 06:21:21,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:21,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:21,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:21:21,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:21,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:21:21,662 INFO L82 PathProgramCache]: Analyzing trace with hash -289564953, now seen corresponding path program 1 times [2018-11-23 06:21:21,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:21:21,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:21:21,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:21:21,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:21:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:21:22,053 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; [?] havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~m_run_i~0;~m_run_st~0 := 0; [?] assume 1 == ~s_run_i~0;~s_run_st~0 := 0; [?] assume !(1 == ~m_run_pc~0); [?] assume !(2 == ~m_run_pc~0); [?] assume !(3 == ~m_run_pc~0); [?] assume !(4 == ~m_run_pc~0); [?] assume !(5 == ~m_run_pc~0); [?] assume !(6 == ~m_run_pc~0); [?] assume !(2 == ~s_run_pc~0); [?] assume !(1 == ~s_run_pc~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172-L1176] assume 1 == ~m_run_i~0; [L1173] ~m_run_st~0 := 0; [L1177-L1181] assume 1 == ~s_run_i~0; [L1178] ~s_run_st~0 := 0; [L1182-L1235] assume !(1 == ~m_run_pc~0); [L1190-L1234] assume !(2 == ~m_run_pc~0); [L1198-L1233] assume !(3 == ~m_run_pc~0); [L1206-L1232] assume !(4 == ~m_run_pc~0); [L1214-L1231] assume !(5 == ~m_run_pc~0); [L1222-L1230] assume !(6 == ~m_run_pc~0); [L1236-L1253] assume !(2 == ~s_run_pc~0); [L1244-L1252] assume !(1 == ~s_run_pc~0); [L1255-L1344] assume !false; [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172-L1176] assume 1 == ~m_run_i~0; [L1173] ~m_run_st~0 := 0; [L1177-L1181] assume 1 == ~s_run_i~0; [L1178] ~s_run_st~0 := 0; [L1182-L1235] assume !(1 == ~m_run_pc~0); [L1190-L1234] assume !(2 == ~m_run_pc~0); [L1198-L1233] assume !(3 == ~m_run_pc~0); [L1206-L1232] assume !(4 == ~m_run_pc~0); [L1214-L1231] assume !(5 == ~m_run_pc~0); [L1222-L1230] assume !(6 == ~m_run_pc~0); [L1236-L1253] assume !(2 == ~s_run_pc~0); [L1244-L1252] assume !(1 == ~s_run_pc~0); [L1255-L1344] assume !false; [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [L1352] havoc ~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1168] havoc ~kernel_st~0; [L1171] ~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] ~kernel_st~0 := 1; [L1114] havoc ~tmp~0; [L1115] havoc ~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [L1352] havoc ~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1168] havoc ~kernel_st~0; [L1171] ~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] ~kernel_st~0 := 1; [L1114] havoc ~tmp~0; [L1115] havoc ~tmp___0~0; [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L19] int s_memory1 ; [L20] int s_memory2 ; [L22] int s_run_st ; [L23] int s_run_i ; [L24] int s_run_pc ; [L25] int c_m_lock ; [L26] int c_m_ev ; [L27] int c_req_type ; [L28] int c_req_a ; [L29] int c_req_d ; [L30] int c_rsp_type ; [L31] int c_rsp_status ; [L32] int c_rsp_d ; [L33] int c_empty_req ; [L34] int c_empty_rsp ; [L35] int c_read_req_ev ; [L36] int c_write_req_ev ; [L37] int c_read_rsp_ev ; [L38] int c_write_rsp_ev ; [L39] static int d_t ; [L40] static int a_t ; [L41] static int req_t_type ; [L42] static int req_t_a ; [L43] static int req_t_d ; [L44] static int rsp_t_type ; [L45] static int rsp_t_status ; [L46] static int rsp_t_d ; [L47] static int req_tt_type ; [L48] static int req_tt_a ; [L49] static int req_tt_d ; [L50] static int rsp_tt_type ; [L51] static int rsp_tt_status ; [L52] static int rsp_tt_d ; [L845] static int req_t_type___0 ; [L846] static int req_t_a___0 ; [L847] static int req_t_d___0 ; [L848] static int rsp_t_type___0 ; [L849] static int rsp_t_status___0 ; [L850] static int rsp_t_d___0 ; [L1352] int __retres1 ; [L1356] c_m_lock = 0 [L1357] c_m_ev = 2 [L1359] m_run_i = 1 [L1360] m_run_pc = 0 [L1361] s_run_i = 1 [L1362] s_run_pc = 0 [L1363] c_empty_req = 1 [L1364] c_empty_rsp = 1 [L1365] c_read_req_ev = 2 [L1366] c_write_req_ev = 2 [L1367] c_read_rsp_ev = 2 [L1368] c_write_rsp_ev = 2 [L1369] c_m_lock = 0 [L1370] c_m_ev = 2 [L1168] int kernel_st ; [L1171] kernel_st = 0 [L1172] COND TRUE (int )m_run_i == 1 [L1173] m_run_st = 0 [L1177] COND TRUE (int )s_run_i == 1 [L1178] s_run_st = 0 [L1182] COND FALSE !((int )m_run_pc == 1) [L1190] COND FALSE !((int )m_run_pc == 2) [L1198] COND FALSE !((int )m_run_pc == 3) [L1206] COND FALSE !((int )m_run_pc == 4) [L1214] COND FALSE !((int )m_run_pc == 5) [L1222] COND FALSE !((int )m_run_pc == 6) [L1236] COND FALSE !((int )s_run_pc == 2) [L1244] COND FALSE !((int )s_run_pc == 1) [L1255] COND TRUE 1 [L1258] kernel_st = 1 [L1114] int tmp ; [L1115] int tmp___0 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] assume 0 == ~m_run_st~0; [?] assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~s_run_st~0;eval_~tmp___0~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp___0~0); [L1119-L1160] assume !false; [L1121-L1129] assume 0 == ~m_run_st~0; [L1130-L1144] assume 0 == ~m_run_st~0; [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] assume !(0 != eval_~tmp~0); [L1145-L1159] assume 0 == ~s_run_st~0; [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1119-L1160] assume !false; [L1121-L1129] assume 0 == ~m_run_st~0; [L1130-L1144] assume 0 == ~m_run_st~0; [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] assume !(0 != eval_~tmp~0); [L1145-L1159] assume 0 == ~s_run_st~0; [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] assume !(0 != eval_~tmp___0~0); [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] COND FALSE !(0 != eval_~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] COND FALSE !(0 != eval_~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] COND FALSE !(0 != eval_~tmp___0~0) [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] ~tmp~0 := #t~nondet1; [L1132] havoc #t~nondet1; [L1134-L1141] COND FALSE !(0 != ~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] ~tmp___0~0 := #t~nondet2; [L1147] havoc #t~nondet2; [L1149-L1156] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] ~tmp~0 := #t~nondet1; [L1132] havoc #t~nondet1; [L1134-L1141] COND FALSE !(0 != ~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] ~tmp___0~0 := #t~nondet2; [L1147] havoc #t~nondet2; [L1149-L1156] COND FALSE !(0 != ~tmp___0~0) [L1119] COND TRUE 1 [L1121] COND TRUE (int )m_run_st == 0 [L1130] COND TRUE (int )m_run_st == 0 [L1132] tmp = __VERIFIER_nondet_int() [L1134] COND FALSE !(\read(tmp)) [L1145] COND TRUE (int )s_run_st == 0 [L1147] tmp___0 = __VERIFIER_nondet_int() [L1149] COND FALSE !(\read(tmp___0)) ----- [2018-11-23 06:21:22,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:21:22 BoogieIcfgContainer [2018-11-23 06:21:22,154 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:21:22,154 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:21:22,154 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:21:22,155 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:21:22,155 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:21:18" (3/4) ... [2018-11-23 06:21:22,158 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; [?] havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~m_run_i~0;~m_run_st~0 := 0; [?] assume 1 == ~s_run_i~0;~s_run_st~0 := 0; [?] assume !(1 == ~m_run_pc~0); [?] assume !(2 == ~m_run_pc~0); [?] assume !(3 == ~m_run_pc~0); [?] assume !(4 == ~m_run_pc~0); [?] assume !(5 == ~m_run_pc~0); [?] assume !(6 == ~m_run_pc~0); [?] assume !(2 == ~s_run_pc~0); [?] assume !(1 == ~s_run_pc~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172-L1176] assume 1 == ~m_run_i~0; [L1173] ~m_run_st~0 := 0; [L1177-L1181] assume 1 == ~s_run_i~0; [L1178] ~s_run_st~0 := 0; [L1182-L1235] assume !(1 == ~m_run_pc~0); [L1190-L1234] assume !(2 == ~m_run_pc~0); [L1198-L1233] assume !(3 == ~m_run_pc~0); [L1206-L1232] assume !(4 == ~m_run_pc~0); [L1214-L1231] assume !(5 == ~m_run_pc~0); [L1222-L1230] assume !(6 == ~m_run_pc~0); [L1236-L1253] assume !(2 == ~s_run_pc~0); [L1244-L1252] assume !(1 == ~s_run_pc~0); [L1255-L1344] assume !false; [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172-L1176] assume 1 == ~m_run_i~0; [L1173] ~m_run_st~0 := 0; [L1177-L1181] assume 1 == ~s_run_i~0; [L1178] ~s_run_st~0 := 0; [L1182-L1235] assume !(1 == ~m_run_pc~0); [L1190-L1234] assume !(2 == ~m_run_pc~0); [L1198-L1233] assume !(3 == ~m_run_pc~0); [L1206-L1232] assume !(4 == ~m_run_pc~0); [L1214-L1231] assume !(5 == ~m_run_pc~0); [L1222-L1230] assume !(6 == ~m_run_pc~0); [L1236-L1253] assume !(2 == ~s_run_pc~0); [L1244-L1252] assume !(1 == ~s_run_pc~0); [L1255-L1344] assume !false; [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [L1352] havoc ~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1168] havoc ~kernel_st~0; [L1171] ~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] ~kernel_st~0 := 1; [L1114] havoc ~tmp~0; [L1115] havoc ~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [L1352] havoc ~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1168] havoc ~kernel_st~0; [L1171] ~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] ~kernel_st~0 := 1; [L1114] havoc ~tmp~0; [L1115] havoc ~tmp___0~0; [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L19] int s_memory1 ; [L20] int s_memory2 ; [L22] int s_run_st ; [L23] int s_run_i ; [L24] int s_run_pc ; [L25] int c_m_lock ; [L26] int c_m_ev ; [L27] int c_req_type ; [L28] int c_req_a ; [L29] int c_req_d ; [L30] int c_rsp_type ; [L31] int c_rsp_status ; [L32] int c_rsp_d ; [L33] int c_empty_req ; [L34] int c_empty_rsp ; [L35] int c_read_req_ev ; [L36] int c_write_req_ev ; [L37] int c_read_rsp_ev ; [L38] int c_write_rsp_ev ; [L39] static int d_t ; [L40] static int a_t ; [L41] static int req_t_type ; [L42] static int req_t_a ; [L43] static int req_t_d ; [L44] static int rsp_t_type ; [L45] static int rsp_t_status ; [L46] static int rsp_t_d ; [L47] static int req_tt_type ; [L48] static int req_tt_a ; [L49] static int req_tt_d ; [L50] static int rsp_tt_type ; [L51] static int rsp_tt_status ; [L52] static int rsp_tt_d ; [L845] static int req_t_type___0 ; [L846] static int req_t_a___0 ; [L847] static int req_t_d___0 ; [L848] static int rsp_t_type___0 ; [L849] static int rsp_t_status___0 ; [L850] static int rsp_t_d___0 ; [L1352] int __retres1 ; [L1356] c_m_lock = 0 [L1357] c_m_ev = 2 [L1359] m_run_i = 1 [L1360] m_run_pc = 0 [L1361] s_run_i = 1 [L1362] s_run_pc = 0 [L1363] c_empty_req = 1 [L1364] c_empty_rsp = 1 [L1365] c_read_req_ev = 2 [L1366] c_write_req_ev = 2 [L1367] c_read_rsp_ev = 2 [L1368] c_write_rsp_ev = 2 [L1369] c_m_lock = 0 [L1370] c_m_ev = 2 [L1168] int kernel_st ; [L1171] kernel_st = 0 [L1172] COND TRUE (int )m_run_i == 1 [L1173] m_run_st = 0 [L1177] COND TRUE (int )s_run_i == 1 [L1178] s_run_st = 0 [L1182] COND FALSE !((int )m_run_pc == 1) [L1190] COND FALSE !((int )m_run_pc == 2) [L1198] COND FALSE !((int )m_run_pc == 3) [L1206] COND FALSE !((int )m_run_pc == 4) [L1214] COND FALSE !((int )m_run_pc == 5) [L1222] COND FALSE !((int )m_run_pc == 6) [L1236] COND FALSE !((int )s_run_pc == 2) [L1244] COND FALSE !((int )s_run_pc == 1) [L1255] COND TRUE 1 [L1258] kernel_st = 1 [L1114] int tmp ; [L1115] int tmp___0 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] assume 0 == ~m_run_st~0; [?] assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~s_run_st~0;eval_~tmp___0~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp___0~0); [L1119-L1160] assume !false; [L1121-L1129] assume 0 == ~m_run_st~0; [L1130-L1144] assume 0 == ~m_run_st~0; [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] assume !(0 != eval_~tmp~0); [L1145-L1159] assume 0 == ~s_run_st~0; [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1119-L1160] assume !false; [L1121-L1129] assume 0 == ~m_run_st~0; [L1130-L1144] assume 0 == ~m_run_st~0; [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] assume !(0 != eval_~tmp~0); [L1145-L1159] assume 0 == ~s_run_st~0; [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] assume !(0 != eval_~tmp___0~0); [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] COND FALSE !(0 != eval_~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] COND FALSE !(0 != eval_~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] COND FALSE !(0 != eval_~tmp___0~0) [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] ~tmp~0 := #t~nondet1; [L1132] havoc #t~nondet1; [L1134-L1141] COND FALSE !(0 != ~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] ~tmp___0~0 := #t~nondet2; [L1147] havoc #t~nondet2; [L1149-L1156] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] ~tmp~0 := #t~nondet1; [L1132] havoc #t~nondet1; [L1134-L1141] COND FALSE !(0 != ~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] ~tmp___0~0 := #t~nondet2; [L1147] havoc #t~nondet2; [L1149-L1156] COND FALSE !(0 != ~tmp___0~0) [L1119] COND TRUE 1 [L1121] COND TRUE (int )m_run_st == 0 [L1130] COND TRUE (int )m_run_st == 0 [L1132] tmp = __VERIFIER_nondet_int() [L1134] COND FALSE !(\read(tmp)) [L1145] COND TRUE (int )s_run_st == 0 [L1147] tmp___0 = __VERIFIER_nondet_int() [L1149] COND FALSE !(\read(tmp___0)) ----- [2018-11-23 06:21:22,244 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_27f4df66-8e99-416a-acf1-53847e475453/bin-2019/uautomizer/witness.graphml [2018-11-23 06:21:22,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:21:22,244 INFO L168 Benchmark]: Toolchain (without parser) took 4787.03 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 344.5 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -260.0 MB). Peak memory consumption was 84.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:21:22,245 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:21:22,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.01 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 925.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:21:22,246 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -222.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:21:22,246 INFO L168 Benchmark]: Boogie Preprocessor took 31.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:21:22,247 INFO L168 Benchmark]: RCFGBuilder took 814.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 82.7 MB). Peak memory consumption was 82.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:21:22,247 INFO L168 Benchmark]: BuchiAutomizer took 3481.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -150.4 MB). Peak memory consumption was 362.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:21:22,247 INFO L168 Benchmark]: Witness Printer took 89.41 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:21:22,250 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 283.01 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 925.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -222.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 814.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 82.7 MB). Peak memory consumption was 82.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3481.31 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -150.4 MB). Peak memory consumption was 362.9 MB. Max. memory is 11.5 GB. * Witness Printer took 89.41 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1098 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.5s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 208 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1098 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2439 SDtfs, 1857 SDslu, 1002 SDs, 0 SdLazy, 285 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU2 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital31 mio100 ax100 hnf100 lsp29 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf94 smp100 dnf150 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 18ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 1119]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {req_tt_d=0, a_t=0, rsp_t_status=0, tmp=0, kernel_st=1, rsp_tt_status=0, req_t_type___0=0, tmp___0=0, c_m_ev=2, c_empty_rsp=1, s_memory1=0, req_t_d___0=0, c_req_d=0, req_t_a=0, rsp_t_type=0, req_t_a___0=0, d_t=0, rsp_t_d=0, c_write_rsp_ev=2, c_rsp_status=0, rsp_tt_type=0, rsp_tt_d=0, __retres1=0, rsp_t_d___0=0, c_rsp_d=0, c_m_lock=0, \result=0, m_run_st=0, req_tt_a=0, c_write_req_ev=2, s_run_i=1, s_run_st=0, c_empty_req=1, c_read_rsp_ev=2, m_run_i=1, rsp_t_status___0=0, s_memory2=0, req_t_d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e0249ea=0, c_read_req_ev=2, c_req_a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6cacc681=0, c_req_type=0, s_memory0=0, req_t_type=0, req_tt_type=0, rsp_t_type___0=0, m_run_pc=0, s_run_pc=0, c_rsp_type=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1119]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; [?] havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~m_run_i~0;~m_run_st~0 := 0; [?] assume 1 == ~s_run_i~0;~s_run_st~0 := 0; [?] assume !(1 == ~m_run_pc~0); [?] assume !(2 == ~m_run_pc~0); [?] assume !(3 == ~m_run_pc~0); [?] assume !(4 == ~m_run_pc~0); [?] assume !(5 == ~m_run_pc~0); [?] assume !(6 == ~m_run_pc~0); [?] assume !(2 == ~s_run_pc~0); [?] assume !(1 == ~s_run_pc~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172-L1176] assume 1 == ~m_run_i~0; [L1173] ~m_run_st~0 := 0; [L1177-L1181] assume 1 == ~s_run_i~0; [L1178] ~s_run_st~0 := 0; [L1182-L1235] assume !(1 == ~m_run_pc~0); [L1190-L1234] assume !(2 == ~m_run_pc~0); [L1198-L1233] assume !(3 == ~m_run_pc~0); [L1206-L1232] assume !(4 == ~m_run_pc~0); [L1214-L1231] assume !(5 == ~m_run_pc~0); [L1222-L1230] assume !(6 == ~m_run_pc~0); [L1236-L1253] assume !(2 == ~s_run_pc~0); [L1244-L1252] assume !(1 == ~s_run_pc~0); [L1255-L1344] assume !false; [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172-L1176] assume 1 == ~m_run_i~0; [L1173] ~m_run_st~0 := 0; [L1177-L1181] assume 1 == ~s_run_i~0; [L1178] ~s_run_st~0 := 0; [L1182-L1235] assume !(1 == ~m_run_pc~0); [L1190-L1234] assume !(2 == ~m_run_pc~0); [L1198-L1233] assume !(3 == ~m_run_pc~0); [L1206-L1232] assume !(4 == ~m_run_pc~0); [L1214-L1231] assume !(5 == ~m_run_pc~0); [L1222-L1230] assume !(6 == ~m_run_pc~0); [L1236-L1253] assume !(2 == ~s_run_pc~0); [L1244-L1252] assume !(1 == ~s_run_pc~0); [L1255-L1344] assume !false; [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [L1352] havoc ~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1168] havoc ~kernel_st~0; [L1171] ~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] ~kernel_st~0 := 1; [L1114] havoc ~tmp~0; [L1115] havoc ~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [L1352] havoc ~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1168] havoc ~kernel_st~0; [L1171] ~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] ~kernel_st~0 := 1; [L1114] havoc ~tmp~0; [L1115] havoc ~tmp___0~0; [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L19] int s_memory1 ; [L20] int s_memory2 ; [L22] int s_run_st ; [L23] int s_run_i ; [L24] int s_run_pc ; [L25] int c_m_lock ; [L26] int c_m_ev ; [L27] int c_req_type ; [L28] int c_req_a ; [L29] int c_req_d ; [L30] int c_rsp_type ; [L31] int c_rsp_status ; [L32] int c_rsp_d ; [L33] int c_empty_req ; [L34] int c_empty_rsp ; [L35] int c_read_req_ev ; [L36] int c_write_req_ev ; [L37] int c_read_rsp_ev ; [L38] int c_write_rsp_ev ; [L39] static int d_t ; [L40] static int a_t ; [L41] static int req_t_type ; [L42] static int req_t_a ; [L43] static int req_t_d ; [L44] static int rsp_t_type ; [L45] static int rsp_t_status ; [L46] static int rsp_t_d ; [L47] static int req_tt_type ; [L48] static int req_tt_a ; [L49] static int req_tt_d ; [L50] static int rsp_tt_type ; [L51] static int rsp_tt_status ; [L52] static int rsp_tt_d ; [L845] static int req_t_type___0 ; [L846] static int req_t_a___0 ; [L847] static int req_t_d___0 ; [L848] static int rsp_t_type___0 ; [L849] static int rsp_t_status___0 ; [L850] static int rsp_t_d___0 ; [L1352] int __retres1 ; [L1356] c_m_lock = 0 [L1357] c_m_ev = 2 [L1359] m_run_i = 1 [L1360] m_run_pc = 0 [L1361] s_run_i = 1 [L1362] s_run_pc = 0 [L1363] c_empty_req = 1 [L1364] c_empty_rsp = 1 [L1365] c_read_req_ev = 2 [L1366] c_write_req_ev = 2 [L1367] c_read_rsp_ev = 2 [L1368] c_write_rsp_ev = 2 [L1369] c_m_lock = 0 [L1370] c_m_ev = 2 [L1168] int kernel_st ; [L1171] kernel_st = 0 [L1172] COND TRUE (int )m_run_i == 1 [L1173] m_run_st = 0 [L1177] COND TRUE (int )s_run_i == 1 [L1178] s_run_st = 0 [L1182] COND FALSE !((int )m_run_pc == 1) [L1190] COND FALSE !((int )m_run_pc == 2) [L1198] COND FALSE !((int )m_run_pc == 3) [L1206] COND FALSE !((int )m_run_pc == 4) [L1214] COND FALSE !((int )m_run_pc == 5) [L1222] COND FALSE !((int )m_run_pc == 6) [L1236] COND FALSE !((int )s_run_pc == 2) [L1244] COND FALSE !((int )s_run_pc == 1) [L1255] COND TRUE 1 [L1258] kernel_st = 1 [L1114] int tmp ; [L1115] int tmp___0 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] assume 0 == ~m_run_st~0; [?] assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~s_run_st~0;eval_~tmp___0~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp___0~0); [L1119-L1160] assume !false; [L1121-L1129] assume 0 == ~m_run_st~0; [L1130-L1144] assume 0 == ~m_run_st~0; [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] assume !(0 != eval_~tmp~0); [L1145-L1159] assume 0 == ~s_run_st~0; [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1119-L1160] assume !false; [L1121-L1129] assume 0 == ~m_run_st~0; [L1130-L1144] assume 0 == ~m_run_st~0; [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] assume !(0 != eval_~tmp~0); [L1145-L1159] assume 0 == ~s_run_st~0; [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] assume !(0 != eval_~tmp___0~0); [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] COND FALSE !(0 != eval_~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] COND FALSE !(0 != eval_~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] COND FALSE !(0 != eval_~tmp___0~0) [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] ~tmp~0 := #t~nondet1; [L1132] havoc #t~nondet1; [L1134-L1141] COND FALSE !(0 != ~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] ~tmp___0~0 := #t~nondet2; [L1147] havoc #t~nondet2; [L1149-L1156] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] ~tmp~0 := #t~nondet1; [L1132] havoc #t~nondet1; [L1134-L1141] COND FALSE !(0 != ~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] ~tmp___0~0 := #t~nondet2; [L1147] havoc #t~nondet2; [L1149-L1156] COND FALSE !(0 != ~tmp___0~0) [L1119] COND TRUE 1 [L1121] COND TRUE (int )m_run_st == 0 [L1130] COND TRUE (int )m_run_st == 0 [L1132] tmp = __VERIFIER_nondet_int() [L1134] COND FALSE !(\read(tmp)) [L1145] COND TRUE (int )s_run_st == 0 [L1147] tmp___0 = __VERIFIER_nondet_int() [L1149] COND FALSE !(\read(tmp___0)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~m_run_st~0 := 0;~m_run_i~0 := 0;~m_run_pc~0 := 0;~s_memory0~0 := 0;~s_memory1~0 := 0;~s_memory2~0 := 0;~s_run_st~0 := 0;~s_run_i~0 := 0;~s_run_pc~0 := 0;~c_m_lock~0 := 0;~c_m_ev~0 := 0;~c_req_type~0 := 0;~c_req_a~0 := 0;~c_req_d~0 := 0;~c_rsp_type~0 := 0;~c_rsp_status~0 := 0;~c_rsp_d~0 := 0;~c_empty_req~0 := 0;~c_empty_rsp~0 := 0;~c_read_req_ev~0 := 0;~c_write_req_ev~0 := 0;~c_read_rsp_ev~0 := 0;~c_write_rsp_ev~0 := 0;~d_t~0 := 0;~a_t~0 := 0;~req_t_type~0 := 0;~req_t_a~0 := 0;~req_t_d~0 := 0;~rsp_t_type~0 := 0;~rsp_t_status~0 := 0;~rsp_t_d~0 := 0;~req_tt_type~0 := 0;~req_tt_a~0 := 0;~req_tt_d~0 := 0;~rsp_tt_type~0 := 0;~rsp_tt_status~0 := 0;~rsp_tt_d~0 := 0;~req_t_type___0~0 := 0;~req_t_a___0~0 := 0;~req_t_d___0~0 := 0;~rsp_t_type___0~0 := 0;~rsp_t_status___0~0 := 0;~rsp_t_d___0~0 := 0; [?] havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~c_m_lock~0 := 0;~c_m_ev~0 := 2;~m_run_i~0 := 1;~m_run_pc~0 := 0;~s_run_i~0 := 1;~s_run_pc~0 := 0;~c_empty_req~0 := 1;~c_empty_rsp~0 := 1;~c_read_req_ev~0 := 2;~c_write_req_ev~0 := 2;~c_read_rsp_ev~0 := 2;~c_write_rsp_ev~0 := 2;~c_m_lock~0 := 0;~c_m_ev~0 := 2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~m_run_i~0;~m_run_st~0 := 0; [?] assume 1 == ~s_run_i~0;~s_run_st~0 := 0; [?] assume !(1 == ~m_run_pc~0); [?] assume !(2 == ~m_run_pc~0); [?] assume !(3 == ~m_run_pc~0); [?] assume !(4 == ~m_run_pc~0); [?] assume !(5 == ~m_run_pc~0); [?] assume !(6 == ~m_run_pc~0); [?] assume !(2 == ~s_run_pc~0); [?] assume !(1 == ~s_run_pc~0); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172-L1176] assume 1 == ~m_run_i~0; [L1173] ~m_run_st~0 := 0; [L1177-L1181] assume 1 == ~s_run_i~0; [L1178] ~s_run_st~0 := 0; [L1182-L1235] assume !(1 == ~m_run_pc~0); [L1190-L1234] assume !(2 == ~m_run_pc~0); [L1198-L1233] assume !(3 == ~m_run_pc~0); [L1206-L1232] assume !(4 == ~m_run_pc~0); [L1214-L1231] assume !(5 == ~m_run_pc~0); [L1222-L1230] assume !(6 == ~m_run_pc~0); [L1236-L1253] assume !(2 == ~s_run_pc~0); [L1244-L1252] assume !(1 == ~s_run_pc~0); [L1255-L1344] assume !false; [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172-L1176] assume 1 == ~m_run_i~0; [L1173] ~m_run_st~0 := 0; [L1177-L1181] assume 1 == ~s_run_i~0; [L1178] ~s_run_st~0 := 0; [L1182-L1235] assume !(1 == ~m_run_pc~0); [L1190-L1234] assume !(2 == ~m_run_pc~0); [L1198-L1233] assume !(3 == ~m_run_pc~0); [L1206-L1232] assume !(4 == ~m_run_pc~0); [L1214-L1231] assume !(5 == ~m_run_pc~0); [L1222-L1230] assume !(6 == ~m_run_pc~0); [L1236-L1253] assume !(2 == ~s_run_pc~0); [L1244-L1252] assume !(1 == ~s_run_pc~0); [L1255-L1344] assume !false; [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [?] havoc main_#res; [?] havoc main_~__retres1~0; [L1352] havoc main_~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1371] havoc start_simulation_~kernel_st~0; [L1168] havoc start_simulation_~kernel_st~0; [L1171] start_simulation_~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] start_simulation_~kernel_st~0 := 1; [L1259] havoc eval_#t~nondet1, eval_#t~nondet2, eval_~tmp~0, eval_~tmp___0~0; [L1114] havoc eval_~tmp~0; [L1115] havoc eval_~tmp___0~0; [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [L1352] havoc ~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1168] havoc ~kernel_st~0; [L1171] ~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] ~kernel_st~0 := 1; [L1114] havoc ~tmp~0; [L1115] havoc ~tmp___0~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~m_run_st~0 := 0; [L16] ~m_run_i~0 := 0; [L17] ~m_run_pc~0 := 0; [L18] ~s_memory0~0 := 0; [L19] ~s_memory1~0 := 0; [L20] ~s_memory2~0 := 0; [L22] ~s_run_st~0 := 0; [L23] ~s_run_i~0 := 0; [L24] ~s_run_pc~0 := 0; [L25] ~c_m_lock~0 := 0; [L26] ~c_m_ev~0 := 0; [L27] ~c_req_type~0 := 0; [L28] ~c_req_a~0 := 0; [L29] ~c_req_d~0 := 0; [L30] ~c_rsp_type~0 := 0; [L31] ~c_rsp_status~0 := 0; [L32] ~c_rsp_d~0 := 0; [L33] ~c_empty_req~0 := 0; [L34] ~c_empty_rsp~0 := 0; [L35] ~c_read_req_ev~0 := 0; [L36] ~c_write_req_ev~0 := 0; [L37] ~c_read_rsp_ev~0 := 0; [L38] ~c_write_rsp_ev~0 := 0; [L39] ~d_t~0 := 0; [L40] ~a_t~0 := 0; [L41] ~req_t_type~0 := 0; [L42] ~req_t_a~0 := 0; [L43] ~req_t_d~0 := 0; [L44] ~rsp_t_type~0 := 0; [L45] ~rsp_t_status~0 := 0; [L46] ~rsp_t_d~0 := 0; [L47] ~req_tt_type~0 := 0; [L48] ~req_tt_a~0 := 0; [L49] ~req_tt_d~0 := 0; [L50] ~rsp_tt_type~0 := 0; [L51] ~rsp_tt_status~0 := 0; [L52] ~rsp_tt_d~0 := 0; [L845] ~req_t_type___0~0 := 0; [L846] ~req_t_a___0~0 := 0; [L847] ~req_t_d___0~0 := 0; [L848] ~rsp_t_type___0~0 := 0; [L849] ~rsp_t_status___0~0 := 0; [L850] ~rsp_t_d___0~0 := 0; [L1352] havoc ~__retres1~0; [L1356] ~c_m_lock~0 := 0; [L1357] ~c_m_ev~0 := 2; [L1359] ~m_run_i~0 := 1; [L1360] ~m_run_pc~0 := 0; [L1361] ~s_run_i~0 := 1; [L1362] ~s_run_pc~0 := 0; [L1363] ~c_empty_req~0 := 1; [L1364] ~c_empty_rsp~0 := 1; [L1365] ~c_read_req_ev~0 := 2; [L1366] ~c_write_req_ev~0 := 2; [L1367] ~c_read_rsp_ev~0 := 2; [L1368] ~c_write_rsp_ev~0 := 2; [L1369] ~c_m_lock~0 := 0; [L1370] ~c_m_ev~0 := 2; [L1168] havoc ~kernel_st~0; [L1171] ~kernel_st~0 := 0; [L1172] COND TRUE 1 == ~m_run_i~0 [L1173] ~m_run_st~0 := 0; [L1177] COND TRUE 1 == ~s_run_i~0 [L1178] ~s_run_st~0 := 0; [L1182] COND FALSE !(1 == ~m_run_pc~0) [L1190] COND FALSE !(2 == ~m_run_pc~0) [L1198] COND FALSE !(3 == ~m_run_pc~0) [L1206] COND FALSE !(4 == ~m_run_pc~0) [L1214] COND FALSE !(5 == ~m_run_pc~0) [L1222] COND FALSE !(6 == ~m_run_pc~0) [L1236] COND FALSE !(2 == ~s_run_pc~0) [L1244] COND FALSE !(1 == ~s_run_pc~0) [L1255-L1344] COND FALSE !(false) [L1258] ~kernel_st~0 := 1; [L1114] havoc ~tmp~0; [L1115] havoc ~tmp___0~0; [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L19] int s_memory1 ; [L20] int s_memory2 ; [L22] int s_run_st ; [L23] int s_run_i ; [L24] int s_run_pc ; [L25] int c_m_lock ; [L26] int c_m_ev ; [L27] int c_req_type ; [L28] int c_req_a ; [L29] int c_req_d ; [L30] int c_rsp_type ; [L31] int c_rsp_status ; [L32] int c_rsp_d ; [L33] int c_empty_req ; [L34] int c_empty_rsp ; [L35] int c_read_req_ev ; [L36] int c_write_req_ev ; [L37] int c_read_rsp_ev ; [L38] int c_write_rsp_ev ; [L39] static int d_t ; [L40] static int a_t ; [L41] static int req_t_type ; [L42] static int req_t_a ; [L43] static int req_t_d ; [L44] static int rsp_t_type ; [L45] static int rsp_t_status ; [L46] static int rsp_t_d ; [L47] static int req_tt_type ; [L48] static int req_tt_a ; [L49] static int req_tt_d ; [L50] static int rsp_tt_type ; [L51] static int rsp_tt_status ; [L52] static int rsp_tt_d ; [L845] static int req_t_type___0 ; [L846] static int req_t_a___0 ; [L847] static int req_t_d___0 ; [L848] static int rsp_t_type___0 ; [L849] static int rsp_t_status___0 ; [L850] static int rsp_t_d___0 ; [L1352] int __retres1 ; [L1356] c_m_lock = 0 [L1357] c_m_ev = 2 [L1359] m_run_i = 1 [L1360] m_run_pc = 0 [L1361] s_run_i = 1 [L1362] s_run_pc = 0 [L1363] c_empty_req = 1 [L1364] c_empty_rsp = 1 [L1365] c_read_req_ev = 2 [L1366] c_write_req_ev = 2 [L1367] c_read_rsp_ev = 2 [L1368] c_write_rsp_ev = 2 [L1369] c_m_lock = 0 [L1370] c_m_ev = 2 [L1168] int kernel_st ; [L1171] kernel_st = 0 [L1172] COND TRUE (int )m_run_i == 1 [L1173] m_run_st = 0 [L1177] COND TRUE (int )s_run_i == 1 [L1178] s_run_st = 0 [L1182] COND FALSE !((int )m_run_pc == 1) [L1190] COND FALSE !((int )m_run_pc == 2) [L1198] COND FALSE !((int )m_run_pc == 3) [L1206] COND FALSE !((int )m_run_pc == 4) [L1214] COND FALSE !((int )m_run_pc == 5) [L1222] COND FALSE !((int )m_run_pc == 6) [L1236] COND FALSE !((int )s_run_pc == 2) [L1244] COND FALSE !((int )s_run_pc == 1) [L1255] COND TRUE 1 [L1258] kernel_st = 1 [L1114] int tmp ; [L1115] int tmp___0 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] assume 0 == ~m_run_st~0; [?] assume 0 == ~m_run_st~0;eval_~tmp~0 := eval_#t~nondet1;havoc eval_#t~nondet1; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~s_run_st~0;eval_~tmp___0~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp___0~0); [L1119-L1160] assume !false; [L1121-L1129] assume 0 == ~m_run_st~0; [L1130-L1144] assume 0 == ~m_run_st~0; [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] assume !(0 != eval_~tmp~0); [L1145-L1159] assume 0 == ~s_run_st~0; [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] assume !(0 != eval_~tmp___0~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L1119-L1160] assume !false; [L1121-L1129] assume 0 == ~m_run_st~0; [L1130-L1144] assume 0 == ~m_run_st~0; [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] assume !(0 != eval_~tmp~0); [L1145-L1159] assume 0 == ~s_run_st~0; [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] assume !(0 != eval_~tmp___0~0); [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] COND FALSE !(0 != eval_~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] COND FALSE !(0 != eval_~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] eval_~tmp~0 := eval_#t~nondet1; [L1132] havoc eval_#t~nondet1; [L1134-L1141] COND FALSE !(0 != eval_~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] eval_~tmp___0~0 := eval_#t~nondet2; [L1147] havoc eval_#t~nondet2; [L1149-L1156] COND FALSE !(0 != eval_~tmp___0~0) [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] ~tmp~0 := #t~nondet1; [L1132] havoc #t~nondet1; [L1134-L1141] COND FALSE !(0 != ~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] ~tmp___0~0 := #t~nondet2; [L1147] havoc #t~nondet2; [L1149-L1156] COND FALSE !(0 != ~tmp___0~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L1119-L1160] COND FALSE !(false) [L1121] COND TRUE 0 == ~m_run_st~0 [L1130] COND TRUE 0 == ~m_run_st~0 [L1132] ~tmp~0 := #t~nondet1; [L1132] havoc #t~nondet1; [L1134-L1141] COND FALSE !(0 != ~tmp~0) [L1145] COND TRUE 0 == ~s_run_st~0 [L1147] ~tmp___0~0 := #t~nondet2; [L1147] havoc #t~nondet2; [L1149-L1156] COND FALSE !(0 != ~tmp___0~0) [L1119] COND TRUE 1 [L1121] COND TRUE (int )m_run_st == 0 [L1130] COND TRUE (int )m_run_st == 0 [L1132] tmp = __VERIFIER_nondet_int() [L1134] COND FALSE !(\read(tmp)) [L1145] COND TRUE (int )s_run_st == 0 [L1147] tmp___0 = __VERIFIER_nondet_int() [L1149] COND FALSE !(\read(tmp___0)) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L19] int s_memory1 ; [L20] int s_memory2 ; [L22] int s_run_st ; [L23] int s_run_i ; [L24] int s_run_pc ; [L25] int c_m_lock ; [L26] int c_m_ev ; [L27] int c_req_type ; [L28] int c_req_a ; [L29] int c_req_d ; [L30] int c_rsp_type ; [L31] int c_rsp_status ; [L32] int c_rsp_d ; [L33] int c_empty_req ; [L34] int c_empty_rsp ; [L35] int c_read_req_ev ; [L36] int c_write_req_ev ; [L37] int c_read_rsp_ev ; [L38] int c_write_rsp_ev ; [L39] static int d_t ; [L40] static int a_t ; [L41] static int req_t_type ; [L42] static int req_t_a ; [L43] static int req_t_d ; [L44] static int rsp_t_type ; [L45] static int rsp_t_status ; [L46] static int rsp_t_d ; [L47] static int req_tt_type ; [L48] static int req_tt_a ; [L49] static int req_tt_d ; [L50] static int rsp_tt_type ; [L51] static int rsp_tt_status ; [L52] static int rsp_tt_d ; [L845] static int req_t_type___0 ; [L846] static int req_t_a___0 ; [L847] static int req_t_d___0 ; [L848] static int rsp_t_type___0 ; [L849] static int rsp_t_status___0 ; [L850] static int rsp_t_d___0 ; [L1352] int __retres1 ; [L1356] c_m_lock = 0 [L1357] c_m_ev = 2 [L1359] m_run_i = 1 [L1360] m_run_pc = 0 [L1361] s_run_i = 1 [L1362] s_run_pc = 0 [L1363] c_empty_req = 1 [L1364] c_empty_rsp = 1 [L1365] c_read_req_ev = 2 [L1366] c_write_req_ev = 2 [L1367] c_read_rsp_ev = 2 [L1368] c_write_rsp_ev = 2 [L1369] c_m_lock = 0 [L1370] c_m_ev = 2 [L1168] int kernel_st ; [L1171] kernel_st = 0 [L1172] COND TRUE (int )m_run_i == 1 [L1173] m_run_st = 0 [L1177] COND TRUE (int )s_run_i == 1 [L1178] s_run_st = 0 [L1182] COND FALSE !((int )m_run_pc == 1) [L1190] COND FALSE !((int )m_run_pc == 2) [L1198] COND FALSE !((int )m_run_pc == 3) [L1206] COND FALSE !((int )m_run_pc == 4) [L1214] COND FALSE !((int )m_run_pc == 5) [L1222] COND FALSE !((int )m_run_pc == 6) [L1236] COND FALSE !((int )s_run_pc == 2) [L1244] COND FALSE !((int )s_run_pc == 1) [L1255] COND TRUE 1 [L1258] kernel_st = 1 [L1114] int tmp ; [L1115] int tmp___0 ; Loop: [L1119] COND TRUE 1 [L1121] COND TRUE (int )m_run_st == 0 [L1130] COND TRUE (int )m_run_st == 0 [L1132] tmp = __VERIFIER_nondet_int() [L1134] COND FALSE !(\read(tmp)) [L1145] COND TRUE (int )s_run_st == 0 [L1147] tmp___0 = __VERIFIER_nondet_int() [L1149] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...