./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/kundu2_false-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_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/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 2559ce56d5bdfaeec5255956226223494fe099f5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:40:55,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:40:55,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:40:55,106 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:40:55,107 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:40:55,107 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:40:55,108 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:40:55,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:40:55,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:40:55,111 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:40:55,112 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:40:55,112 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:40:55,112 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:40:55,113 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:40:55,114 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:40:55,114 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:40:55,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:40:55,116 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:40:55,117 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:40:55,119 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:40:55,119 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:40:55,120 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:40:55,122 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:40:55,122 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:40:55,122 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:40:55,123 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:40:55,123 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:40:55,124 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:40:55,124 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:40:55,125 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:40:55,125 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:40:55,126 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:40:55,126 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:40:55,126 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:40:55,127 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:40:55,127 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:40:55,128 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 07:40:55,138 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:40:55,139 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:40:55,140 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:40:55,140 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:40:55,140 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:40:55,140 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 07:40:55,140 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 07:40:55,140 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 07:40:55,141 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 07:40:55,141 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 07:40:55,141 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 07:40:55,141 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:40:55,141 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:40:55,141 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:40:55,141 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:40:55,141 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:40:55,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:40:55,142 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 07:40:55,142 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 07:40:55,142 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 07:40:55,142 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:40:55,142 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:40:55,142 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 07:40:55,143 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:40:55,143 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 07:40:55,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:40:55,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:40:55,143 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 07:40:55,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:40:55,143 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:40:55,143 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 07:40:55,144 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 07:40:55,144 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_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/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 -> 2559ce56d5bdfaeec5255956226223494fe099f5 [2018-11-23 07:40:55,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:40:55,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:40:55,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:40:55,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:40:55,179 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:40:55,180 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-11-23 07:40:55,223 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/data/80823eaac/8fb4bd99f0e949fe929a41abdf868515/FLAG864c4095a [2018-11-23 07:40:55,641 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:40:55,642 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-11-23 07:40:55,648 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/data/80823eaac/8fb4bd99f0e949fe929a41abdf868515/FLAG864c4095a [2018-11-23 07:40:55,657 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/data/80823eaac/8fb4bd99f0e949fe929a41abdf868515 [2018-11-23 07:40:55,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:40:55,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:40:55,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:40:55,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:40:55,663 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:40:55,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:40:55" (1/1) ... [2018-11-23 07:40:55,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@651809fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:40:55, skipping insertion in model container [2018-11-23 07:40:55,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:40:55" (1/1) ... [2018-11-23 07:40:55,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:40:55,694 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:40:55,836 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:40:55,839 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:40:55,870 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:40:55,880 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:40:55,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:40:55 WrapperNode [2018-11-23 07:40:55,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:40:55,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:40:55,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:40:55,881 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:40:55,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:40:55" (1/1) ... [2018-11-23 07:40:55,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:40:55" (1/1) ... [2018-11-23 07:40:55,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:40:55,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:40:55,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:40:55,954 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:40:55,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:40:55" (1/1) ... [2018-11-23 07:40:55,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:40:55" (1/1) ... [2018-11-23 07:40:55,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:40:55" (1/1) ... [2018-11-23 07:40:55,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:40:55" (1/1) ... [2018-11-23 07:40:55,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:40:55" (1/1) ... [2018-11-23 07:40:55,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:40:55" (1/1) ... [2018-11-23 07:40:55,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:40:55" (1/1) ... [2018-11-23 07:40:55,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:40:55,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:40:55,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:40:55,983 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:40:55,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:40:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/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 07:40:56,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:40:56,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:40:56,476 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:40:56,477 INFO L280 CfgBuilder]: Removed 95 assue(true) statements. [2018-11-23 07:40:56,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:40:56 BoogieIcfgContainer [2018-11-23 07:40:56,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:40:56,478 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 07:40:56,478 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 07:40:56,480 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 07:40:56,480 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:40:56,480 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 07:40:55" (1/3) ... [2018-11-23 07:40:56,481 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@600f773e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:40:56, skipping insertion in model container [2018-11-23 07:40:56,481 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:40:56,481 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:40:55" (2/3) ... [2018-11-23 07:40:56,482 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@600f773e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 07:40:56, skipping insertion in model container [2018-11-23 07:40:56,482 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 07:40:56,482 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:40:56" (3/3) ... [2018-11-23 07:40:56,483 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu2_false-unreach-call_false-termination.cil.c [2018-11-23 07:40:56,520 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:40:56,521 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 07:40:56,521 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 07:40:56,521 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 07:40:56,521 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:40:56,521 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:40:56,522 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 07:40:56,522 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:40:56,522 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 07:40:56,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states. [2018-11-23 07:40:56,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2018-11-23 07:40:56,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:40:56,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:40:56,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:56,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:56,562 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 07:40:56,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states. [2018-11-23 07:40:56,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2018-11-23 07:40:56,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:40:56,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:40:56,569 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:56,569 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:56,574 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRYtrue ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 15#L-1true havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 115#L589true havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 79#L287true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 140#L294-1true assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 16#L299-1true assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 51#L304-1true havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 146#L107true assume !(1 == ~P_1_pc~0); 122#L107-2true is_P_1_triggered_~__retres1~0 := 0; 149#L118true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 89#L119true activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 167#L467true assume !(0 != activate_threads_~tmp~1); 172#L467-2true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3#L175true assume 1 == ~P_2_pc~0; 113#L176true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 4#L186true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 114#L187true activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 27#L475true assume !(0 != activate_threads_~tmp___0~1); 5#L475-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 72#L257true assume 1 == ~C_1_pc~0; 173#L258true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 131#L278true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 74#L279true activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 33#L483true assume !(0 != activate_threads_~tmp___1~1); 97#L537-1true [2018-11-23 07:40:56,575 INFO L796 eck$LassoCheckResult]: Loop: 97#L537-1true assume !false; 49#L538true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 76#L386true assume !true; 103#L402true start_simulation_~kernel_st~0 := 2; 62#L287-1true start_simulation_~kernel_st~0 := 3; 102#L413true havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 112#L107-6true assume 1 == ~P_1_pc~0; 81#L108-2true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 124#L118-2true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 83#L119-2true activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 156#L467-6true assume !(0 != activate_threads_~tmp~1); 162#L467-8true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 163#L175-6true assume !(1 == ~P_2_pc~0); 160#L175-8true is_P_2_triggered_~__retres1~1 := 0; 28#L186-2true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 138#L187-2true activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11#L475-6true assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 168#L475-8true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 34#L257-6true assume 1 == ~C_1_pc~0; 169#L258-2true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 101#L278-2true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 69#L279-2true activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 21#L483-6true assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 29#L483-8true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 90#L317-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 57#L334-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 155#L335-1true start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 117#L556true assume !(0 == start_simulation_~tmp~3); 120#L556-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 93#L317-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 60#L334-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 158#L335-2true stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 14#L511true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 92#L518true stop_simulation_#res := stop_simulation_~__retres2~0; 24#L519true start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 153#L569true assume !(0 != start_simulation_~tmp___0~2); 97#L537-1true [2018-11-23 07:40:56,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:56,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1148319283, now seen corresponding path program 1 times [2018-11-23 07:40:56,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:56,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:56,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:56,673 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 07:40:56,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:40:56,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:40:56,679 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:40:56,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:56,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2040352856, now seen corresponding path program 1 times [2018-11-23 07:40:56,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:56,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:56,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:56,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:56,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:56,689 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 07:40:56,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:40:56,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:40:56,691 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:40:56,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:40:56,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:40:56,702 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 3 states. [2018-11-23 07:40:56,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:40:56,728 INFO L93 Difference]: Finished difference Result 175 states and 257 transitions. [2018-11-23 07:40:56,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:40:56,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 257 transitions. [2018-11-23 07:40:56,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2018-11-23 07:40:56,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 167 states and 249 transitions. [2018-11-23 07:40:56,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2018-11-23 07:40:56,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2018-11-23 07:40:56,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 249 transitions. [2018-11-23 07:40:56,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:40:56,741 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2018-11-23 07:40:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 249 transitions. [2018-11-23 07:40:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-11-23 07:40:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-23 07:40:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 249 transitions. [2018-11-23 07:40:56,767 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2018-11-23 07:40:56,768 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2018-11-23 07:40:56,768 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 07:40:56,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 249 transitions. [2018-11-23 07:40:56,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2018-11-23 07:40:56,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:40:56,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:40:56,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:56,771 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:56,771 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 387#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 388#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 481#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 482#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 393#L299-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 394#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 448#L107 assume !(1 == ~P_1_pc~0); 497#L107-2 is_P_1_triggered_~__retres1~0 := 0; 496#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 498#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 499#L467 assume !(0 != activate_threads_~tmp~1); 525#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 360#L175 assume 1 == ~P_2_pc~0; 361#L176 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 363#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 364#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 412#L475 assume !(0 != activate_threads_~tmp___0~1); 365#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 366#L257 assume 1 == ~C_1_pc~0; 471#L258 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 472#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 473#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 417#L483 assume !(0 != activate_threads_~tmp___1~1); 418#L537-1 [2018-11-23 07:40:56,771 INFO L796 eck$LassoCheckResult]: Loop: 418#L537-1 assume !false; 446#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 447#L386 assume !false; 475#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 494#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 372#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 450#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 435#L351 assume !(0 != eval_~tmp___2~0); 436#L402 start_simulation_~kernel_st~0 := 2; 457#L287-1 start_simulation_~kernel_st~0 := 3; 458#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 502#L107-6 assume 1 == ~P_1_pc~0; 484#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 485#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 487#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 488#L467-6 assume !(0 != activate_threads_~tmp~1); 523#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 524#L175-6 assume 1 == ~P_2_pc~0; 515#L176-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 409#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 410#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 378#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 379#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 419#L257-6 assume 1 == ~C_1_pc~0; 421#L258-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 467#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 468#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 399#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 400#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 411#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 376#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 453#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 504#L556 assume !(0 == start_simulation_~tmp~3); 474#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 500#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 381#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 454#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 383#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 384#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 403#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 404#L569 assume !(0 != start_simulation_~tmp___0~2); 418#L537-1 [2018-11-23 07:40:56,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:56,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1571021109, now seen corresponding path program 1 times [2018-11-23 07:40:56,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:56,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:56,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:56,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:56,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:40:56,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:40:56,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:40:56,803 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:40:56,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2072132131, now seen corresponding path program 1 times [2018-11-23 07:40:56,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:56,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:56,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:56,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:56,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:56,845 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 07:40:56,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:40:56,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:40:56,845 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:40:56,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:40:56,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:40:56,846 INFO L87 Difference]: Start difference. First operand 167 states and 249 transitions. cyclomatic complexity: 83 Second operand 3 states. [2018-11-23 07:40:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:40:56,857 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2018-11-23 07:40:56,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:40:56,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 248 transitions. [2018-11-23 07:40:56,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2018-11-23 07:40:56,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 167 states and 248 transitions. [2018-11-23 07:40:56,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2018-11-23 07:40:56,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2018-11-23 07:40:56,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 248 transitions. [2018-11-23 07:40:56,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:40:56,863 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2018-11-23 07:40:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 248 transitions. [2018-11-23 07:40:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-11-23 07:40:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-23 07:40:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 248 transitions. [2018-11-23 07:40:56,869 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2018-11-23 07:40:56,869 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2018-11-23 07:40:56,869 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 07:40:56,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 248 transitions. [2018-11-23 07:40:56,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2018-11-23 07:40:56,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:40:56,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:40:56,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:56,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:56,872 INFO L794 eck$LassoCheckResult]: Stem: 853#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 730#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 731#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 822#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 823#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 732#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 733#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 791#L107 assume !(1 == ~P_1_pc~0); 840#L107-2 is_P_1_triggered_~__retres1~0 := 0; 839#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 841#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 842#L467 assume !(0 != activate_threads_~tmp~1); 868#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 703#L175 assume 1 == ~P_2_pc~0; 704#L176 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 706#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 707#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 752#L475 assume !(0 != activate_threads_~tmp___0~1); 708#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 709#L257 assume 1 == ~C_1_pc~0; 814#L258 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 815#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 816#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 760#L483 assume !(0 != activate_threads_~tmp___1~1); 761#L537-1 [2018-11-23 07:40:56,872 INFO L796 eck$LassoCheckResult]: Loop: 761#L537-1 assume !false; 787#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 788#L386 assume !false; 818#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 835#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 715#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 793#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 777#L351 assume !(0 != eval_~tmp___2~0); 778#L402 start_simulation_~kernel_st~0 := 2; 800#L287-1 start_simulation_~kernel_st~0 := 3; 801#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 845#L107-6 assume 1 == ~P_1_pc~0; 826#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 827#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 830#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 831#L467-6 assume !(0 != activate_threads_~tmp~1); 866#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 867#L175-6 assume 1 == ~P_2_pc~0; 858#L176-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 753#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 754#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 721#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 722#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 762#L257-6 assume 1 == ~C_1_pc~0; 764#L258-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 810#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 811#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 742#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 743#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 755#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 719#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 796#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 847#L556 assume !(0 == start_simulation_~tmp~3); 817#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 843#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 726#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 799#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 728#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 729#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 748#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 749#L569 assume !(0 != start_simulation_~tmp___0~2); 761#L537-1 [2018-11-23 07:40:56,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:56,873 INFO L82 PathProgramCache]: Analyzing trace with hash 117922633, now seen corresponding path program 1 times [2018-11-23 07:40:56,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:56,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:56,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:56,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:56,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:56,915 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 07:40:56,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:40:56,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:40:56,916 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:40:56,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:56,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2072132131, now seen corresponding path program 2 times [2018-11-23 07:40:56,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:56,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:56,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:56,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:56,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:56,947 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 07:40:56,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:40:56,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:40:56,948 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:40:56,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:40:56,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:40:56,948 INFO L87 Difference]: Start difference. First operand 167 states and 248 transitions. cyclomatic complexity: 82 Second operand 3 states. [2018-11-23 07:40:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:40:56,998 INFO L93 Difference]: Finished difference Result 301 states and 442 transitions. [2018-11-23 07:40:56,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:40:56,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 301 states and 442 transitions. [2018-11-23 07:40:56,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 273 [2018-11-23 07:40:57,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 301 states to 301 states and 442 transitions. [2018-11-23 07:40:57,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 301 [2018-11-23 07:40:57,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 301 [2018-11-23 07:40:57,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 301 states and 442 transitions. [2018-11-23 07:40:57,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:40:57,002 INFO L705 BuchiCegarLoop]: Abstraction has 301 states and 442 transitions. [2018-11-23 07:40:57,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states and 442 transitions. [2018-11-23 07:40:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 286. [2018-11-23 07:40:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-11-23 07:40:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 421 transitions. [2018-11-23 07:40:57,009 INFO L728 BuchiCegarLoop]: Abstraction has 286 states and 421 transitions. [2018-11-23 07:40:57,009 INFO L608 BuchiCegarLoop]: Abstraction has 286 states and 421 transitions. [2018-11-23 07:40:57,009 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 07:40:57,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 286 states and 421 transitions. [2018-11-23 07:40:57,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 258 [2018-11-23 07:40:57,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:40:57,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:40:57,011 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:57,011 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:57,011 INFO L794 eck$LassoCheckResult]: Stem: 1330#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1206#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 1207#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 1298#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1299#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 1212#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1213#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1266#L107 assume !(1 == ~P_1_pc~0); 1316#L107-2 is_P_1_triggered_~__retres1~0 := 0; 1315#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1317#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1318#L467 assume !(0 != activate_threads_~tmp~1); 1353#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1180#L175 assume !(1 == ~P_2_pc~0); 1181#L175-2 is_P_2_triggered_~__retres1~1 := 0; 1182#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1183#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1230#L475 assume !(0 != activate_threads_~tmp___0~1); 1184#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1185#L257 assume 1 == ~C_1_pc~0; 1290#L258 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1291#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1292#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1235#L483 assume !(0 != activate_threads_~tmp___1~1); 1236#L537-1 [2018-11-23 07:40:57,011 INFO L796 eck$LassoCheckResult]: Loop: 1236#L537-1 assume !false; 1264#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 1265#L386 assume !false; 1294#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1313#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1191#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1271#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 1253#L351 assume !(0 != eval_~tmp___2~0); 1254#L402 start_simulation_~kernel_st~0 := 2; 1276#L287-1 start_simulation_~kernel_st~0 := 3; 1277#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1321#L107-6 assume 1 == ~P_1_pc~0; 1302#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 1303#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1306#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1307#L467-6 assume !(0 != activate_threads_~tmp~1); 1348#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1352#L175-6 assume !(1 == ~P_2_pc~0); 1351#L175-8 is_P_2_triggered_~__retres1~1 := 0; 1228#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1229#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1197#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 1198#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1237#L257-6 assume 1 == ~C_1_pc~0; 1239#L258-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1286#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1287#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1218#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 1219#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1227#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1195#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1272#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1324#L556 assume !(0 == start_simulation_~tmp~3); 1293#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1319#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1202#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1273#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1204#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1205#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 1220#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 1221#L569 assume !(0 != start_simulation_~tmp___0~2); 1236#L537-1 [2018-11-23 07:40:57,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:57,012 INFO L82 PathProgramCache]: Analyzing trace with hash -754916022, now seen corresponding path program 1 times [2018-11-23 07:40:57,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:57,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:57,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:40:57,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:57,034 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 07:40:57,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:40:57,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:40:57,035 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:40:57,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:57,035 INFO L82 PathProgramCache]: Analyzing trace with hash 481737154, now seen corresponding path program 1 times [2018-11-23 07:40:57,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:57,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:57,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:57,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:57,074 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 07:40:57,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:40:57,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:40:57,075 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:40:57,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:40:57,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:40:57,075 INFO L87 Difference]: Start difference. First operand 286 states and 421 transitions. cyclomatic complexity: 136 Second operand 3 states. [2018-11-23 07:40:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:40:57,140 INFO L93 Difference]: Finished difference Result 532 states and 764 transitions. [2018-11-23 07:40:57,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:40:57,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 764 transitions. [2018-11-23 07:40:57,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 506 [2018-11-23 07:40:57,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 532 states and 764 transitions. [2018-11-23 07:40:57,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2018-11-23 07:40:57,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2018-11-23 07:40:57,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 532 states and 764 transitions. [2018-11-23 07:40:57,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:40:57,149 INFO L705 BuchiCegarLoop]: Abstraction has 532 states and 764 transitions. [2018-11-23 07:40:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states and 764 transitions. [2018-11-23 07:40:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 516. [2018-11-23 07:40:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-11-23 07:40:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 744 transitions. [2018-11-23 07:40:57,162 INFO L728 BuchiCegarLoop]: Abstraction has 516 states and 744 transitions. [2018-11-23 07:40:57,163 INFO L608 BuchiCegarLoop]: Abstraction has 516 states and 744 transitions. [2018-11-23 07:40:57,163 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 07:40:57,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 744 transitions. [2018-11-23 07:40:57,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 490 [2018-11-23 07:40:57,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:40:57,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:40:57,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:57,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:57,166 INFO L794 eck$LassoCheckResult]: Stem: 2160#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 2033#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 2034#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 2125#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2126#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 2035#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2036#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2093#L107 assume !(1 == ~P_1_pc~0); 2143#L107-2 is_P_1_triggered_~__retres1~0 := 0; 2142#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2144#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2145#L467 assume !(0 != activate_threads_~tmp~1); 2182#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2007#L175 assume !(1 == ~P_2_pc~0); 2008#L175-2 is_P_2_triggered_~__retres1~1 := 0; 2009#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2010#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2055#L475 assume !(0 != activate_threads_~tmp___0~1); 2011#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2012#L257 assume !(1 == ~C_1_pc~0); 2111#L257-2 assume !(2 == ~C_1_pc~0); 2112#L267-1 is_C_1_triggered_~__retres1~2 := 0; 2158#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2119#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2063#L483 assume !(0 != activate_threads_~tmp___1~1); 2064#L537-1 [2018-11-23 07:40:57,166 INFO L796 eck$LassoCheckResult]: Loop: 2064#L537-1 assume !false; 2380#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 2376#L386 assume !false; 2375#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2373#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2371#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2369#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 2366#L351 assume !(0 != eval_~tmp___2~0); 2367#L402 start_simulation_~kernel_st~0 := 2; 2463#L287-1 start_simulation_~kernel_st~0 := 3; 2462#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2461#L107-6 assume 1 == ~P_1_pc~0; 2459#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 2457#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2454#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2452#L467-6 assume !(0 != activate_threads_~tmp~1); 2450#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2448#L175-6 assume !(1 == ~P_2_pc~0); 2446#L175-8 is_P_2_triggered_~__retres1~1 := 0; 2444#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2443#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2442#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 2440#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2065#L257-6 assume !(1 == ~C_1_pc~0); 2066#L257-8 assume !(2 == ~C_1_pc~0); 2504#L267-5 is_C_1_triggered_~__retres1~2 := 0; 2503#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2502#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2501#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 2499#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2493#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2491#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2490#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2489#L556 assume !(0 == start_simulation_~tmp~3); 2487#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2484#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2483#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2481#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 2479#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2477#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 2474#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 2472#L569 assume !(0 != start_simulation_~tmp___0~2); 2064#L537-1 [2018-11-23 07:40:57,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:57,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 1 times [2018-11-23 07:40:57,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:57,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:40:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:40:57,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:57,197 INFO L82 PathProgramCache]: Analyzing trace with hash 290270835, now seen corresponding path program 1 times [2018-11-23 07:40:57,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:57,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:57,247 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 07:40:57,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:40:57,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:40:57,248 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:40:57,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:40:57,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:40:57,248 INFO L87 Difference]: Start difference. First operand 516 states and 744 transitions. cyclomatic complexity: 229 Second operand 5 states. [2018-11-23 07:40:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:40:57,314 INFO L93 Difference]: Finished difference Result 908 states and 1298 transitions. [2018-11-23 07:40:57,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:40:57,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 908 states and 1298 transitions. [2018-11-23 07:40:57,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 882 [2018-11-23 07:40:57,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 908 states to 908 states and 1298 transitions. [2018-11-23 07:40:57,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 908 [2018-11-23 07:40:57,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 908 [2018-11-23 07:40:57,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 908 states and 1298 transitions. [2018-11-23 07:40:57,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:40:57,323 INFO L705 BuchiCegarLoop]: Abstraction has 908 states and 1298 transitions. [2018-11-23 07:40:57,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states and 1298 transitions. [2018-11-23 07:40:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 528. [2018-11-23 07:40:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-11-23 07:40:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 756 transitions. [2018-11-23 07:40:57,333 INFO L728 BuchiCegarLoop]: Abstraction has 528 states and 756 transitions. [2018-11-23 07:40:57,333 INFO L608 BuchiCegarLoop]: Abstraction has 528 states and 756 transitions. [2018-11-23 07:40:57,333 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 07:40:57,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 528 states and 756 transitions. [2018-11-23 07:40:57,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 502 [2018-11-23 07:40:57,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:40:57,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:40:57,336 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:57,336 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:57,337 INFO L794 eck$LassoCheckResult]: Stem: 3609#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 3473#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 3474#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 3567#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3568#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 3475#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3476#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3532#L107 assume !(1 == ~P_1_pc~0); 3585#L107-2 is_P_1_triggered_~__retres1~0 := 0; 3584#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3586#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3587#L467 assume !(0 != activate_threads_~tmp~1); 3635#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3447#L175 assume !(1 == ~P_2_pc~0); 3448#L175-2 is_P_2_triggered_~__retres1~1 := 0; 3449#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 3450#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3495#L475 assume !(0 != activate_threads_~tmp___0~1); 3451#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 3452#L257 assume !(1 == ~C_1_pc~0); 3550#L257-2 assume !(2 == ~C_1_pc~0); 3551#L267-1 is_C_1_triggered_~__retres1~2 := 0; 3607#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 3561#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 3505#L483 assume !(0 != activate_threads_~tmp___1~1); 3506#L537-1 [2018-11-23 07:40:57,337 INFO L796 eck$LassoCheckResult]: Loop: 3506#L537-1 assume !false; 3789#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 3759#L386 assume !false; 3728#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3724#L317 assume !(0 == ~P_1_st~0); 3720#L321 assume !(0 == ~P_2_st~0); 3715#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 3708#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3704#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 3702#L351 assume !(0 != eval_~tmp___2~0); 3701#L402 start_simulation_~kernel_st~0 := 2; 3700#L287-1 start_simulation_~kernel_st~0 := 3; 3699#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3698#L107-6 assume 1 == ~P_1_pc~0; 3696#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 3695#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3694#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3693#L467-6 assume !(0 != activate_threads_~tmp~1); 3692#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3690#L175-6 assume !(1 == ~P_2_pc~0); 3691#L175-8 is_P_2_triggered_~__retres1~1 := 0; 3664#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 3665#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3655#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 3656#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 3507#L257-6 assume !(1 == ~C_1_pc~0); 3508#L257-8 assume !(2 == ~C_1_pc~0); 3531#L267-5 is_C_1_triggered_~__retres1~2 := 0; 3592#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 3555#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 3556#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 3498#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3499#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3943#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3626#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 3601#L556 assume !(0 == start_simulation_~tmp~3); 3562#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3589#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3469#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3542#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3471#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3472#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 3491#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 3492#L569 assume !(0 != start_simulation_~tmp___0~2); 3506#L537-1 [2018-11-23 07:40:57,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:57,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 2 times [2018-11-23 07:40:57,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:57,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:57,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:57,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:40:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:40:57,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:57,358 INFO L82 PathProgramCache]: Analyzing trace with hash -303364692, now seen corresponding path program 1 times [2018-11-23 07:40:57,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:57,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:57,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:40:57,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:57,378 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 07:40:57,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:40:57,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:40:57,379 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:40:57,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:40:57,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:40:57,379 INFO L87 Difference]: Start difference. First operand 528 states and 756 transitions. cyclomatic complexity: 229 Second operand 3 states. [2018-11-23 07:40:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:40:57,420 INFO L93 Difference]: Finished difference Result 922 states and 1296 transitions. [2018-11-23 07:40:57,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:40:57,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 922 states and 1296 transitions. [2018-11-23 07:40:57,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 896 [2018-11-23 07:40:57,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 922 states to 922 states and 1296 transitions. [2018-11-23 07:40:57,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 922 [2018-11-23 07:40:57,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 922 [2018-11-23 07:40:57,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 922 states and 1296 transitions. [2018-11-23 07:40:57,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:40:57,429 INFO L705 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2018-11-23 07:40:57,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states and 1296 transitions. [2018-11-23 07:40:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2018-11-23 07:40:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2018-11-23 07:40:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1296 transitions. [2018-11-23 07:40:57,439 INFO L728 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2018-11-23 07:40:57,439 INFO L608 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2018-11-23 07:40:57,439 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 07:40:57,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 922 states and 1296 transitions. [2018-11-23 07:40:57,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 896 [2018-11-23 07:40:57,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:40:57,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:40:57,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:57,443 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:57,443 INFO L794 eck$LassoCheckResult]: Stem: 5061#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 4929#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 4930#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 5024#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5025#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 4935#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 4936#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4987#L107 assume !(1 == ~P_1_pc~0); 5040#L107-2 is_P_1_triggered_~__retres1~0 := 0; 5039#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5041#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5042#L467 assume !(0 != activate_threads_~tmp~1); 5087#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 4903#L175 assume !(1 == ~P_2_pc~0); 4904#L175-2 is_P_2_triggered_~__retres1~1 := 0; 4905#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 4906#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 4953#L475 assume !(0 != activate_threads_~tmp___0~1); 4907#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 4908#L257 assume !(1 == ~C_1_pc~0); 5005#L257-2 assume !(2 == ~C_1_pc~0); 5006#L267-1 is_C_1_triggered_~__retres1~2 := 0; 5059#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5015#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 4958#L483 assume !(0 != activate_threads_~tmp___1~1); 4959#L537-1 [2018-11-23 07:40:57,444 INFO L796 eck$LassoCheckResult]: Loop: 4959#L537-1 assume !false; 5308#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 5306#L386 assume !false; 5304#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5300#L317 assume !(0 == ~P_1_st~0); 5301#L321 assume !(0 == ~P_2_st~0); 5625#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 5623#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5622#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 5621#L351 assume !(0 != eval_~tmp___2~0); 5619#L402 start_simulation_~kernel_st~0 := 2; 5616#L287-1 start_simulation_~kernel_st~0 := 3; 5615#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 5611#L107-6 assume 1 == ~P_1_pc~0; 5609#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 5372#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5371#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5368#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 5366#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 5363#L175-6 assume !(1 == ~P_2_pc~0); 5361#L175-8 is_P_2_triggered_~__retres1~1 := 0; 5359#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 5357#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 5355#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 5353#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 5351#L257-6 assume !(1 == ~C_1_pc~0); 5349#L257-8 assume !(2 == ~C_1_pc~0); 5347#L267-5 is_C_1_triggered_~__retres1~2 := 0; 5345#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5343#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 5341#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 5339#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5336#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 5334#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5330#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 5326#L556 assume !(0 == start_simulation_~tmp~3); 5324#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5318#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 5316#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5315#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 5314#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5313#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 5312#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 5311#L569 assume !(0 != start_simulation_~tmp___0~2); 4959#L537-1 [2018-11-23 07:40:57,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 3 times [2018-11-23 07:40:57,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:57,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:57,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:57,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:40:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:40:57,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2068374570, now seen corresponding path program 1 times [2018-11-23 07:40:57,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:57,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:57,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:40:57,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:57,522 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 07:40:57,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:40:57,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:40:57,522 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:40:57,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:40:57,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:40:57,523 INFO L87 Difference]: Start difference. First operand 922 states and 1296 transitions. cyclomatic complexity: 375 Second operand 5 states. [2018-11-23 07:40:57,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:40:57,596 INFO L93 Difference]: Finished difference Result 2050 states and 2879 transitions. [2018-11-23 07:40:57,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:40:57,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 2879 transitions. [2018-11-23 07:40:57,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2024 [2018-11-23 07:40:57,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 2879 transitions. [2018-11-23 07:40:57,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2018-11-23 07:40:57,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2018-11-23 07:40:57,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 2879 transitions. [2018-11-23 07:40:57,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:40:57,616 INFO L705 BuchiCegarLoop]: Abstraction has 2050 states and 2879 transitions. [2018-11-23 07:40:57,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 2879 transitions. [2018-11-23 07:40:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 958. [2018-11-23 07:40:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-11-23 07:40:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1323 transitions. [2018-11-23 07:40:57,637 INFO L728 BuchiCegarLoop]: Abstraction has 958 states and 1323 transitions. [2018-11-23 07:40:57,637 INFO L608 BuchiCegarLoop]: Abstraction has 958 states and 1323 transitions. [2018-11-23 07:40:57,637 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 07:40:57,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 958 states and 1323 transitions. [2018-11-23 07:40:57,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 932 [2018-11-23 07:40:57,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:40:57,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:40:57,641 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:57,642 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:57,642 INFO L794 eck$LassoCheckResult]: Stem: 8058#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 7915#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 7916#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 8009#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 8010#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 7917#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 7918#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 7973#L107 assume !(1 == ~P_1_pc~0); 8028#L107-2 is_P_1_triggered_~__retres1~0 := 0; 8027#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8029#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8030#L467 assume !(0 != activate_threads_~tmp~1); 8096#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 7889#L175 assume !(1 == ~P_2_pc~0); 7890#L175-2 is_P_2_triggered_~__retres1~1 := 0; 7891#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 7892#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 7936#L475 assume !(0 != activate_threads_~tmp___0~1); 7893#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 7894#L257 assume !(1 == ~C_1_pc~0); 7992#L257-2 assume !(2 == ~C_1_pc~0); 7993#L267-1 is_C_1_triggered_~__retres1~2 := 0; 8056#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8003#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 7945#L483 assume !(0 != activate_threads_~tmp___1~1); 7946#L537-1 [2018-11-23 07:40:57,642 INFO L796 eck$LassoCheckResult]: Loop: 7946#L537-1 assume !false; 8392#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 8389#L386 assume !false; 8388#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8387#L317 assume !(0 == ~P_1_st~0); 7899#L321 assume !(0 == ~P_2_st~0); 7901#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 7975#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 7976#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 8815#L351 assume !(0 != eval_~tmp___2~0); 8038#L402 start_simulation_~kernel_st~0 := 2; 7985#L287-1 start_simulation_~kernel_st~0 := 3; 7986#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 8037#L107-6 assume 1 == ~P_1_pc~0; 8149#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 8150#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8287#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8082#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 8084#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 8275#L175-6 assume !(1 == ~P_2_pc~0); 8274#L175-8 is_P_2_triggered_~__retres1~1 := 0; 8273#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 8272#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8271#L475-6 assume !(0 != activate_threads_~tmp___0~1); 8270#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 8269#L257-6 assume !(1 == ~C_1_pc~0); 8268#L257-8 assume !(2 == ~C_1_pc~0); 8254#L267-5 is_C_1_triggered_~__retres1~2 := 0; 8255#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8244#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 8245#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 8236#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8237#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8409#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8407#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 8404#L556 assume !(0 == start_simulation_~tmp~3); 8402#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8401#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8400#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8399#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 8398#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 8397#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 8396#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 8395#L569 assume !(0 != start_simulation_~tmp___0~2); 7946#L537-1 [2018-11-23 07:40:57,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:57,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 4 times [2018-11-23 07:40:57,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:57,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:57,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:40:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:40:57,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:57,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1803890900, now seen corresponding path program 1 times [2018-11-23 07:40:57,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:57,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:57,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:40:57,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:57,712 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 07:40:57,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:40:57,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:40:57,713 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:40:57,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:40:57,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:40:57,713 INFO L87 Difference]: Start difference. First operand 958 states and 1323 transitions. cyclomatic complexity: 366 Second operand 5 states. [2018-11-23 07:40:57,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:40:57,777 INFO L93 Difference]: Finished difference Result 2024 states and 2800 transitions. [2018-11-23 07:40:57,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:40:57,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2024 states and 2800 transitions. [2018-11-23 07:40:57,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1998 [2018-11-23 07:40:57,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2024 states to 2024 states and 2800 transitions. [2018-11-23 07:40:57,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2024 [2018-11-23 07:40:57,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2024 [2018-11-23 07:40:57,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2024 states and 2800 transitions. [2018-11-23 07:40:57,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:40:57,790 INFO L705 BuchiCegarLoop]: Abstraction has 2024 states and 2800 transitions. [2018-11-23 07:40:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states and 2800 transitions. [2018-11-23 07:40:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 988. [2018-11-23 07:40:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-11-23 07:40:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1342 transitions. [2018-11-23 07:40:57,806 INFO L728 BuchiCegarLoop]: Abstraction has 988 states and 1342 transitions. [2018-11-23 07:40:57,806 INFO L608 BuchiCegarLoop]: Abstraction has 988 states and 1342 transitions. [2018-11-23 07:40:57,806 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 07:40:57,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1342 transitions. [2018-11-23 07:40:57,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2018-11-23 07:40:57,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:40:57,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:40:57,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:57,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:40:57,810 INFO L794 eck$LassoCheckResult]: Stem: 11064#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 10912#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 10913#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 11011#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 11012#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 10914#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 10915#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 10974#L107 assume !(1 == ~P_1_pc~0); 11029#L107-2 is_P_1_triggered_~__retres1~0 := 0; 11028#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11030#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11031#L467 assume !(0 != activate_threads_~tmp~1); 11102#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 10885#L175 assume !(1 == ~P_2_pc~0); 10886#L175-2 is_P_2_triggered_~__retres1~1 := 0; 10887#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 10888#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 10933#L475 assume !(0 != activate_threads_~tmp___0~1); 10889#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 10890#L257 assume !(1 == ~C_1_pc~0); 10993#L257-2 assume !(2 == ~C_1_pc~0); 10994#L267-1 is_C_1_triggered_~__retres1~2 := 0; 11061#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11005#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 10942#L483 assume !(0 != activate_threads_~tmp___1~1); 10943#L537-1 [2018-11-23 07:40:57,810 INFO L796 eck$LassoCheckResult]: Loop: 10943#L537-1 assume !false; 11780#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 11676#L386 assume !false; 11778#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11775#L317 assume !(0 == ~P_1_st~0); 10895#L321 assume !(0 == ~P_2_st~0); 10897#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 11048#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11774#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 11767#L351 assume !(0 != eval_~tmp___2~0); 11044#L402 start_simulation_~kernel_st~0 := 2; 10986#L287-1 start_simulation_~kernel_st~0 := 3; 10987#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 11043#L107-6 assume 1 == ~P_1_pc~0; 11398#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 11397#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11396#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11395#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 11394#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 11393#L175-6 assume !(1 == ~P_2_pc~0); 11392#L175-8 is_P_2_triggered_~__retres1~1 := 0; 11391#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 11390#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11389#L475-6 assume !(0 != activate_threads_~tmp___0~1); 11388#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 10944#L257-6 assume !(1 == ~C_1_pc~0); 10945#L257-8 assume !(2 == ~C_1_pc~0); 11386#L267-5 is_C_1_triggered_~__retres1~2 := 0; 11384#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11382#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 11380#L483-6 assume !(0 != activate_threads_~tmp___1~1); 11378#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11374#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 11375#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11370#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 11371#L556 assume !(0 == start_simulation_~tmp~3); 11789#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11787#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 11786#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11785#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 11784#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 11783#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 11782#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 11781#L569 assume !(0 != start_simulation_~tmp___0~2); 10943#L537-1 [2018-11-23 07:40:57,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:57,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 5 times [2018-11-23 07:40:57,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:57,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:57,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:57,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:40:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:40:57,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1479959146, now seen corresponding path program 1 times [2018-11-23 07:40:57,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:57,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:57,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:40:57,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:40:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:40:57,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:40:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1057551404, now seen corresponding path program 1 times [2018-11-23 07:40:57,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:40:57,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:40:57,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:40:57,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:40:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:40:57,878 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 07:40:57,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:40:57,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:40:58,103 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-23 07:40:58,188 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:40:58,189 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:40:58,189 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:40:58,189 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:40:58,189 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 07:40:58,189 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:40:58,189 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:40:58,189 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:40:58,189 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-23 07:40:58,189 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:40:58,190 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:40:58,207 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 07:40:58,216 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 07:40:58,218 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 07:40:58,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,237 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 07:40:58,238 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 07:40:58,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,242 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 07:40:58,244 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 07:40:58,246 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 07:40:58,248 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 07:40:58,258 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 07:40:58,259 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 07:40:58,260 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 07:40:58,265 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 07:40:58,267 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 07:40:58,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,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 07:40:58,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 07:40:58,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,281 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 07:40:58,284 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 07:40:58,290 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 07:40:58,292 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 07:40:58,293 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 07:40:58,444 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:40:58,445 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/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 07:40:58,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,450 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,457 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,457 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Honda state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/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 07:40:58,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,488 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,492 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,492 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret1=0} Honda state: {ULTIMATE.start_eval_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/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 07:40:58,528 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,528 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,531 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,531 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret10=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/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 07:40:58,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,564 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,567 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_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/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 07:40:58,595 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,595 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,597 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,597 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret9=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/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 07:40:58,613 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,613 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,616 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret5=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/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 07:40:58,631 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,631 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,634 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,634 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_pc~0=4} Honda state: {~P_2_pc~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/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 07:40:58,663 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,663 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,668 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,668 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___1~0=0} Honda state: {ULTIMATE.start_eval_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/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 07:40:58,694 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,694 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,702 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,703 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:40:58,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,719 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,721 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,721 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4=0} Honda state: {ULTIMATE.start_eval_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:40:58,737 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,737 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,739 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,739 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret7=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:40:58,754 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,754 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,756 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,756 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet2=0} Honda state: {ULTIMATE.start_eval_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:40:58,771 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,771 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,773 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,773 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_st~0=7} Honda state: {~P_2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:40:58,788 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,788 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,790 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,790 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet3=0} Honda state: {ULTIMATE.start_eval_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:40:58,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,805 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,808 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 07:40:58,808 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp___0~1=0, ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Honda state: {ULTIMATE.start_activate_threads_~tmp___0~1=0, ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:40:58,823 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 07:40:58,823 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:40:58,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 07:40:58,842 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 07:40:58,863 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 07:40:58,864 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 07:40:58,865 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 07:40:58,865 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 07:40:58,865 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 07:40:58,865 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 07:40:58,865 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 07:40:58,865 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 07:40:58,865 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 07:40:58,865 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-23 07:40:58,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 07:40:58,865 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 07:40:58,867 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 07:40:58,871 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 07:40:58,875 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 07:40:58,878 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 07:40:58,879 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 07:40:58,880 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 07:40:58,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,883 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 07:40:58,884 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 07:40:58,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,886 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 07:40:58,887 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 07:40:58,888 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 07:40:58,889 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 07:40:58,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,895 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 07:40:58,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,905 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 07:40:58,907 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 07:40:58,916 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 07:40:58,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,935 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 07:40:58,937 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 07:40:58,940 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 07:40:58,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 07:40:58,949 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 07:40:58,951 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 07:40:59,182 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 07:40:59,187 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 07:40:59,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,213 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,213 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,241 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,241 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,243 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,244 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,258 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,259 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,260 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,261 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 07:40:59,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 07:40:59,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,293 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 07:40:59,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,294 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,294 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,296 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,296 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,306 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,307 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,309 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,309 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,313 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,314 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,315 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,316 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,317 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,318 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,321 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,321 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:40:59,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,323 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,324 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,325 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,326 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,329 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,330 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,331 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,332 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,333 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,334 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,337 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,338 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,339 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,339 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:40:59,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,342 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,342 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:40:59,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,350 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,353 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,355 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,356 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,357 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,358 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:40:59,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,360 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,360 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:40:59,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,362 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,363 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,365 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,365 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,368 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,368 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,370 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,370 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,373 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,373 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,377 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,377 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,380 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,380 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,383 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,383 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,384 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 07:40:59,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,385 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,385 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,387 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,388 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,392 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,393 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,395 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,395 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,397 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,397 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,399 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,399 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,401 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,401 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,403 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,403 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,404 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:40:59,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,406 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,406 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,408 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,408 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,410 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,410 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,412 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,412 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,414 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,415 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,416 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,417 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,419 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,419 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,419 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:40:59,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,421 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,422 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,422 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:40:59,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,428 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,428 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,431 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,431 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,434 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,434 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,435 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:40:59,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,437 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,437 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,438 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:40:59,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,440 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,441 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,443 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,444 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,447 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,447 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,450 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,450 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,453 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,454 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,458 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,459 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,462 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,463 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,467 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,468 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,469 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 07:40:59,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 07:40:59,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,470 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,470 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,473 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,473 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,481 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,481 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,485 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,486 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,488 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,489 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,492 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,492 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,495 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,495 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,498 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,498 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,499 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 07:40:59,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,501 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,502 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,504 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,505 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,508 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,509 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,511 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,512 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,515 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,515 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,518 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,518 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,520 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,520 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,521 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 07:40:59,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,524 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,524 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,525 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 07:40:59,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,533 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,534 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,536 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,537 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,542 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,543 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,543 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 07:40:59,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,546 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,546 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,556 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 07:40:59,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,559 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,559 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,564 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,564 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,568 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,568 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,572 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,572 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,575 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,576 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,583 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,583 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,587 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,587 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 07:40:59,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,591 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,591 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,593 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 07:40:59,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,593 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,593 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,595 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,595 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,597 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,597 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,598 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,599 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,615 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,615 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,616 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,618 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,618 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,618 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,619 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,621 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,621 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,621 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,622 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,624 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,624 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,625 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,625 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,627 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,628 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,628 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,630 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,630 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,631 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,631 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:40:59,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,636 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,636 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,637 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,637 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,639 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,640 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,640 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,642 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,643 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,687 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,688 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,690 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,690 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,696 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,697 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,698 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,698 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,699 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,700 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,700 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,701 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,701 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,709 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,709 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,710 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,710 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:40:59,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,718 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,718 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,719 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,719 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:40:59,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,732 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,732 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,732 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,733 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,736 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,736 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,737 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,737 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,739 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,739 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,739 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,739 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:40:59,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,745 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,745 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,745 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,745 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:40:59,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,750 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,750 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,751 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,754 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,754 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,754 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,755 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,759 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,760 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,760 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,762 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,762 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,763 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,763 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,766 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,766 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,767 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,768 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,773 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,773 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,773 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,777 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,781 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,781 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,782 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,786 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,786 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:40:59,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,788 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 07:40:59,788 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 07:40:59,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,790 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 07:40:59,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,790 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,791 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,792 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,794 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,798 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,798 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,800 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,815 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,815 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,816 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,817 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,820 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,820 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,821 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,821 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,824 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,824 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,825 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,827 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,828 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,828 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,831 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,831 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,831 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,832 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,834 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,835 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,835 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,836 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:40:59,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,840 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,840 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,841 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,842 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,844 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,844 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,844 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,845 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,847 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,847 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,848 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,850 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,850 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,850 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,851 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,853 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,853 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,854 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,854 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,856 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,857 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,858 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,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 07:40:59,859 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,860 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,860 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,861 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:40:59,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,867 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,867 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,867 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,867 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,869 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:40:59,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,876 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,876 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,877 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,878 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,881 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,881 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,882 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,882 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,885 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,885 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,885 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,885 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,886 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:40:59,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,890 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,890 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,890 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,890 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,891 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:40:59,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,895 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,895 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,896 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,897 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,900 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,900 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,900 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,901 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,905 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,905 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,905 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,906 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,908 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,908 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,909 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,909 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,913 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,913 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,914 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,915 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,921 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,921 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,922 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,923 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,928 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,928 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,928 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,929 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,933 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 07:40:59,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,933 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:40:59,934 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:40:59,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,935 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 07:40:59,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,936 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,936 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:40:59,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,936 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,937 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,939 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:40:59,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,940 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,941 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,959 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,959 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:40:59,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,959 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,961 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,963 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,963 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:40:59,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,964 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,965 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,966 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,966 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:40:59,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,967 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,968 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,969 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,969 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:40:59,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,970 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,971 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:40:59,987 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,987 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:40:59,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,987 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,988 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:40:59,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,990 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,990 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:40:59,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,990 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:40:59,991 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:40:59,992 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 07:40:59,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:40:59,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:40:59,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:40:59,999 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:40:59,999 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:40:59,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:40:59,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:40:59,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:40:59,999 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,000 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,012 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,012 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,013 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,013 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,015 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,016 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,016 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,019 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,019 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,020 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,038 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,038 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,038 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,039 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,041 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,041 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,041 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,042 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,044 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,044 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,044 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,046 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 07:41:00,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,063 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,064 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,064 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,064 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,066 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 07:41:00,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,076 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,076 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,077 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,078 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,080 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,080 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,081 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,082 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,093 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,093 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,094 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,094 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,095 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 07:41:00,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,103 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,103 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,104 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,104 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,105 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 07:41:00,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,112 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,112 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,113 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,114 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,121 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,121 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,121 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,122 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,128 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,128 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,128 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,129 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,131 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,131 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,131 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,132 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,147 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,147 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,147 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,149 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,164 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,164 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,165 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,170 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,171 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,171 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,172 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,177 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,177 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,177 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 07:41:00,179 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 07:41:00,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,180 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 07:41:00,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,181 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,181 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,181 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,182 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,184 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,184 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,185 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,185 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,204 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,204 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,204 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,205 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,209 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,209 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,210 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,212 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,212 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,213 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,213 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,232 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,233 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,233 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,233 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,236 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,236 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,236 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,237 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,239 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,240 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,240 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,240 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:41:00,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,258 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,258 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,258 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,259 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,261 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,261 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,261 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,262 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,264 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,264 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,265 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,265 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,283 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,284 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,284 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,284 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,286 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,286 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,287 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,287 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,289 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,289 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,290 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,296 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,310 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,310 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,311 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,311 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,311 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:41:00,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,315 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,316 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,316 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,316 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:41:00,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,329 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,329 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,329 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,330 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,340 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,341 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,341 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,344 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,344 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,344 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,344 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,345 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:41:00,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,348 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,348 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,348 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,348 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,349 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 07:41:00,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,366 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,367 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,367 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,368 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,371 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,371 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,372 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,372 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,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 07:41:00,375 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,375 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,375 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,376 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,394 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,394 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,394 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,395 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,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 07:41:00,398 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,398 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,399 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,400 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,406 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,407 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,407 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,422 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,422 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,423 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,423 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,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 07:41:00,429 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,429 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 07:41:00,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,429 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 07:41:00,429 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 07:41:00,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,431 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 07:41:00,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 07:41:00,432 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,432 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,432 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,448 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,448 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,448 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,465 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,465 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,465 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,487 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,487 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,488 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,491 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,491 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,492 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,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 07:41:00,496 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,496 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,496 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,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 07:41:00,504 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,504 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,504 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,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 07:41:00,509 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,509 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,509 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,509 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,510 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 07:41:00,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,515 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,515 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,515 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,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 07:41:00,519 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,519 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,519 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,535 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,535 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,536 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,539 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,539 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,540 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,544 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,544 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,544 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,562 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,563 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,563 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,567 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,567 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,567 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,567 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,568 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 07:41:00,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,574 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,574 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,575 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,575 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,576 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 07:41:00,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,592 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,592 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,592 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,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 07:41:00,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,599 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,599 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,602 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,603 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,603 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,603 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,604 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 07:41:00,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,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 07:41:00,620 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,620 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,620 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 07:41:00,621 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,621 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 07:41:00,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,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 07:41:00,625 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,625 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,625 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,631 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,631 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,632 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,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 07:41:00,648 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,648 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,649 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,652 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,652 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,653 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,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 07:41:00,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,656 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,657 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 07:41:00,678 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,678 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,679 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 07:41:00,684 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,684 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,684 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,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 07:41:00,689 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 07:41:00,689 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 07:41:00,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 07:41:00,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 07:41:00,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 07:41:00,690 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 07:41:00,691 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 07:41:00,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 07:41:00,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 07:41:00,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:41:00,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:41:00,709 INFO L87 Difference]: Start difference. First operand 988 states and 1342 transitions. cyclomatic complexity: 355 Second operand 3 states. [2018-11-23 07:41:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:41:00,972 INFO L93 Difference]: Finished difference Result 988 states and 1326 transitions. [2018-11-23 07:41:00,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:41:00,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 988 states and 1326 transitions. [2018-11-23 07:41:00,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2018-11-23 07:41:00,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 988 states to 988 states and 1326 transitions. [2018-11-23 07:41:00,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 988 [2018-11-23 07:41:00,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 988 [2018-11-23 07:41:00,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 988 states and 1326 transitions. [2018-11-23 07:41:00,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:41:00,986 INFO L705 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2018-11-23 07:41:00,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states and 1326 transitions. [2018-11-23 07:41:01,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2018-11-23 07:41:01,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-11-23 07:41:01,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1326 transitions. [2018-11-23 07:41:01,008 INFO L728 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2018-11-23 07:41:01,008 INFO L608 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2018-11-23 07:41:01,008 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 07:41:01,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1326 transitions. [2018-11-23 07:41:01,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2018-11-23 07:41:01,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:41:01,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:41:01,013 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:01,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:01,013 INFO L794 eck$LassoCheckResult]: Stem: 13041#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 12895#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 12896#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 12992#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 12993#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 12899#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 12900#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 12953#L107 assume !(1 == ~P_1_pc~0); 13011#L107-2 is_P_1_triggered_~__retres1~0 := 0; 13010#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 13012#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 13013#L467 assume !(0 != activate_threads_~tmp~1); 13080#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 12869#L175 assume !(1 == ~P_2_pc~0); 12870#L175-2 is_P_2_triggered_~__retres1~1 := 0; 12871#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 12872#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 12919#L475 assume !(0 != activate_threads_~tmp___0~1); 12873#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 12874#L257 assume !(1 == ~C_1_pc~0); 12974#L257-2 assume !(2 == ~C_1_pc~0); 12975#L267-1 is_C_1_triggered_~__retres1~2 := 0; 13039#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 12986#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 12924#L483 assume !(0 != activate_threads_~tmp___1~1); 12925#L537-1 [2018-11-23 07:41:01,013 INFO L796 eck$LassoCheckResult]: Loop: 12925#L537-1 assume !false; 12951#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 12952#L386 assume !false; 12988#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13024#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 13099#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 13097#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 13095#L351 assume 0 != eval_~tmp___2~0; 13092#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 13057#L360 assume 0 != eval_~tmp~0;~P_1_st~0 := 1; 12990#L72 assume 0 == ~P_1_pc~0; 12911#L76 assume !(~i~0 < ~max_loop~0); 12912#L95 ~P_1_st~0 := 2; 12902#L356 assume !(0 == ~P_2_st~0); 13052#L371 assume !(0 == ~C_1_st~0); 13053#L386 assume !false; 13744#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13008#L317 assume !(0 == ~P_1_st~0); 12879#L321 assume !(0 == ~P_2_st~0); 12881#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 13025#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 13808#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 13807#L351 assume !(0 != eval_~tmp___2~0); 13021#L402 start_simulation_~kernel_st~0 := 2; 12967#L287-1 start_simulation_~kernel_st~0 := 3; 12968#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 13020#L107-6 assume 1 == ~P_1_pc~0; 12996#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 12997#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 13001#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 13002#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 13066#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 13070#L175-6 assume !(1 == ~P_2_pc~0); 13069#L175-8 is_P_2_triggered_~__retres1~1 := 0; 12916#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 12917#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 12886#L475-6 assume !(0 != activate_threads_~tmp___0~1); 12887#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 13843#L257-6 assume !(1 == ~C_1_pc~0); 13842#L257-8 assume !(2 == ~C_1_pc~0); 13841#L267-5 is_C_1_triggered_~__retres1~2 := 0; 13840#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 13839#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 12906#L483-6 assume !(0 != activate_threads_~tmp___1~1); 12907#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 12918#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 12960#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 12961#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 13029#L556 assume !(0 == start_simulation_~tmp~3); 12987#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13015#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 12962#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 12963#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 12891#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 12892#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 12909#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 12910#L569 assume !(0 != start_simulation_~tmp___0~2); 12925#L537-1 [2018-11-23 07:41:01,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:01,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 6 times [2018-11-23 07:41:01,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:01,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:01,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:01,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:01,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash 779870938, now seen corresponding path program 1 times [2018-11-23 07:41:01,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:01,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:01,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:41:01,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:01,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:41:01,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:41:01,121 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:41:01,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:41:01,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:41:01,121 INFO L87 Difference]: Start difference. First operand 988 states and 1326 transitions. cyclomatic complexity: 339 Second operand 3 states. [2018-11-23 07:41:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:41:01,275 INFO L93 Difference]: Finished difference Result 1925 states and 2547 transitions. [2018-11-23 07:41:01,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:41:01,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1925 states and 2547 transitions. [2018-11-23 07:41:01,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1900 [2018-11-23 07:41:01,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1925 states to 1925 states and 2547 transitions. [2018-11-23 07:41:01,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1925 [2018-11-23 07:41:01,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1925 [2018-11-23 07:41:01,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1925 states and 2547 transitions. [2018-11-23 07:41:01,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:41:01,299 INFO L705 BuchiCegarLoop]: Abstraction has 1925 states and 2547 transitions. [2018-11-23 07:41:01,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states and 2547 transitions. [2018-11-23 07:41:01,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1909. [2018-11-23 07:41:01,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1909 states. [2018-11-23 07:41:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 2527 transitions. [2018-11-23 07:41:01,326 INFO L728 BuchiCegarLoop]: Abstraction has 1909 states and 2527 transitions. [2018-11-23 07:41:01,326 INFO L608 BuchiCegarLoop]: Abstraction has 1909 states and 2527 transitions. [2018-11-23 07:41:01,326 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 07:41:01,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1909 states and 2527 transitions. [2018-11-23 07:41:01,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1884 [2018-11-23 07:41:01,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:41:01,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:41:01,333 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:01,334 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:01,334 INFO L794 eck$LassoCheckResult]: Stem: 15958#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 15814#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 15815#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 15906#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 15907#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 15816#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 15817#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 15870#L107 assume !(1 == ~P_1_pc~0); 15950#L107-2 is_P_1_triggered_~__retres1~0 := 0; 15951#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 15924#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 15925#L467 assume !(0 != activate_threads_~tmp~1); 15990#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 15788#L175 assume !(1 == ~P_2_pc~0); 15789#L175-2 is_P_2_triggered_~__retres1~1 := 0; 15790#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 15791#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 15835#L475 assume !(0 != activate_threads_~tmp___0~1); 15792#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 15793#L257 assume !(1 == ~C_1_pc~0); 15890#L257-2 assume !(2 == ~C_1_pc~0); 15891#L267-1 is_C_1_triggered_~__retres1~2 := 0; 15955#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 15901#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 15843#L483 assume !(0 != activate_threads_~tmp___1~1); 15844#L537-1 [2018-11-23 07:41:01,334 INFO L796 eck$LassoCheckResult]: Loop: 15844#L537-1 assume !false; 17251#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 17248#L386 assume !false; 17246#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17243#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17241#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17238#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17234#L351 assume 0 != eval_~tmp___2~0; 17232#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 17230#L360 assume 0 != eval_~tmp~0;~P_1_st~0 := 1; 15905#L72 assume 0 == ~P_1_pc~0; 15828#L76 assume !(~i~0 < ~max_loop~0); 15829#L95 ~P_1_st~0 := 2; 15859#L356 assume !(0 == ~P_2_st~0); 17387#L371 assume !(0 == ~C_1_st~0); 17408#L386 assume !false; 17402#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17398#L317 assume !(0 == ~P_1_st~0); 17395#L321 assume !(0 == ~P_2_st~0); 17390#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 17384#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17383#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17381#L351 assume !(0 != eval_~tmp___2~0); 17379#L402 start_simulation_~kernel_st~0 := 2; 17378#L287-1 start_simulation_~kernel_st~0 := 3; 17377#L413 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 17376#L107-6 assume !(1 == ~P_1_pc~0); 17372#L107-8 is_P_1_triggered_~__retres1~0 := 0; 17370#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 17368#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 17365#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 17362#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 17360#L175-6 assume !(1 == ~P_2_pc~0); 17358#L175-8 is_P_2_triggered_~__retres1~1 := 0; 17356#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 17354#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 17352#L475-6 assume !(0 != activate_threads_~tmp___0~1); 17350#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 17348#L257-6 assume !(1 == ~C_1_pc~0); 17346#L257-8 assume !(2 == ~C_1_pc~0); 17344#L267-5 is_C_1_triggered_~__retres1~2 := 0; 17343#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 17340#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 17338#L483-6 assume !(0 != activate_threads_~tmp___1~1); 17336#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17333#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17331#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17329#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 17327#L556 assume !(0 == start_simulation_~tmp~3); 17324#L556-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17322#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17321#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17320#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 17318#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 17316#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 17314#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 17312#L569 assume !(0 != start_simulation_~tmp___0~2); 15844#L537-1 [2018-11-23 07:41:01,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:01,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 7 times [2018-11-23 07:41:01,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:01,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:01,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:01,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:01,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:01,343 INFO L82 PathProgramCache]: Analyzing trace with hash -991600037, now seen corresponding path program 1 times [2018-11-23 07:41:01,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:01,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 07:41:01,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:41:01,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 07:41:01,394 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 07:41:01,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:41:01,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:41:01,395 INFO L87 Difference]: Start difference. First operand 1909 states and 2527 transitions. cyclomatic complexity: 619 Second operand 5 states. [2018-11-23 07:41:01,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:41:01,473 INFO L93 Difference]: Finished difference Result 3270 states and 4376 transitions. [2018-11-23 07:41:01,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:41:01,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3270 states and 4376 transitions. [2018-11-23 07:41:01,493 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 3203 [2018-11-23 07:41:01,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3270 states to 3270 states and 4376 transitions. [2018-11-23 07:41:01,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3270 [2018-11-23 07:41:01,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3270 [2018-11-23 07:41:01,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3270 states and 4376 transitions. [2018-11-23 07:41:01,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:41:01,521 INFO L705 BuchiCegarLoop]: Abstraction has 3270 states and 4376 transitions. [2018-11-23 07:41:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states and 4376 transitions. [2018-11-23 07:41:01,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 1735. [2018-11-23 07:41:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-11-23 07:41:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2280 transitions. [2018-11-23 07:41:01,562 INFO L728 BuchiCegarLoop]: Abstraction has 1735 states and 2280 transitions. [2018-11-23 07:41:01,562 INFO L608 BuchiCegarLoop]: Abstraction has 1735 states and 2280 transitions. [2018-11-23 07:41:01,562 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 07:41:01,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1735 states and 2280 transitions. [2018-11-23 07:41:01,573 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1700 [2018-11-23 07:41:01,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:41:01,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:41:01,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:01,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:01,575 INFO L794 eck$LassoCheckResult]: Stem: 21160#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 21006#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 21007#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 21101#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 21102#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 21008#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 21009#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 21064#L107 assume !(1 == ~P_1_pc~0); 21151#L107-2 is_P_1_triggered_~__retres1~0 := 0; 21152#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 21120#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 21121#L467 assume !(0 != activate_threads_~tmp~1); 21202#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 20980#L175 assume !(1 == ~P_2_pc~0); 20981#L175-2 is_P_2_triggered_~__retres1~1 := 0; 20982#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 20983#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 21027#L475 assume !(0 != activate_threads_~tmp___0~1); 20984#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 20985#L257 assume !(1 == ~C_1_pc~0); 21083#L257-2 assume !(2 == ~C_1_pc~0); 21084#L267-1 is_C_1_triggered_~__retres1~2 := 0; 21156#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 21096#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 21036#L483 assume !(0 != activate_threads_~tmp___1~1); 21037#L537-1 assume !false; 21472#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 21440#L386 [2018-11-23 07:41:01,575 INFO L796 eck$LassoCheckResult]: Loop: 21440#L386 assume !false; 21471#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 21470#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 21465#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 21462#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 21460#L351 assume 0 != eval_~tmp___2~0; 21457#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 21453#L360 assume !(0 != eval_~tmp~0); 21447#L356 assume !(0 == ~P_2_st~0); 21444#L371 assume !(0 == ~C_1_st~0); 21440#L386 [2018-11-23 07:41:01,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 1 times [2018-11-23 07:41:01,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:01,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:01,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:01,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 1 times [2018-11-23 07:41:01,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:01,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:01,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:01,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:01,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:01,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1596403455, now seen corresponding path program 1 times [2018-11-23 07:41:01,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:01,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:01,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:01,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:01,618 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 07:41:01,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:41:01,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:41:01,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:41:01,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:41:01,685 INFO L87 Difference]: Start difference. First operand 1735 states and 2280 transitions. cyclomatic complexity: 548 Second operand 3 states. [2018-11-23 07:41:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:41:01,734 INFO L93 Difference]: Finished difference Result 2774 states and 3602 transitions. [2018-11-23 07:41:01,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:41:01,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2774 states and 3602 transitions. [2018-11-23 07:41:01,748 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2709 [2018-11-23 07:41:01,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2774 states to 2774 states and 3602 transitions. [2018-11-23 07:41:01,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2774 [2018-11-23 07:41:01,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2774 [2018-11-23 07:41:01,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2774 states and 3602 transitions. [2018-11-23 07:41:01,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:41:01,766 INFO L705 BuchiCegarLoop]: Abstraction has 2774 states and 3602 transitions. [2018-11-23 07:41:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states and 3602 transitions. [2018-11-23 07:41:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2682. [2018-11-23 07:41:01,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2018-11-23 07:41:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 3490 transitions. [2018-11-23 07:41:01,806 INFO L728 BuchiCegarLoop]: Abstraction has 2682 states and 3490 transitions. [2018-11-23 07:41:01,806 INFO L608 BuchiCegarLoop]: Abstraction has 2682 states and 3490 transitions. [2018-11-23 07:41:01,806 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 07:41:01,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2682 states and 3490 transitions. [2018-11-23 07:41:01,815 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2018-11-23 07:41:01,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:41:01,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:41:01,816 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:01,816 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:01,816 INFO L794 eck$LassoCheckResult]: Stem: 25680#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 25520#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 25521#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 25624#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 25625#L294-1 assume !(1 == ~P_2_i~0);~P_2_st~0 := 2; 25689#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 25581#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 25582#L107 assume !(1 == ~P_1_pc~0); 25672#L107-2 is_P_1_triggered_~__retres1~0 := 0; 25673#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 25640#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 25641#L467 assume !(0 != activate_threads_~tmp~1); 25719#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 25720#L175 assume !(1 == ~P_2_pc~0); 27487#L175-2 is_P_2_triggered_~__retres1~1 := 0; 27486#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 27485#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 25541#L475 assume !(0 != activate_threads_~tmp___0~1); 25542#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 25612#L257 assume !(1 == ~C_1_pc~0); 25613#L257-2 assume !(2 == ~C_1_pc~0); 27454#L267-1 is_C_1_triggered_~__retres1~2 := 0; 27452#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 27450#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 27448#L483 assume !(0 != activate_threads_~tmp___1~1); 27446#L537-1 assume !false; 27437#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 27432#L386 [2018-11-23 07:41:01,817 INFO L796 eck$LassoCheckResult]: Loop: 27432#L386 assume !false; 27430#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 27428#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 27426#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 27424#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 27422#L351 assume 0 != eval_~tmp___2~0; 27420#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 27417#L360 assume !(0 != eval_~tmp~0); 27418#L356 assume !(0 == ~P_2_st~0); 27435#L371 assume !(0 == ~C_1_st~0); 27432#L386 [2018-11-23 07:41:01,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:01,817 INFO L82 PathProgramCache]: Analyzing trace with hash 918352559, now seen corresponding path program 1 times [2018-11-23 07:41:01,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:01,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:01,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:01,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:01,835 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 07:41:01,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:41:01,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:41:01,835 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 07:41:01,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:01,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 2 times [2018-11-23 07:41:01,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:01,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:01,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:01,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:01,972 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-11-23 07:41:02,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:41:02,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:41:02,011 INFO L87 Difference]: Start difference. First operand 2682 states and 3490 transitions. cyclomatic complexity: 811 Second operand 3 states. [2018-11-23 07:41:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:41:02,020 INFO L93 Difference]: Finished difference Result 2660 states and 3467 transitions. [2018-11-23 07:41:02,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:41:02,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2660 states and 3467 transitions. [2018-11-23 07:41:02,029 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2018-11-23 07:41:02,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2660 states to 2660 states and 3467 transitions. [2018-11-23 07:41:02,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2660 [2018-11-23 07:41:02,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2660 [2018-11-23 07:41:02,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2660 states and 3467 transitions. [2018-11-23 07:41:02,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:41:02,042 INFO L705 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2018-11-23 07:41:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states and 3467 transitions. [2018-11-23 07:41:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2660. [2018-11-23 07:41:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2018-11-23 07:41:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3467 transitions. [2018-11-23 07:41:02,064 INFO L728 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2018-11-23 07:41:02,064 INFO L608 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2018-11-23 07:41:02,064 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 07:41:02,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2660 states and 3467 transitions. [2018-11-23 07:41:02,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2018-11-23 07:41:02,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:41:02,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:41:02,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:02,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:02,072 INFO L794 eck$LassoCheckResult]: Stem: 31021#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 30868#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 30869#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 30966#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 30967#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 30874#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 30875#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 30926#L107 assume !(1 == ~P_1_pc~0); 31012#L107-2 is_P_1_triggered_~__retres1~0 := 0; 31013#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 30982#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 30983#L467 assume !(0 != activate_threads_~tmp~1); 31054#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 30845#L175 assume !(1 == ~P_2_pc~0); 30846#L175-2 is_P_2_triggered_~__retres1~1 := 0; 30847#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 30848#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 30892#L475 assume !(0 != activate_threads_~tmp___0~1); 30849#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 30850#L257 assume !(1 == ~C_1_pc~0); 30945#L257-2 assume !(2 == ~C_1_pc~0); 30946#L267-1 is_C_1_triggered_~__retres1~2 := 0; 31016#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 30957#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 30897#L483 assume !(0 != activate_threads_~tmp___1~1); 30898#L537-1 assume !false; 30924#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 30925#L386 [2018-11-23 07:41:02,072 INFO L796 eck$LassoCheckResult]: Loop: 30925#L386 assume !false; 30959#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 30979#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 30928#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 30929#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 30912#L351 assume 0 != eval_~tmp___2~0; 30876#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 30877#L360 assume !(0 != eval_~tmp~0); 31033#L356 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 32102#L375 assume !(0 != eval_~tmp___0~0); 32103#L371 assume !(0 == ~C_1_st~0); 30925#L386 [2018-11-23 07:41:02,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 2 times [2018-11-23 07:41:02,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:02,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:02,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:41:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:02,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:02,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1336445219, now seen corresponding path program 1 times [2018-11-23 07:41:02,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:02,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:02,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:02,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:41:02,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:02,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:02,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2050962807, now seen corresponding path program 1 times [2018-11-23 07:41:02,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:02,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:02,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:02,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:02,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:41:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:41:02,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:41:02,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:41:02,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:41:02,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:41:02,169 INFO L87 Difference]: Start difference. First operand 2660 states and 3467 transitions. cyclomatic complexity: 810 Second operand 3 states. [2018-11-23 07:41:02,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:41:02,192 INFO L93 Difference]: Finished difference Result 4373 states and 5643 transitions. [2018-11-23 07:41:02,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:41:02,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4373 states and 5643 transitions. [2018-11-23 07:41:02,203 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4314 [2018-11-23 07:41:02,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4373 states to 4373 states and 5643 transitions. [2018-11-23 07:41:02,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4373 [2018-11-23 07:41:02,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4373 [2018-11-23 07:41:02,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4373 states and 5643 transitions. [2018-11-23 07:41:02,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 07:41:02,220 INFO L705 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2018-11-23 07:41:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states and 5643 transitions. [2018-11-23 07:41:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4373. [2018-11-23 07:41:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4373 states. [2018-11-23 07:41:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 5643 transitions. [2018-11-23 07:41:02,256 INFO L728 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2018-11-23 07:41:02,256 INFO L608 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2018-11-23 07:41:02,256 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 07:41:02,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4373 states and 5643 transitions. [2018-11-23 07:41:02,266 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4314 [2018-11-23 07:41:02,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 07:41:02,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 07:41:02,266 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:02,266 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:41:02,267 INFO L794 eck$LassoCheckResult]: Stem: 38077#ULTIMATE.startENTRY ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 37909#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 37910#L589 havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; 38009#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 38010#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 37911#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 37912#L304-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 37968#L107 assume !(1 == ~P_1_pc~0); 38067#L107-2 is_P_1_triggered_~__retres1~0 := 0; 38068#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 38029#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 38030#L467 assume !(0 != activate_threads_~tmp~1); 38116#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 37886#L175 assume !(1 == ~P_2_pc~0); 37887#L175-2 is_P_2_triggered_~__retres1~1 := 0; 37888#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 37889#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 37931#L475 assume !(0 != activate_threads_~tmp___0~1); 37890#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 37891#L257 assume !(1 == ~C_1_pc~0); 37987#L257-2 assume !(2 == ~C_1_pc~0); 37988#L267-1 is_C_1_triggered_~__retres1~2 := 0; 38074#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 38001#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 37939#L483 assume !(0 != activate_threads_~tmp___1~1); 37940#L537-1 assume !false; 39076#L538 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 38562#L386 [2018-11-23 07:41:02,267 INFO L796 eck$LassoCheckResult]: Loop: 38562#L386 assume !false; 39073#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 39071#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 39069#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 39067#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 39065#L351 assume 0 != eval_~tmp___2~0; 39064#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 39062#L360 assume !(0 != eval_~tmp~0); 38569#L356 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 38566#L375 assume !(0 != eval_~tmp___0~0); 38564#L371 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; 38547#L390 assume !(0 != eval_~tmp___1~0); 38562#L386 [2018-11-23 07:41:02,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:02,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 3 times [2018-11-23 07:41:02,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:02,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:02,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:02,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:02,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:02,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:02,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1519873096, now seen corresponding path program 1 times [2018-11-23 07:41:02,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:02,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:02,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:41:02,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:02,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:41:02,280 INFO L82 PathProgramCache]: Analyzing trace with hash -844664348, now seen corresponding path program 1 times [2018-11-23 07:41:02,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:41:02,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:41:02,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:02,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:41:02,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:41:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:41:02,549 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; [?] havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; [?] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~P_1_i~0;~P_1_st~0 := 0; [?] assume 1 == ~P_2_i~0;~P_2_st~0 := 0; [?] assume 1 == ~C_1_i~0;~C_1_st~0 := 0; [?] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; [?] assume !(1 == ~P_1_pc~0); [?] is_P_1_triggered_~__retres1~0 := 0; [?] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [?] activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; [?] assume !(0 != activate_threads_~tmp~1); [?] havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; [?] assume !(1 == ~P_2_pc~0); [?] is_P_2_triggered_~__retres1~1 := 0; [?] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [?] activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; [?] assume !(0 != activate_threads_~tmp___0~1); [?] havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; [?] assume !(1 == ~C_1_pc~0); [?] assume !(2 == ~C_1_pc~0); [?] is_C_1_triggered_~__retres1~2 := 0; [?] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [?] activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; [?] assume !(0 != activate_threads_~tmp___1~1); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294-L298] assume 1 == ~P_1_i~0; [L295] ~P_1_st~0 := 0; [L299-L303] assume 1 == ~P_2_i~0; [L300] ~P_2_st~0 := 0; [L304-L308] assume 1 == ~C_1_i~0; [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107-L116] assume !(1 == ~P_1_pc~0); [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] assume !(0 != activate_threads_~tmp~1); [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175-L184] assume !(1 == ~P_2_pc~0); [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] assume !(0 != activate_threads_~tmp___0~1); [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257-L266] assume !(1 == ~C_1_pc~0); [L267-L276] assume !(2 == ~C_1_pc~0); [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] assume !(0 != activate_threads_~tmp___1~1); [L537-L574] assume !false; [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294-L298] assume 1 == ~P_1_i~0; [L295] ~P_1_st~0 := 0; [L299-L303] assume 1 == ~P_2_i~0; [L300] ~P_2_st~0 := 0; [L304-L308] assume 1 == ~C_1_i~0; [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107-L116] assume !(1 == ~P_1_pc~0); [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] assume !(0 != activate_threads_~tmp~1); [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175-L184] assume !(1 == ~P_2_pc~0); [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] assume !(0 != activate_threads_~tmp___0~1); [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257-L266] assume !(1 == ~C_1_pc~0); [L267-L276] assume !(2 == ~C_1_pc~0); [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] assume !(0 != activate_threads_~tmp___1~1); [L537-L574] assume !false; [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] COND FALSE !(0 != activate_threads_~tmp~1) [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] COND FALSE !(0 != activate_threads_~tmp___0~1) [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] COND FALSE !(0 != activate_threads_~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] COND FALSE !(0 != activate_threads_~tmp~1) [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] COND FALSE !(0 != activate_threads_~tmp___0~1) [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] COND FALSE !(0 != activate_threads_~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [L593] havoc ~count~0; [L594] havoc ~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] ~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L523] havoc ~kernel_st~0; [L524] havoc ~tmp~3; [L525] havoc ~tmp___0~2; [L529] ~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L459] havoc ~tmp~1; [L460] havoc ~tmp___0~1; [L461] havoc ~tmp___1~1; [L104] havoc ~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] ~__retres1~0 := 0; [L119] #res := ~__retres1~0; [L465] ~tmp~1 := #t~ret5; [L465] havoc #t~ret5; [L467-L471] COND FALSE !(0 != ~tmp~1) [L172] havoc ~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] ~__retres1~1 := 0; [L187] #res := ~__retres1~1; [L473] ~tmp___0~1 := #t~ret6; [L473] havoc #t~ret6; [L475-L479] COND FALSE !(0 != ~tmp___0~1) [L254] havoc ~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] ~__retres1~2 := 0; [L279] #res := ~__retres1~2; [L481] ~tmp___1~1 := #t~ret7; [L481] havoc #t~ret7; [L483-L487] COND FALSE !(0 != ~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] ~kernel_st~0 := 1; [L339] havoc ~tmp~0; [L340] havoc ~tmp___0~0; [L341] havoc ~tmp___1~0; [L342] havoc ~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [L593] havoc ~count~0; [L594] havoc ~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] ~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L523] havoc ~kernel_st~0; [L524] havoc ~tmp~3; [L525] havoc ~tmp___0~2; [L529] ~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L459] havoc ~tmp~1; [L460] havoc ~tmp___0~1; [L461] havoc ~tmp___1~1; [L104] havoc ~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] ~__retres1~0 := 0; [L119] #res := ~__retres1~0; [L465] ~tmp~1 := #t~ret5; [L465] havoc #t~ret5; [L467-L471] COND FALSE !(0 != ~tmp~1) [L172] havoc ~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] ~__retres1~1 := 0; [L187] #res := ~__retres1~1; [L473] ~tmp___0~1 := #t~ret6; [L473] havoc #t~ret6; [L475-L479] COND FALSE !(0 != ~tmp___0~1) [L254] havoc ~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] ~__retres1~2 := 0; [L279] #res := ~__retres1~2; [L481] ~tmp___1~1 := #t~ret7; [L481] havoc #t~ret7; [L483-L487] COND FALSE !(0 != ~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] ~kernel_st~0 := 1; [L339] havoc ~tmp~0; [L340] havoc ~tmp___0~0; [L341] havoc ~tmp___1~0; [L342] havoc ~tmp___2~0; [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int P_2_pc ; [L123] int P_2_st ; [L124] int P_2_i ; [L125] int P_2_ev ; [L190] int C_1_pc ; [L191] int C_1_st ; [L192] int C_1_i ; [L193] int C_1_ev ; [L194] int C_1_pr ; [L593] int count ; [L594] int __retres2 ; [L598] num = 0 [L599] i = 0 [L600] max_loop = 2 [L602] timer = 0 [L603] P_1_pc = 0 [L604] P_2_pc = 0 [L605] C_1_pc = 0 [L607] count = 0 [L585] P_1_i = 1 [L586] P_2_i = 1 [L587] C_1_i = 1 [L523] int kernel_st ; [L524] int tmp ; [L525] int tmp___0 ; [L529] kernel_st = 0 [L294] COND TRUE (int )P_1_i == 1 [L295] P_1_st = 0 [L299] COND TRUE (int )P_2_i == 1 [L300] P_2_st = 0 [L304] COND TRUE (int )C_1_i == 1 [L305] C_1_st = 0 [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; [L104] int __retres1 ; [L107] COND FALSE !((int )P_1_pc == 1) [L117] __retres1 = 0 [L119] return (__retres1); [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) [L172] int __retres1 ; [L175] COND FALSE !((int )P_2_pc == 1) [L185] __retres1 = 0 [L187] return (__retres1); [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) [L254] int __retres1 ; [L257] COND FALSE !((int )C_1_pc == 1) [L267] COND FALSE !((int )C_1_pc == 2) [L277] __retres1 = 0 [L279] return (__retres1); [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE !(\read(tmp___1)) [L537] COND TRUE 1 [L540] kernel_st = 1 [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; [?] assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [?] eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; [?] assume 0 != eval_~tmp___2~0; [?] assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; [?] assume !(0 != eval_~tmp___0~0); [?] assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; [?] assume !(0 != eval_~tmp___1~0); [L346-L401] assume !false; [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317-L332] assume 0 == ~P_1_st~0; [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] assume 0 != eval_~tmp___2~0; [L356-L370] assume 0 == ~P_1_st~0; [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] assume !(0 != eval_~tmp~0); [L371-L385] assume 0 == ~P_2_st~0; [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] assume !(0 != eval_~tmp___0~0); [L386-L400] assume 0 == ~C_1_st~0; [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] assume !(0 != eval_~tmp___1~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L346-L401] assume !false; [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317-L332] assume 0 == ~P_1_st~0; [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] assume 0 != eval_~tmp___2~0; [L356-L370] assume 0 == ~P_1_st~0; [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] assume !(0 != eval_~tmp~0); [L371-L385] assume 0 == ~P_2_st~0; [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] assume !(0 != eval_~tmp___0~0); [L386-L400] assume 0 == ~C_1_st~0; [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] assume !(0 != eval_~tmp___1~0); [L346-L401] COND FALSE !(false) [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] COND TRUE 0 != eval_~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] COND FALSE !(0 != eval_~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] COND FALSE !(0 != eval_~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] COND FALSE !(0 != eval_~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L346-L401] COND FALSE !(false) [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] COND TRUE 0 != eval_~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] COND FALSE !(0 != eval_~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] COND FALSE !(0 != eval_~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] COND FALSE !(0 != eval_~tmp___1~0) [L346-L401] COND FALSE !(false) [L314] havoc ~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] ~__retres1~3 := 1; [L335] #res := ~__retres1~3; [L349] ~tmp___2~0 := #t~ret1; [L349] havoc #t~ret1; [L351-L355] COND TRUE 0 != ~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] ~tmp~0 := #t~nondet2; [L358] havoc #t~nondet2; [L360-L367] COND FALSE !(0 != ~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] ~tmp___0~0 := #t~nondet3; [L373] havoc #t~nondet3; [L375-L382] COND FALSE !(0 != ~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] ~tmp___1~0 := #t~nondet4; [L388] havoc #t~nondet4; [L390-L397] COND FALSE !(0 != ~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L346-L401] COND FALSE !(false) [L314] havoc ~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] ~__retres1~3 := 1; [L335] #res := ~__retres1~3; [L349] ~tmp___2~0 := #t~ret1; [L349] havoc #t~ret1; [L351-L355] COND TRUE 0 != ~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] ~tmp~0 := #t~nondet2; [L358] havoc #t~nondet2; [L360-L367] COND FALSE !(0 != ~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] ~tmp___0~0 := #t~nondet3; [L373] havoc #t~nondet3; [L375-L382] COND FALSE !(0 != ~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] ~tmp___1~0 := #t~nondet4; [L388] havoc #t~nondet4; [L390-L397] COND FALSE !(0 != ~tmp___1~0) [L346] COND TRUE 1 [L314] int __retres1 ; [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 [L335] return (__retres1); [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp)) [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND FALSE !(\read(tmp___0)) [L386] COND TRUE (int )C_1_st == 0 [L388] tmp___1 = __VERIFIER_nondet_int() [L390] COND FALSE !(\read(tmp___1)) ----- [2018-11-23 07:41:02,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 07:41:02 BoogieIcfgContainer [2018-11-23 07:41:02,648 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 07:41:02,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:41:02,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:41:02,649 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:41:02,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:40:56" (3/4) ... [2018-11-23 07:41:02,652 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; [?] havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; [?] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~P_1_i~0;~P_1_st~0 := 0; [?] assume 1 == ~P_2_i~0;~P_2_st~0 := 0; [?] assume 1 == ~C_1_i~0;~C_1_st~0 := 0; [?] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; [?] assume !(1 == ~P_1_pc~0); [?] is_P_1_triggered_~__retres1~0 := 0; [?] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [?] activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; [?] assume !(0 != activate_threads_~tmp~1); [?] havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; [?] assume !(1 == ~P_2_pc~0); [?] is_P_2_triggered_~__retres1~1 := 0; [?] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [?] activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; [?] assume !(0 != activate_threads_~tmp___0~1); [?] havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; [?] assume !(1 == ~C_1_pc~0); [?] assume !(2 == ~C_1_pc~0); [?] is_C_1_triggered_~__retres1~2 := 0; [?] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [?] activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; [?] assume !(0 != activate_threads_~tmp___1~1); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294-L298] assume 1 == ~P_1_i~0; [L295] ~P_1_st~0 := 0; [L299-L303] assume 1 == ~P_2_i~0; [L300] ~P_2_st~0 := 0; [L304-L308] assume 1 == ~C_1_i~0; [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107-L116] assume !(1 == ~P_1_pc~0); [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] assume !(0 != activate_threads_~tmp~1); [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175-L184] assume !(1 == ~P_2_pc~0); [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] assume !(0 != activate_threads_~tmp___0~1); [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257-L266] assume !(1 == ~C_1_pc~0); [L267-L276] assume !(2 == ~C_1_pc~0); [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] assume !(0 != activate_threads_~tmp___1~1); [L537-L574] assume !false; [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294-L298] assume 1 == ~P_1_i~0; [L295] ~P_1_st~0 := 0; [L299-L303] assume 1 == ~P_2_i~0; [L300] ~P_2_st~0 := 0; [L304-L308] assume 1 == ~C_1_i~0; [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107-L116] assume !(1 == ~P_1_pc~0); [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] assume !(0 != activate_threads_~tmp~1); [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175-L184] assume !(1 == ~P_2_pc~0); [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] assume !(0 != activate_threads_~tmp___0~1); [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257-L266] assume !(1 == ~C_1_pc~0); [L267-L276] assume !(2 == ~C_1_pc~0); [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] assume !(0 != activate_threads_~tmp___1~1); [L537-L574] assume !false; [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] COND FALSE !(0 != activate_threads_~tmp~1) [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] COND FALSE !(0 != activate_threads_~tmp___0~1) [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] COND FALSE !(0 != activate_threads_~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] COND FALSE !(0 != activate_threads_~tmp~1) [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] COND FALSE !(0 != activate_threads_~tmp___0~1) [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] COND FALSE !(0 != activate_threads_~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [L593] havoc ~count~0; [L594] havoc ~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] ~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L523] havoc ~kernel_st~0; [L524] havoc ~tmp~3; [L525] havoc ~tmp___0~2; [L529] ~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L459] havoc ~tmp~1; [L460] havoc ~tmp___0~1; [L461] havoc ~tmp___1~1; [L104] havoc ~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] ~__retres1~0 := 0; [L119] #res := ~__retres1~0; [L465] ~tmp~1 := #t~ret5; [L465] havoc #t~ret5; [L467-L471] COND FALSE !(0 != ~tmp~1) [L172] havoc ~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] ~__retres1~1 := 0; [L187] #res := ~__retres1~1; [L473] ~tmp___0~1 := #t~ret6; [L473] havoc #t~ret6; [L475-L479] COND FALSE !(0 != ~tmp___0~1) [L254] havoc ~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] ~__retres1~2 := 0; [L279] #res := ~__retres1~2; [L481] ~tmp___1~1 := #t~ret7; [L481] havoc #t~ret7; [L483-L487] COND FALSE !(0 != ~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] ~kernel_st~0 := 1; [L339] havoc ~tmp~0; [L340] havoc ~tmp___0~0; [L341] havoc ~tmp___1~0; [L342] havoc ~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [L593] havoc ~count~0; [L594] havoc ~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] ~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L523] havoc ~kernel_st~0; [L524] havoc ~tmp~3; [L525] havoc ~tmp___0~2; [L529] ~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L459] havoc ~tmp~1; [L460] havoc ~tmp___0~1; [L461] havoc ~tmp___1~1; [L104] havoc ~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] ~__retres1~0 := 0; [L119] #res := ~__retres1~0; [L465] ~tmp~1 := #t~ret5; [L465] havoc #t~ret5; [L467-L471] COND FALSE !(0 != ~tmp~1) [L172] havoc ~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] ~__retres1~1 := 0; [L187] #res := ~__retres1~1; [L473] ~tmp___0~1 := #t~ret6; [L473] havoc #t~ret6; [L475-L479] COND FALSE !(0 != ~tmp___0~1) [L254] havoc ~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] ~__retres1~2 := 0; [L279] #res := ~__retres1~2; [L481] ~tmp___1~1 := #t~ret7; [L481] havoc #t~ret7; [L483-L487] COND FALSE !(0 != ~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] ~kernel_st~0 := 1; [L339] havoc ~tmp~0; [L340] havoc ~tmp___0~0; [L341] havoc ~tmp___1~0; [L342] havoc ~tmp___2~0; [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int P_2_pc ; [L123] int P_2_st ; [L124] int P_2_i ; [L125] int P_2_ev ; [L190] int C_1_pc ; [L191] int C_1_st ; [L192] int C_1_i ; [L193] int C_1_ev ; [L194] int C_1_pr ; [L593] int count ; [L594] int __retres2 ; [L598] num = 0 [L599] i = 0 [L600] max_loop = 2 [L602] timer = 0 [L603] P_1_pc = 0 [L604] P_2_pc = 0 [L605] C_1_pc = 0 [L607] count = 0 [L585] P_1_i = 1 [L586] P_2_i = 1 [L587] C_1_i = 1 [L523] int kernel_st ; [L524] int tmp ; [L525] int tmp___0 ; [L529] kernel_st = 0 [L294] COND TRUE (int )P_1_i == 1 [L295] P_1_st = 0 [L299] COND TRUE (int )P_2_i == 1 [L300] P_2_st = 0 [L304] COND TRUE (int )C_1_i == 1 [L305] C_1_st = 0 [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; [L104] int __retres1 ; [L107] COND FALSE !((int )P_1_pc == 1) [L117] __retres1 = 0 [L119] return (__retres1); [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) [L172] int __retres1 ; [L175] COND FALSE !((int )P_2_pc == 1) [L185] __retres1 = 0 [L187] return (__retres1); [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) [L254] int __retres1 ; [L257] COND FALSE !((int )C_1_pc == 1) [L267] COND FALSE !((int )C_1_pc == 2) [L277] __retres1 = 0 [L279] return (__retres1); [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE !(\read(tmp___1)) [L537] COND TRUE 1 [L540] kernel_st = 1 [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; [?] assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [?] eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; [?] assume 0 != eval_~tmp___2~0; [?] assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; [?] assume !(0 != eval_~tmp___0~0); [?] assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; [?] assume !(0 != eval_~tmp___1~0); [L346-L401] assume !false; [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317-L332] assume 0 == ~P_1_st~0; [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] assume 0 != eval_~tmp___2~0; [L356-L370] assume 0 == ~P_1_st~0; [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] assume !(0 != eval_~tmp~0); [L371-L385] assume 0 == ~P_2_st~0; [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] assume !(0 != eval_~tmp___0~0); [L386-L400] assume 0 == ~C_1_st~0; [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] assume !(0 != eval_~tmp___1~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L346-L401] assume !false; [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317-L332] assume 0 == ~P_1_st~0; [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] assume 0 != eval_~tmp___2~0; [L356-L370] assume 0 == ~P_1_st~0; [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] assume !(0 != eval_~tmp~0); [L371-L385] assume 0 == ~P_2_st~0; [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] assume !(0 != eval_~tmp___0~0); [L386-L400] assume 0 == ~C_1_st~0; [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] assume !(0 != eval_~tmp___1~0); [L346-L401] COND FALSE !(false) [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] COND TRUE 0 != eval_~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] COND FALSE !(0 != eval_~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] COND FALSE !(0 != eval_~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] COND FALSE !(0 != eval_~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L346-L401] COND FALSE !(false) [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] COND TRUE 0 != eval_~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] COND FALSE !(0 != eval_~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] COND FALSE !(0 != eval_~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] COND FALSE !(0 != eval_~tmp___1~0) [L346-L401] COND FALSE !(false) [L314] havoc ~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] ~__retres1~3 := 1; [L335] #res := ~__retres1~3; [L349] ~tmp___2~0 := #t~ret1; [L349] havoc #t~ret1; [L351-L355] COND TRUE 0 != ~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] ~tmp~0 := #t~nondet2; [L358] havoc #t~nondet2; [L360-L367] COND FALSE !(0 != ~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] ~tmp___0~0 := #t~nondet3; [L373] havoc #t~nondet3; [L375-L382] COND FALSE !(0 != ~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] ~tmp___1~0 := #t~nondet4; [L388] havoc #t~nondet4; [L390-L397] COND FALSE !(0 != ~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L346-L401] COND FALSE !(false) [L314] havoc ~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] ~__retres1~3 := 1; [L335] #res := ~__retres1~3; [L349] ~tmp___2~0 := #t~ret1; [L349] havoc #t~ret1; [L351-L355] COND TRUE 0 != ~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] ~tmp~0 := #t~nondet2; [L358] havoc #t~nondet2; [L360-L367] COND FALSE !(0 != ~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] ~tmp___0~0 := #t~nondet3; [L373] havoc #t~nondet3; [L375-L382] COND FALSE !(0 != ~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] ~tmp___1~0 := #t~nondet4; [L388] havoc #t~nondet4; [L390-L397] COND FALSE !(0 != ~tmp___1~0) [L346] COND TRUE 1 [L314] int __retres1 ; [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 [L335] return (__retres1); [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp)) [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND FALSE !(\read(tmp___0)) [L386] COND TRUE (int )C_1_st == 0 [L388] tmp___1 = __VERIFIER_nondet_int() [L390] COND FALSE !(\read(tmp___1)) ----- [2018-11-23 07:41:03,081 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3d8cd8de-2ce5-4f0c-9a9b-f2477816b082/bin-2019/uautomizer/witness.graphml [2018-11-23 07:41:03,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:41:03,082 INFO L168 Benchmark]: Toolchain (without parser) took 7422.85 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -152.9 MB). Peak memory consumption was 194.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:41:03,110 INFO L168 Benchmark]: CDTParser took 0.15 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 07:41:03,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:41:03,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -210.4 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:41:03,111 INFO L168 Benchmark]: Boogie Preprocessor took 28.60 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 07:41:03,111 INFO L168 Benchmark]: RCFGBuilder took 494.57 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2018-11-23 07:41:03,112 INFO L168 Benchmark]: BuchiAutomizer took 6170.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.6 MB). Peak memory consumption was 171.9 MB. Max. memory is 11.5 GB. [2018-11-23 07:41:03,112 INFO L168 Benchmark]: Witness Printer took 433.09 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2018-11-23 07:41:03,114 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.15 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 220.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -210.4 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.60 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 494.57 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: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6170.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.6 MB). Peak memory consumption was 171.9 MB. Max. memory is 11.5 GB. * Witness Printer took 433.09 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (14 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.14 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 4373 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 4.4s. Construction of modules took 0.6s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 4182 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 4373 states and ocurred in iteration 14. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3501 SDtfs, 4366 SDslu, 4736 SDs, 0 SdLazy, 305 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc3 concLT0 SILN1 SILU0 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 5ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 346]: 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 {count=0, \result=0, P_1_pc=0, C_1_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2465c77d=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41cc3037=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41bc0d60=0, data_0=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bbddcd=0, tmp___2=1, tmp___0=0, \result=0, i=0, P_1_i=1, e=0, P_2_pc=0, __retres1=0, tmp___0=0, num=0, P_1_ev=0, tmp=0, C_1_pc=0, P_2_st=0, P_2_i=1, \result=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2dc5f1e9=0, tmp___0=0, __retres1=0, tmp___1=0, data_1=0, __retres1=1, \result=0, max_loop=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73637d7f=0, tmp=0, C_1_pr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bc2af8f=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e04ca69=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26e562f6=0, C_1_ev=0, tmp___1=0, timer=0, __retres2=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 346]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; [?] havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; [?] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~P_1_i~0;~P_1_st~0 := 0; [?] assume 1 == ~P_2_i~0;~P_2_st~0 := 0; [?] assume 1 == ~C_1_i~0;~C_1_st~0 := 0; [?] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; [?] assume !(1 == ~P_1_pc~0); [?] is_P_1_triggered_~__retres1~0 := 0; [?] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [?] activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; [?] assume !(0 != activate_threads_~tmp~1); [?] havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; [?] assume !(1 == ~P_2_pc~0); [?] is_P_2_triggered_~__retres1~1 := 0; [?] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [?] activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; [?] assume !(0 != activate_threads_~tmp___0~1); [?] havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; [?] assume !(1 == ~C_1_pc~0); [?] assume !(2 == ~C_1_pc~0); [?] is_C_1_triggered_~__retres1~2 := 0; [?] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [?] activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; [?] assume !(0 != activate_threads_~tmp___1~1); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294-L298] assume 1 == ~P_1_i~0; [L295] ~P_1_st~0 := 0; [L299-L303] assume 1 == ~P_2_i~0; [L300] ~P_2_st~0 := 0; [L304-L308] assume 1 == ~C_1_i~0; [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107-L116] assume !(1 == ~P_1_pc~0); [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] assume !(0 != activate_threads_~tmp~1); [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175-L184] assume !(1 == ~P_2_pc~0); [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] assume !(0 != activate_threads_~tmp___0~1); [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257-L266] assume !(1 == ~C_1_pc~0); [L267-L276] assume !(2 == ~C_1_pc~0); [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] assume !(0 != activate_threads_~tmp___1~1); [L537-L574] assume !false; [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294-L298] assume 1 == ~P_1_i~0; [L295] ~P_1_st~0 := 0; [L299-L303] assume 1 == ~P_2_i~0; [L300] ~P_2_st~0 := 0; [L304-L308] assume 1 == ~C_1_i~0; [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107-L116] assume !(1 == ~P_1_pc~0); [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] assume !(0 != activate_threads_~tmp~1); [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175-L184] assume !(1 == ~P_2_pc~0); [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] assume !(0 != activate_threads_~tmp___0~1); [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257-L266] assume !(1 == ~C_1_pc~0); [L267-L276] assume !(2 == ~C_1_pc~0); [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] assume !(0 != activate_threads_~tmp___1~1); [L537-L574] assume !false; [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] COND FALSE !(0 != activate_threads_~tmp~1) [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] COND FALSE !(0 != activate_threads_~tmp___0~1) [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] COND FALSE !(0 != activate_threads_~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] COND FALSE !(0 != activate_threads_~tmp~1) [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] COND FALSE !(0 != activate_threads_~tmp___0~1) [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] COND FALSE !(0 != activate_threads_~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [L593] havoc ~count~0; [L594] havoc ~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] ~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L523] havoc ~kernel_st~0; [L524] havoc ~tmp~3; [L525] havoc ~tmp___0~2; [L529] ~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L459] havoc ~tmp~1; [L460] havoc ~tmp___0~1; [L461] havoc ~tmp___1~1; [L104] havoc ~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] ~__retres1~0 := 0; [L119] #res := ~__retres1~0; [L465] ~tmp~1 := #t~ret5; [L465] havoc #t~ret5; [L467-L471] COND FALSE !(0 != ~tmp~1) [L172] havoc ~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] ~__retres1~1 := 0; [L187] #res := ~__retres1~1; [L473] ~tmp___0~1 := #t~ret6; [L473] havoc #t~ret6; [L475-L479] COND FALSE !(0 != ~tmp___0~1) [L254] havoc ~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] ~__retres1~2 := 0; [L279] #res := ~__retres1~2; [L481] ~tmp___1~1 := #t~ret7; [L481] havoc #t~ret7; [L483-L487] COND FALSE !(0 != ~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] ~kernel_st~0 := 1; [L339] havoc ~tmp~0; [L340] havoc ~tmp___0~0; [L341] havoc ~tmp___1~0; [L342] havoc ~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [L593] havoc ~count~0; [L594] havoc ~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] ~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L523] havoc ~kernel_st~0; [L524] havoc ~tmp~3; [L525] havoc ~tmp___0~2; [L529] ~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L459] havoc ~tmp~1; [L460] havoc ~tmp___0~1; [L461] havoc ~tmp___1~1; [L104] havoc ~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] ~__retres1~0 := 0; [L119] #res := ~__retres1~0; [L465] ~tmp~1 := #t~ret5; [L465] havoc #t~ret5; [L467-L471] COND FALSE !(0 != ~tmp~1) [L172] havoc ~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] ~__retres1~1 := 0; [L187] #res := ~__retres1~1; [L473] ~tmp___0~1 := #t~ret6; [L473] havoc #t~ret6; [L475-L479] COND FALSE !(0 != ~tmp___0~1) [L254] havoc ~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] ~__retres1~2 := 0; [L279] #res := ~__retres1~2; [L481] ~tmp___1~1 := #t~ret7; [L481] havoc #t~ret7; [L483-L487] COND FALSE !(0 != ~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] ~kernel_st~0 := 1; [L339] havoc ~tmp~0; [L340] havoc ~tmp___0~0; [L341] havoc ~tmp___1~0; [L342] havoc ~tmp___2~0; [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int P_2_pc ; [L123] int P_2_st ; [L124] int P_2_i ; [L125] int P_2_ev ; [L190] int C_1_pc ; [L191] int C_1_st ; [L192] int C_1_i ; [L193] int C_1_ev ; [L194] int C_1_pr ; [L593] int count ; [L594] int __retres2 ; [L598] num = 0 [L599] i = 0 [L600] max_loop = 2 [L602] timer = 0 [L603] P_1_pc = 0 [L604] P_2_pc = 0 [L605] C_1_pc = 0 [L607] count = 0 [L585] P_1_i = 1 [L586] P_2_i = 1 [L587] C_1_i = 1 [L523] int kernel_st ; [L524] int tmp ; [L525] int tmp___0 ; [L529] kernel_st = 0 [L294] COND TRUE (int )P_1_i == 1 [L295] P_1_st = 0 [L299] COND TRUE (int )P_2_i == 1 [L300] P_2_st = 0 [L304] COND TRUE (int )C_1_i == 1 [L305] C_1_st = 0 [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; [L104] int __retres1 ; [L107] COND FALSE !((int )P_1_pc == 1) [L117] __retres1 = 0 [L119] return (__retres1); [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) [L172] int __retres1 ; [L175] COND FALSE !((int )P_2_pc == 1) [L185] __retres1 = 0 [L187] return (__retres1); [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) [L254] int __retres1 ; [L257] COND FALSE !((int )C_1_pc == 1) [L267] COND FALSE !((int )C_1_pc == 2) [L277] __retres1 = 0 [L279] return (__retres1); [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE !(\read(tmp___1)) [L537] COND TRUE 1 [L540] kernel_st = 1 [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; [?] assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [?] eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; [?] assume 0 != eval_~tmp___2~0; [?] assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; [?] assume !(0 != eval_~tmp___0~0); [?] assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; [?] assume !(0 != eval_~tmp___1~0); [L346-L401] assume !false; [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317-L332] assume 0 == ~P_1_st~0; [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] assume 0 != eval_~tmp___2~0; [L356-L370] assume 0 == ~P_1_st~0; [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] assume !(0 != eval_~tmp~0); [L371-L385] assume 0 == ~P_2_st~0; [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] assume !(0 != eval_~tmp___0~0); [L386-L400] assume 0 == ~C_1_st~0; [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] assume !(0 != eval_~tmp___1~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L346-L401] assume !false; [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317-L332] assume 0 == ~P_1_st~0; [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] assume 0 != eval_~tmp___2~0; [L356-L370] assume 0 == ~P_1_st~0; [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] assume !(0 != eval_~tmp~0); [L371-L385] assume 0 == ~P_2_st~0; [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] assume !(0 != eval_~tmp___0~0); [L386-L400] assume 0 == ~C_1_st~0; [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] assume !(0 != eval_~tmp___1~0); [L346-L401] COND FALSE !(false) [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] COND TRUE 0 != eval_~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] COND FALSE !(0 != eval_~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] COND FALSE !(0 != eval_~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] COND FALSE !(0 != eval_~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L346-L401] COND FALSE !(false) [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] COND TRUE 0 != eval_~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] COND FALSE !(0 != eval_~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] COND FALSE !(0 != eval_~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] COND FALSE !(0 != eval_~tmp___1~0) [L346-L401] COND FALSE !(false) [L314] havoc ~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] ~__retres1~3 := 1; [L335] #res := ~__retres1~3; [L349] ~tmp___2~0 := #t~ret1; [L349] havoc #t~ret1; [L351-L355] COND TRUE 0 != ~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] ~tmp~0 := #t~nondet2; [L358] havoc #t~nondet2; [L360-L367] COND FALSE !(0 != ~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] ~tmp___0~0 := #t~nondet3; [L373] havoc #t~nondet3; [L375-L382] COND FALSE !(0 != ~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] ~tmp___1~0 := #t~nondet4; [L388] havoc #t~nondet4; [L390-L397] COND FALSE !(0 != ~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L346-L401] COND FALSE !(false) [L314] havoc ~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] ~__retres1~3 := 1; [L335] #res := ~__retres1~3; [L349] ~tmp___2~0 := #t~ret1; [L349] havoc #t~ret1; [L351-L355] COND TRUE 0 != ~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] ~tmp~0 := #t~nondet2; [L358] havoc #t~nondet2; [L360-L367] COND FALSE !(0 != ~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] ~tmp___0~0 := #t~nondet3; [L373] havoc #t~nondet3; [L375-L382] COND FALSE !(0 != ~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] ~tmp___1~0 := #t~nondet4; [L388] havoc #t~nondet4; [L390-L397] COND FALSE !(0 != ~tmp___1~0) [L346] COND TRUE 1 [L314] int __retres1 ; [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 [L335] return (__retres1); [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp)) [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND FALSE !(\read(tmp___0)) [L386] COND TRUE (int )C_1_st == 0 [L388] tmp___1 = __VERIFIER_nondet_int() [L390] COND FALSE !(\read(tmp___1)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~max_loop~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; [?] havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; [?] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0; [?] assume 1 == ~P_1_i~0;~P_1_st~0 := 0; [?] assume 1 == ~P_2_i~0;~P_2_st~0 := 0; [?] assume 1 == ~C_1_i~0;~C_1_st~0 := 0; [?] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; [?] assume !(1 == ~P_1_pc~0); [?] is_P_1_triggered_~__retres1~0 := 0; [?] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [?] activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; [?] assume !(0 != activate_threads_~tmp~1); [?] havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; [?] assume !(1 == ~P_2_pc~0); [?] is_P_2_triggered_~__retres1~1 := 0; [?] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [?] activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; [?] assume !(0 != activate_threads_~tmp___0~1); [?] havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; [?] assume !(1 == ~C_1_pc~0); [?] assume !(2 == ~C_1_pc~0); [?] is_C_1_triggered_~__retres1~2 := 0; [?] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [?] activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; [?] assume !(0 != activate_threads_~tmp___1~1); [?] assume !false; [?] start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294-L298] assume 1 == ~P_1_i~0; [L295] ~P_1_st~0 := 0; [L299-L303] assume 1 == ~P_2_i~0; [L300] ~P_2_st~0 := 0; [L304-L308] assume 1 == ~C_1_i~0; [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107-L116] assume !(1 == ~P_1_pc~0); [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] assume !(0 != activate_threads_~tmp~1); [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175-L184] assume !(1 == ~P_2_pc~0); [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] assume !(0 != activate_threads_~tmp___0~1); [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257-L266] assume !(1 == ~C_1_pc~0); [L267-L276] assume !(2 == ~C_1_pc~0); [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] assume !(0 != activate_threads_~tmp___1~1); [L537-L574] assume !false; [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294-L298] assume 1 == ~P_1_i~0; [L295] ~P_1_st~0 := 0; [L299-L303] assume 1 == ~P_2_i~0; [L300] ~P_2_st~0 := 0; [L304-L308] assume 1 == ~C_1_i~0; [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107-L116] assume !(1 == ~P_1_pc~0); [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] assume !(0 != activate_threads_~tmp~1); [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175-L184] assume !(1 == ~P_2_pc~0); [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] assume !(0 != activate_threads_~tmp___0~1); [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257-L266] assume !(1 == ~C_1_pc~0); [L267-L276] assume !(2 == ~C_1_pc~0); [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] assume !(0 != activate_threads_~tmp___1~1); [L537-L574] assume !false; [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] COND FALSE !(0 != activate_threads_~tmp~1) [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] COND FALSE !(0 != activate_threads_~tmp___0~1) [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] COND FALSE !(0 != activate_threads_~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [?] havoc main_#res; [?] havoc main_~count~0, main_~__retres2~1; [L593] havoc main_~count~0; [L594] havoc main_~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] main_~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L609] havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2; [L523] havoc start_simulation_~kernel_st~0; [L524] havoc start_simulation_~tmp~3; [L525] havoc start_simulation_~tmp___0~2; [L529] start_simulation_~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L533] havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1; [L459] havoc activate_threads_~tmp~1; [L460] havoc activate_threads_~tmp___0~1; [L461] havoc activate_threads_~tmp___1~1; [L465] havoc is_P_1_triggered_#res; [L465] havoc is_P_1_triggered_~__retres1~0; [L104] havoc is_P_1_triggered_~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] is_P_1_triggered_~__retres1~0 := 0; [L119] is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; [L465] activate_threads_#t~ret5 := is_P_1_triggered_#res; [L465] activate_threads_~tmp~1 := activate_threads_#t~ret5; [L465] havoc activate_threads_#t~ret5; [L467-L471] COND FALSE !(0 != activate_threads_~tmp~1) [L473] havoc is_P_2_triggered_#res; [L473] havoc is_P_2_triggered_~__retres1~1; [L172] havoc is_P_2_triggered_~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] is_P_2_triggered_~__retres1~1 := 0; [L187] is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; [L473] activate_threads_#t~ret6 := is_P_2_triggered_#res; [L473] activate_threads_~tmp___0~1 := activate_threads_#t~ret6; [L473] havoc activate_threads_#t~ret6; [L475-L479] COND FALSE !(0 != activate_threads_~tmp___0~1) [L481] havoc is_C_1_triggered_#res; [L481] havoc is_C_1_triggered_~__retres1~2; [L254] havoc is_C_1_triggered_~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] is_C_1_triggered_~__retres1~2 := 0; [L279] is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; [L481] activate_threads_#t~ret7 := is_C_1_triggered_#res; [L481] activate_threads_~tmp___1~1 := activate_threads_#t~ret7; [L481] havoc activate_threads_#t~ret7; [L483-L487] COND FALSE !(0 != activate_threads_~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] start_simulation_~kernel_st~0 := 1; [L541] havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0; [L339] havoc eval_~tmp~0; [L340] havoc eval_~tmp___0~0; [L341] havoc eval_~tmp___1~0; [L342] havoc eval_~tmp___2~0; [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [L593] havoc ~count~0; [L594] havoc ~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] ~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L523] havoc ~kernel_st~0; [L524] havoc ~tmp~3; [L525] havoc ~tmp___0~2; [L529] ~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L459] havoc ~tmp~1; [L460] havoc ~tmp___0~1; [L461] havoc ~tmp___1~1; [L104] havoc ~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] ~__retres1~0 := 0; [L119] #res := ~__retres1~0; [L465] ~tmp~1 := #t~ret5; [L465] havoc #t~ret5; [L467-L471] COND FALSE !(0 != ~tmp~1) [L172] havoc ~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] ~__retres1~1 := 0; [L187] #res := ~__retres1~1; [L473] ~tmp___0~1 := #t~ret6; [L473] havoc #t~ret6; [L475-L479] COND FALSE !(0 != ~tmp___0~1) [L254] havoc ~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] ~__retres1~2 := 0; [L279] #res := ~__retres1~2; [L481] ~tmp___1~1 := #t~ret7; [L481] havoc #t~ret7; [L483-L487] COND FALSE !(0 != ~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] ~kernel_st~0 := 1; [L339] havoc ~tmp~0; [L340] havoc ~tmp___0~0; [L341] havoc ~tmp___1~0; [L342] havoc ~tmp___2~0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] ~max_loop~0 := 0; [L16] ~num~0 := 0; [L17] ~i~0 := 0; [L18] ~e~0 := 0; [L19] ~timer~0 := 0; [L20] ~data_0~0 := 0; [L21] ~data_1~0 := 0; [L64] ~P_1_pc~0 := 0; [L65] ~P_1_st~0 := 0; [L66] ~P_1_i~0 := 0; [L67] ~P_1_ev~0 := 0; [L122] ~P_2_pc~0 := 0; [L123] ~P_2_st~0 := 0; [L124] ~P_2_i~0 := 0; [L125] ~P_2_ev~0 := 0; [L190] ~C_1_pc~0 := 0; [L191] ~C_1_st~0 := 0; [L192] ~C_1_i~0 := 0; [L193] ~C_1_ev~0 := 0; [L194] ~C_1_pr~0 := 0; [L593] havoc ~count~0; [L594] havoc ~__retres2~1; [L598] ~num~0 := 0; [L599] ~i~0 := 0; [L600] ~max_loop~0 := 2; [L602] ~timer~0 := 0; [L603] ~P_1_pc~0 := 0; [L604] ~P_2_pc~0 := 0; [L605] ~C_1_pc~0 := 0; [L607] ~count~0 := 0; [L585] ~P_1_i~0 := 1; [L586] ~P_2_i~0 := 1; [L587] ~C_1_i~0 := 1; [L523] havoc ~kernel_st~0; [L524] havoc ~tmp~3; [L525] havoc ~tmp___0~2; [L529] ~kernel_st~0 := 0; [L294] COND TRUE 1 == ~P_1_i~0 [L295] ~P_1_st~0 := 0; [L299] COND TRUE 1 == ~P_2_i~0 [L300] ~P_2_st~0 := 0; [L304] COND TRUE 1 == ~C_1_i~0 [L305] ~C_1_st~0 := 0; [L459] havoc ~tmp~1; [L460] havoc ~tmp___0~1; [L461] havoc ~tmp___1~1; [L104] havoc ~__retres1~0; [L107] COND FALSE !(1 == ~P_1_pc~0) [L117] ~__retres1~0 := 0; [L119] #res := ~__retres1~0; [L465] ~tmp~1 := #t~ret5; [L465] havoc #t~ret5; [L467-L471] COND FALSE !(0 != ~tmp~1) [L172] havoc ~__retres1~1; [L175] COND FALSE !(1 == ~P_2_pc~0) [L185] ~__retres1~1 := 0; [L187] #res := ~__retres1~1; [L473] ~tmp___0~1 := #t~ret6; [L473] havoc #t~ret6; [L475-L479] COND FALSE !(0 != ~tmp___0~1) [L254] havoc ~__retres1~2; [L257] COND FALSE !(1 == ~C_1_pc~0) [L267] COND FALSE !(2 == ~C_1_pc~0) [L277] ~__retres1~2 := 0; [L279] #res := ~__retres1~2; [L481] ~tmp___1~1 := #t~ret7; [L481] havoc #t~ret7; [L483-L487] COND FALSE !(0 != ~tmp___1~1) [L537-L574] COND FALSE !(false) [L540] ~kernel_st~0 := 1; [L339] havoc ~tmp~0; [L340] havoc ~tmp___0~0; [L341] havoc ~tmp___1~0; [L342] havoc ~tmp___2~0; [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int P_2_pc ; [L123] int P_2_st ; [L124] int P_2_i ; [L125] int P_2_ev ; [L190] int C_1_pc ; [L191] int C_1_st ; [L192] int C_1_i ; [L193] int C_1_ev ; [L194] int C_1_pr ; [L593] int count ; [L594] int __retres2 ; [L598] num = 0 [L599] i = 0 [L600] max_loop = 2 [L602] timer = 0 [L603] P_1_pc = 0 [L604] P_2_pc = 0 [L605] C_1_pc = 0 [L607] count = 0 [L585] P_1_i = 1 [L586] P_2_i = 1 [L587] C_1_i = 1 [L523] int kernel_st ; [L524] int tmp ; [L525] int tmp___0 ; [L529] kernel_st = 0 [L294] COND TRUE (int )P_1_i == 1 [L295] P_1_st = 0 [L299] COND TRUE (int )P_2_i == 1 [L300] P_2_st = 0 [L304] COND TRUE (int )C_1_i == 1 [L305] C_1_st = 0 [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; [L104] int __retres1 ; [L107] COND FALSE !((int )P_1_pc == 1) [L117] __retres1 = 0 [L119] return (__retres1); [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) [L172] int __retres1 ; [L175] COND FALSE !((int )P_2_pc == 1) [L185] __retres1 = 0 [L187] return (__retres1); [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) [L254] int __retres1 ; [L257] COND FALSE !((int )C_1_pc == 1) [L267] COND FALSE !((int )C_1_pc == 2) [L277] __retres1 = 0 [L279] return (__retres1); [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE !(\read(tmp___1)) [L537] COND TRUE 1 [L540] kernel_st = 1 [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !false; [?] havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; [?] assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; [?] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [?] eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; [?] assume 0 != eval_~tmp___2~0; [?] assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; [?] assume !(0 != eval_~tmp~0); [?] assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; [?] assume !(0 != eval_~tmp___0~0); [?] assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; [?] assume !(0 != eval_~tmp___1~0); [L346-L401] assume !false; [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317-L332] assume 0 == ~P_1_st~0; [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] assume 0 != eval_~tmp___2~0; [L356-L370] assume 0 == ~P_1_st~0; [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] assume !(0 != eval_~tmp~0); [L371-L385] assume 0 == ~P_2_st~0; [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] assume !(0 != eval_~tmp___0~0); [L386-L400] assume 0 == ~C_1_st~0; [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] assume !(0 != eval_~tmp___1~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L346-L401] assume !false; [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317-L332] assume 0 == ~P_1_st~0; [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] assume 0 != eval_~tmp___2~0; [L356-L370] assume 0 == ~P_1_st~0; [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] assume !(0 != eval_~tmp~0); [L371-L385] assume 0 == ~P_2_st~0; [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] assume !(0 != eval_~tmp___0~0); [L386-L400] assume 0 == ~C_1_st~0; [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] assume !(0 != eval_~tmp___1~0); [L346-L401] COND FALSE !(false) [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] COND TRUE 0 != eval_~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] COND FALSE !(0 != eval_~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] COND FALSE !(0 != eval_~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] COND FALSE !(0 != eval_~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L346-L401] COND FALSE !(false) [L349] havoc exists_runnable_thread_#res; [L349] havoc exists_runnable_thread_~__retres1~3; [L314] havoc exists_runnable_thread_~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] exists_runnable_thread_~__retres1~3 := 1; [L335] exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; [L349] eval_#t~ret1 := exists_runnable_thread_#res; [L349] eval_~tmp___2~0 := eval_#t~ret1; [L349] havoc eval_#t~ret1; [L351-L355] COND TRUE 0 != eval_~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] eval_~tmp~0 := eval_#t~nondet2; [L358] havoc eval_#t~nondet2; [L360-L367] COND FALSE !(0 != eval_~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] eval_~tmp___0~0 := eval_#t~nondet3; [L373] havoc eval_#t~nondet3; [L375-L382] COND FALSE !(0 != eval_~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] eval_~tmp___1~0 := eval_#t~nondet4; [L388] havoc eval_#t~nondet4; [L390-L397] COND FALSE !(0 != eval_~tmp___1~0) [L346-L401] COND FALSE !(false) [L314] havoc ~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] ~__retres1~3 := 1; [L335] #res := ~__retres1~3; [L349] ~tmp___2~0 := #t~ret1; [L349] havoc #t~ret1; [L351-L355] COND TRUE 0 != ~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] ~tmp~0 := #t~nondet2; [L358] havoc #t~nondet2; [L360-L367] COND FALSE !(0 != ~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] ~tmp___0~0 := #t~nondet3; [L373] havoc #t~nondet3; [L375-L382] COND FALSE !(0 != ~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] ~tmp___1~0 := #t~nondet4; [L388] havoc #t~nondet4; [L390-L397] COND FALSE !(0 != ~tmp___1~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L346-L401] COND FALSE !(false) [L314] havoc ~__retres1~3; [L317] COND TRUE 0 == ~P_1_st~0 [L318] ~__retres1~3 := 1; [L335] #res := ~__retres1~3; [L349] ~tmp___2~0 := #t~ret1; [L349] havoc #t~ret1; [L351-L355] COND TRUE 0 != ~tmp___2~0 [L356] COND TRUE 0 == ~P_1_st~0 [L358] ~tmp~0 := #t~nondet2; [L358] havoc #t~nondet2; [L360-L367] COND FALSE !(0 != ~tmp~0) [L371] COND TRUE 0 == ~P_2_st~0 [L373] ~tmp___0~0 := #t~nondet3; [L373] havoc #t~nondet3; [L375-L382] COND FALSE !(0 != ~tmp___0~0) [L386] COND TRUE 0 == ~C_1_st~0 [L388] ~tmp___1~0 := #t~nondet4; [L388] havoc #t~nondet4; [L390-L397] COND FALSE !(0 != ~tmp___1~0) [L346] COND TRUE 1 [L314] int __retres1 ; [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 [L335] return (__retres1); [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp)) [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND FALSE !(\read(tmp___0)) [L386] COND TRUE (int )C_1_st == 0 [L388] tmp___1 = __VERIFIER_nondet_int() [L390] COND FALSE !(\read(tmp___1)) ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int P_2_pc ; [L123] int P_2_st ; [L124] int P_2_i ; [L125] int P_2_ev ; [L190] int C_1_pc ; [L191] int C_1_st ; [L192] int C_1_i ; [L193] int C_1_ev ; [L194] int C_1_pr ; [L593] int count ; [L594] int __retres2 ; [L598] num = 0 [L599] i = 0 [L600] max_loop = 2 [L602] timer = 0 [L603] P_1_pc = 0 [L604] P_2_pc = 0 [L605] C_1_pc = 0 [L607] count = 0 [L585] P_1_i = 1 [L586] P_2_i = 1 [L587] C_1_i = 1 [L523] int kernel_st ; [L524] int tmp ; [L525] int tmp___0 ; [L529] kernel_st = 0 [L294] COND TRUE (int )P_1_i == 1 [L295] P_1_st = 0 [L299] COND TRUE (int )P_2_i == 1 [L300] P_2_st = 0 [L304] COND TRUE (int )C_1_i == 1 [L305] C_1_st = 0 [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; [L104] int __retres1 ; [L107] COND FALSE !((int )P_1_pc == 1) [L117] __retres1 = 0 [L119] return (__retres1); [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) [L172] int __retres1 ; [L175] COND FALSE !((int )P_2_pc == 1) [L185] __retres1 = 0 [L187] return (__retres1); [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) [L254] int __retres1 ; [L257] COND FALSE !((int )C_1_pc == 1) [L267] COND FALSE !((int )C_1_pc == 2) [L277] __retres1 = 0 [L279] return (__retres1); [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE !(\read(tmp___1)) [L537] COND TRUE 1 [L540] kernel_st = 1 [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; Loop: [L346] COND TRUE 1 [L314] int __retres1 ; [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 [L335] return (__retres1); [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp)) [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND FALSE !(\read(tmp___0)) [L386] COND TRUE (int )C_1_st == 0 [L388] tmp___1 = __VERIFIER_nondet_int() [L390] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...