./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/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 59598ef74ac7afb6c962e2cc2ba26af488759b7c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-cad4683 [2019-10-22 08:56:40,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:40,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:40,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:40,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:40,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:40,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:40,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:40,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:40,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:40,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:40,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:40,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:40,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:40,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:40,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:40,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:40,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:40,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:40,408 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:40,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:40,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:40,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:40,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:40,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:40,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:40,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:40,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:40,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:40,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:40,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:40,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:40,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:40,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:40,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:40,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:40,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:40,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:40,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:40,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:40,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:40,420 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:56:40,431 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:40,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:40,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:40,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:40,432 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:40,433 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:40,433 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:40,433 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:40,433 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:40,433 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:40,433 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:40,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:40,434 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:56:40,434 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:40,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:40,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:56:40,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:40,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:40,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:40,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:40,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:56:40,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:40,435 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:40,436 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:40,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:40,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:40,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:40,436 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:40,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:40,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:40,437 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:40,437 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:40,438 INFO L138 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_b5fa7134-772d-464b-8310-ff38990ac215/bin/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 -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2019-10-22 08:56:40,460 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:40,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:40,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:40,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:40,474 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:40,474 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-10-22 08:56:40,529 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/data/5df38c4e6/03a294d806884e54a484e4f218672823/FLAGb9b4bd035 [2019-10-22 08:56:40,913 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:40,914 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-10-22 08:56:40,921 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/data/5df38c4e6/03a294d806884e54a484e4f218672823/FLAGb9b4bd035 [2019-10-22 08:56:40,933 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/data/5df38c4e6/03a294d806884e54a484e4f218672823 [2019-10-22 08:56:40,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:40,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:40,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:40,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:40,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:40,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:40" (1/1) ... [2019-10-22 08:56:40,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73fe9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:40, skipping insertion in model container [2019-10-22 08:56:40,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:40" (1/1) ... [2019-10-22 08:56:40,950 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:40,978 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:41,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:41,263 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:41,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:41,325 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:41,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:41 WrapperNode [2019-10-22 08:56:41,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:41,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:41,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:41,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:41,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:41" (1/1) ... [2019-10-22 08:56:41,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:41" (1/1) ... [2019-10-22 08:56:41,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:41,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:41,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:41,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:41,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:41" (1/1) ... [2019-10-22 08:56:41,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:41" (1/1) ... [2019-10-22 08:56:41,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:41" (1/1) ... [2019-10-22 08:56:41,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:41" (1/1) ... [2019-10-22 08:56:41,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:41" (1/1) ... [2019-10-22 08:56:41,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:41" (1/1) ... [2019-10-22 08:56:41,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:41" (1/1) ... [2019-10-22 08:56:41,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:41,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:41,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:41,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:41,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/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 [2019-10-22 08:56:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:41,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:41,894 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:41,894 INFO L284 CfgBuilder]: Removed 82 assume(true) statements. [2019-10-22 08:56:41,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:41 BoogieIcfgContainer [2019-10-22 08:56:41,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:41,896 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:41,896 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:41,900 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:41,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:41,901 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:40" (1/3) ... [2019-10-22 08:56:41,902 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39aa0112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:41, skipping insertion in model container [2019-10-22 08:56:41,902 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:41,902 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:41" (2/3) ... [2019-10-22 08:56:41,903 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39aa0112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:41, skipping insertion in model container [2019-10-22 08:56:41,903 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:41,903 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:41" (3/3) ... [2019-10-22 08:56:41,905 INFO L371 chiAutomizerObserver]: Analyzing ICFG token_ring.01.cil-2.c [2019-10-22 08:56:41,951 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:41,952 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:41,953 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:41,953 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:41,956 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:41,956 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:41,956 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:41,956 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:41,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states. [2019-10-22 08:56:42,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 115 [2019-10-22 08:56:42,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:42,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:42,024 INFO L849 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] [2019-10-22 08:56:42,024 INFO L850 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] [2019-10-22 08:56:42,024 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:42,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states. [2019-10-22 08:56:42,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 115 [2019-10-22 08:56:42,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:42,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:42,037 INFO L849 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] [2019-10-22 08:56:42,037 INFO L850 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] [2019-10-22 08:56:42,045 INFO L791 eck$LassoCheckResult]: Stem: 80#ULTIMATE.startENTRYtrue ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 9#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 103#L393true havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 75#L165true assume !(1 == ~m_i~0);~m_st~0 := 2; 25#L172-1true assume 1 == ~t1_i~0;~t1_st~0 := 0; 31#L177-1true assume !(0 == ~M_E~0); 115#L261-1true assume !(0 == ~T1_E~0); 129#L266-1true assume !(0 == ~E_M~0); 29#L271-1true assume !(0 == ~E_1~0); 33#L276-1true havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 98#L126true assume !(1 == ~m_pc~0); 92#L126-2true is_master_triggered_~__retres1~0 := 0; 99#L137true is_master_triggered_#res := is_master_triggered_~__retres1~0; 70#L138true activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5#L321true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 8#L321-2true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 122#L145true assume 1 == ~t1_pc~0; 61#L146true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 123#L156true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 63#L157true activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 10#L329true assume !(0 != activate_threads_~tmp___0~0); 15#L329-2true assume !(1 == ~M_E~0); 81#L289-1true assume !(1 == ~T1_E~0); 84#L294-1true assume !(1 == ~E_M~0); 11#L299-1true assume 1 == ~E_1~0;~E_1~0 := 2; 40#L430-1true [2019-10-22 08:56:42,046 INFO L793 eck$LassoCheckResult]: Loop: 40#L430-1true assume !false; 17#L431true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 138#L236true assume !true; 38#L251true start_simulation_~kernel_st~0 := 2; 82#L165-1true start_simulation_~kernel_st~0 := 3; 110#L261-2true assume 0 == ~M_E~0;~M_E~0 := 1; 107#L261-4true assume 0 == ~T1_E~0;~T1_E~0 := 1; 124#L266-3true assume 0 == ~E_M~0;~E_M~0 := 1; 27#L271-3true assume !(0 == ~E_1~0); 32#L276-3true havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 104#L126-9true assume 1 == ~m_pc~0; 42#L127-3true assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 89#L137-3true is_master_triggered_#res := is_master_triggered_~__retres1~0; 43#L138-3true activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 120#L321-9true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 125#L321-11true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 97#L145-9true assume 1 == ~t1_pc~0; 53#L146-3true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 147#L156-3true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 54#L157-3true activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 7#L329-9true assume !(0 != activate_threads_~tmp___0~0); 133#L329-11true assume 1 == ~M_E~0;~M_E~0 := 2; 67#L289-3true assume 1 == ~T1_E~0;~T1_E~0 := 2; 111#L294-3true assume 1 == ~E_M~0;~E_M~0 := 2; 126#L299-3true assume 1 == ~E_1~0;~E_1~0 := 2; 21#L304-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 64#L190-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 23#L202-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 131#L203-1true start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 62#L449true assume !(0 == start_simulation_~tmp~3); 65#L449-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, 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~2;havoc exists_runnable_thread_~__retres1~2; 60#L190-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 22#L202-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 101#L203-2true stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 102#L404true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 37#L411true stop_simulation_#res := stop_simulation_~__retres2~0; 141#L412true start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 87#L462true assume !(0 != start_simulation_~tmp___0~1); 40#L430-1true [2019-10-22 08:56:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:42,056 INFO L82 PathProgramCache]: Analyzing trace with hash 22332154, now seen corresponding path program 1 times [2019-10-22 08:56:42,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:42,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456866041] [2019-10-22 08:56:42,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:42,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456866041] [2019-10-22 08:56:42,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:42,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:42,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413570261] [2019-10-22 08:56:42,209 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:42,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:42,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1713125771, now seen corresponding path program 1 times [2019-10-22 08:56:42,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:42,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267573645] [2019-10-22 08:56:42,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:42,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267573645] [2019-10-22 08:56:42,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:42,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:42,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419568241] [2019-10-22 08:56:42,225 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:42,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:42,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:42,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:42,248 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2019-10-22 08:56:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:42,284 INFO L93 Difference]: Finished difference Result 146 states and 218 transitions. [2019-10-22 08:56:42,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:42,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 218 transitions. [2019-10-22 08:56:42,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 113 [2019-10-22 08:56:42,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 140 states and 212 transitions. [2019-10-22 08:56:42,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2019-10-22 08:56:42,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2019-10-22 08:56:42,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 212 transitions. [2019-10-22 08:56:42,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:42,300 INFO L688 BuchiCegarLoop]: Abstraction has 140 states and 212 transitions. [2019-10-22 08:56:42,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 212 transitions. [2019-10-22 08:56:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-10-22 08:56:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-22 08:56:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 212 transitions. [2019-10-22 08:56:42,330 INFO L711 BuchiCegarLoop]: Abstraction has 140 states and 212 transitions. [2019-10-22 08:56:42,330 INFO L591 BuchiCegarLoop]: Abstraction has 140 states and 212 transitions. [2019-10-22 08:56:42,331 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:42,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 212 transitions. [2019-10-22 08:56:42,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 113 [2019-10-22 08:56:42,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:42,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:42,334 INFO L849 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] [2019-10-22 08:56:42,334 INFO L850 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] [2019-10-22 08:56:42,335 INFO L791 eck$LassoCheckResult]: Stem: 416#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 311#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 312#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 414#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 336#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 337#L177-1 assume !(0 == ~M_E~0); 346#L261-1 assume !(0 == ~T1_E~0); 434#L266-1 assume !(0 == ~E_M~0); 343#L271-1 assume !(0 == ~E_1~0); 344#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 348#L126 assume !(1 == ~m_pc~0); 407#L126-2 is_master_triggered_~__retres1~0 := 0; 406#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 408#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 306#L321 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 307#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 310#L145 assume 1 == ~t1_pc~0; 399#L146 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 400#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 402#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 315#L329 assume !(0 != activate_threads_~tmp___0~0); 316#L329-2 assume !(1 == ~M_E~0); 321#L289-1 assume !(1 == ~T1_E~0); 417#L294-1 assume !(1 == ~E_M~0); 317#L299-1 assume 1 == ~E_1~0;~E_1~0 := 2; 318#L430-1 [2019-10-22 08:56:42,335 INFO L793 eck$LassoCheckResult]: Loop: 318#L430-1 assume !false; 323#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 324#L236 assume !false; 350#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 351#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 342#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 349#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 433#L217 assume !(0 != eval_~tmp~0); 358#L251 start_simulation_~kernel_st~0 := 2; 359#L165-1 start_simulation_~kernel_st~0 := 3; 418#L261-2 assume 0 == ~M_E~0;~M_E~0 := 1; 428#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 429#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 339#L271-3 assume !(0 == ~E_1~0); 340#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 347#L126-9 assume 1 == ~m_pc~0; 362#L127-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 363#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 365#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 366#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 437#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 425#L145-9 assume !(1 == ~t1_pc~0); 385#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 384#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 386#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 308#L329-9 assume !(0 != activate_threads_~tmp___0~0); 309#L329-11 assume 1 == ~M_E~0;~M_E~0 := 2; 403#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 404#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 432#L299-3 assume 1 == ~E_1~0;~E_1~0 := 2; 328#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 329#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 333#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 334#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 397#L449 assume !(0 == start_simulation_~tmp~3); 381#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, 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~2;havoc exists_runnable_thread_~__retres1~2; 395#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 331#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 332#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 426#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 353#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 354#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 421#L462 assume !(0 != start_simulation_~tmp___0~1); 318#L430-1 [2019-10-22 08:56:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash -196522564, now seen corresponding path program 1 times [2019-10-22 08:56:42,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:42,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970999132] [2019-10-22 08:56:42,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:42,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970999132] [2019-10-22 08:56:42,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:42,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:42,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340322944] [2019-10-22 08:56:42,381 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:42,381 INFO L82 PathProgramCache]: Analyzing trace with hash -747579981, now seen corresponding path program 1 times [2019-10-22 08:56:42,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:42,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329746607] [2019-10-22 08:56:42,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:42,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329746607] [2019-10-22 08:56:42,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:42,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:42,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779981036] [2019-10-22 08:56:42,424 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:42,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:42,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:42,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:42,425 INFO L87 Difference]: Start difference. First operand 140 states and 212 transitions. cyclomatic complexity: 73 Second operand 3 states. [2019-10-22 08:56:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:42,474 INFO L93 Difference]: Finished difference Result 234 states and 348 transitions. [2019-10-22 08:56:42,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:42,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 234 states and 348 transitions. [2019-10-22 08:56:42,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 206 [2019-10-22 08:56:42,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 234 states to 234 states and 348 transitions. [2019-10-22 08:56:42,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2019-10-22 08:56:42,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 234 [2019-10-22 08:56:42,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234 states and 348 transitions. [2019-10-22 08:56:42,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:42,482 INFO L688 BuchiCegarLoop]: Abstraction has 234 states and 348 transitions. [2019-10-22 08:56:42,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 348 transitions. [2019-10-22 08:56:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-10-22 08:56:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 08:56:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 346 transitions. [2019-10-22 08:56:42,504 INFO L711 BuchiCegarLoop]: Abstraction has 232 states and 346 transitions. [2019-10-22 08:56:42,504 INFO L591 BuchiCegarLoop]: Abstraction has 232 states and 346 transitions. [2019-10-22 08:56:42,505 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:42,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 346 transitions. [2019-10-22 08:56:42,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2019-10-22 08:56:42,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:42,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:42,507 INFO L849 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] [2019-10-22 08:56:42,508 INFO L850 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] [2019-10-22 08:56:42,508 INFO L791 eck$LassoCheckResult]: Stem: 800#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 694#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 695#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 798#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 719#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 720#L177-1 assume !(0 == ~M_E~0); 730#L261-1 assume !(0 == ~T1_E~0); 826#L266-1 assume !(0 == ~E_M~0); 726#L271-1 assume !(0 == ~E_1~0); 727#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 732#L126 assume !(1 == ~m_pc~0); 791#L126-2 is_master_triggered_~__retres1~0 := 0; 790#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 792#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 689#L321 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 690#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 693#L145 assume !(1 == ~t1_pc~0); 827#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 828#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 785#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 698#L329 assume !(0 != activate_threads_~tmp___0~0); 699#L329-2 assume !(1 == ~M_E~0); 704#L289-1 assume !(1 == ~T1_E~0); 801#L294-1 assume !(1 == ~E_M~0); 700#L299-1 assume 1 == ~E_1~0;~E_1~0 := 2; 701#L430-1 [2019-10-22 08:56:42,508 INFO L793 eck$LassoCheckResult]: Loop: 701#L430-1 assume !false; 706#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 707#L236 assume !false; 735#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 736#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 725#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 874#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 872#L217 assume !(0 != eval_~tmp~0); 740#L251 start_simulation_~kernel_st~0 := 2; 741#L165-1 start_simulation_~kernel_st~0 := 3; 802#L261-2 assume 0 == ~M_E~0;~M_E~0 := 1; 821#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 833#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 722#L271-3 assume !(0 == ~E_1~0); 723#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 731#L126-9 assume !(1 == ~m_pc~0); 858#L126-11 is_master_triggered_~__retres1~0 := 0; 856#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 854#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 851#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 834#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 812#L145-9 assume !(1 == ~t1_pc~0); 809#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 810#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 771#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 691#L329-9 assume !(0 != activate_threads_~tmp___0~0); 692#L329-11 assume 1 == ~M_E~0;~M_E~0 := 2; 787#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 788#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 822#L299-3 assume 1 == ~E_1~0;~E_1~0 := 2; 712#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 713#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 716#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 717#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 783#L449 assume !(0 == start_simulation_~tmp~3); 767#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, 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~2;havoc exists_runnable_thread_~__retres1~2; 909#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 907#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 906#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 905#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 738#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 739#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 805#L462 assume !(0 != start_simulation_~tmp___0~1); 701#L430-1 [2019-10-22 08:56:42,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:42,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1903125501, now seen corresponding path program 1 times [2019-10-22 08:56:42,509 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:42,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957461499] [2019-10-22 08:56:42,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,509 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:42,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957461499] [2019-10-22 08:56:42,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:42,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-10-22 08:56:42,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719512265] [2019-10-22 08:56:42,559 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:42,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:42,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1056018990, now seen corresponding path program 1 times [2019-10-22 08:56:42,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:42,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967317156] [2019-10-22 08:56:42,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:42,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967317156] [2019-10-22 08:56:42,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:42,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:42,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83365854] [2019-10-22 08:56:42,618 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:42,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:42,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:42,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:42,618 INFO L87 Difference]: Start difference. First operand 232 states and 346 transitions. cyclomatic complexity: 116 Second operand 3 states. [2019-10-22 08:56:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:42,670 INFO L93 Difference]: Finished difference Result 232 states and 335 transitions. [2019-10-22 08:56:42,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:42,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 335 transitions. [2019-10-22 08:56:42,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2019-10-22 08:56:42,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 232 states and 335 transitions. [2019-10-22 08:56:42,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2019-10-22 08:56:42,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 232 [2019-10-22 08:56:42,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 232 states and 335 transitions. [2019-10-22 08:56:42,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:42,682 INFO L688 BuchiCegarLoop]: Abstraction has 232 states and 335 transitions. [2019-10-22 08:56:42,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states and 335 transitions. [2019-10-22 08:56:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-10-22 08:56:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-22 08:56:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 335 transitions. [2019-10-22 08:56:42,694 INFO L711 BuchiCegarLoop]: Abstraction has 232 states and 335 transitions. [2019-10-22 08:56:42,694 INFO L591 BuchiCegarLoop]: Abstraction has 232 states and 335 transitions. [2019-10-22 08:56:42,694 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:42,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 335 transitions. [2019-10-22 08:56:42,699 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 204 [2019-10-22 08:56:42,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:42,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:42,701 INFO L849 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] [2019-10-22 08:56:42,701 INFO L850 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] [2019-10-22 08:56:42,701 INFO L791 eck$LassoCheckResult]: Stem: 1269#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 1167#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 1168#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 1267#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 1192#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1193#L177-1 assume !(0 == ~M_E~0); 1202#L261-1 assume !(0 == ~T1_E~0); 1294#L266-1 assume !(0 == ~E_M~0); 1199#L271-1 assume !(0 == ~E_1~0); 1200#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1204#L126 assume !(1 == ~m_pc~0); 1261#L126-2 is_master_triggered_~__retres1~0 := 0; 1260#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1262#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1162#L321 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1163#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1166#L145 assume !(1 == ~t1_pc~0); 1295#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 1296#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1256#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1171#L329 assume !(0 != activate_threads_~tmp___0~0); 1172#L329-2 assume !(1 == ~M_E~0); 1177#L289-1 assume !(1 == ~T1_E~0); 1270#L294-1 assume !(1 == ~E_M~0); 1173#L299-1 assume !(1 == ~E_1~0); 1174#L430-1 [2019-10-22 08:56:42,702 INFO L793 eck$LassoCheckResult]: Loop: 1174#L430-1 assume !false; 1371#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 1274#L236 assume !false; 1370#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1369#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1205#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1206#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 1303#L217 assume !(0 != eval_~tmp~0); 1329#L251 start_simulation_~kernel_st~0 := 2; 1328#L165-1 start_simulation_~kernel_st~0 := 3; 1327#L261-2 assume 0 == ~M_E~0;~M_E~0 := 1; 1326#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1325#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 1323#L271-3 assume !(0 == ~E_1~0); 1321#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1319#L126-9 assume !(1 == ~m_pc~0); 1317#L126-11 is_master_triggered_~__retres1~0 := 0; 1316#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1315#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1299#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1300#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1282#L145-9 assume !(1 == ~t1_pc~0); 1279#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 1280#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1243#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1164#L329-9 assume !(0 != activate_threads_~tmp___0~0); 1165#L329-11 assume 1 == ~M_E~0;~M_E~0 := 2; 1257#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1258#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 1290#L299-3 assume !(1 == ~E_1~0); 1184#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1185#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1189#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1190#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 1253#L449 assume !(0 == start_simulation_~tmp~3); 1254#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, 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~2;havoc exists_runnable_thread_~__retres1~2; 1379#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1377#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1376#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 1375#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1374#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 1373#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1372#L462 assume !(0 != start_simulation_~tmp___0~1); 1174#L430-1 [2019-10-22 08:56:42,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:42,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1903125503, now seen corresponding path program 1 times [2019-10-22 08:56:42,702 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:42,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083085757] [2019-10-22 08:56:42,702 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:42,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083085757] [2019-10-22 08:56:42,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:42,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:42,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043135100] [2019-10-22 08:56:42,824 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:42,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:42,825 INFO L82 PathProgramCache]: Analyzing trace with hash -2067136240, now seen corresponding path program 1 times [2019-10-22 08:56:42,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:42,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215223136] [2019-10-22 08:56:42,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:42,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215223136] [2019-10-22 08:56:42,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:42,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:42,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78846185] [2019-10-22 08:56:42,863 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:42,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:42,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:42,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:42,866 INFO L87 Difference]: Start difference. First operand 232 states and 335 transitions. cyclomatic complexity: 105 Second operand 5 states. [2019-10-22 08:56:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:43,034 INFO L93 Difference]: Finished difference Result 604 states and 857 transitions. [2019-10-22 08:56:43,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:43,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 604 states and 857 transitions. [2019-10-22 08:56:43,042 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 549 [2019-10-22 08:56:43,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 604 states to 604 states and 857 transitions. [2019-10-22 08:56:43,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 604 [2019-10-22 08:56:43,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 604 [2019-10-22 08:56:43,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 604 states and 857 transitions. [2019-10-22 08:56:43,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:43,055 INFO L688 BuchiCegarLoop]: Abstraction has 604 states and 857 transitions. [2019-10-22 08:56:43,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states and 857 transitions. [2019-10-22 08:56:43,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 256. [2019-10-22 08:56:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-22 08:56:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 359 transitions. [2019-10-22 08:56:43,077 INFO L711 BuchiCegarLoop]: Abstraction has 256 states and 359 transitions. [2019-10-22 08:56:43,077 INFO L591 BuchiCegarLoop]: Abstraction has 256 states and 359 transitions. [2019-10-22 08:56:43,077 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:56:43,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 256 states and 359 transitions. [2019-10-22 08:56:43,078 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 225 [2019-10-22 08:56:43,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:43,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:43,079 INFO L849 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] [2019-10-22 08:56:43,079 INFO L850 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] [2019-10-22 08:56:43,081 INFO L791 eck$LassoCheckResult]: Stem: 2126#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 2018#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 2019#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 2119#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 2043#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2044#L177-1 assume !(0 == ~M_E~0); 2053#L261-1 assume !(0 == ~T1_E~0); 2161#L266-1 assume !(0 == ~E_M~0); 2050#L271-1 assume !(0 == ~E_1~0); 2051#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2055#L126 assume !(1 == ~m_pc~0); 2112#L126-2 is_master_triggered_~__retres1~0 := 0; 2139#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2146#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2012#L321 assume !(0 != activate_threads_~tmp~1); 2013#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2017#L145 assume !(1 == ~t1_pc~0); 2162#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 2163#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2107#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2020#L329 assume !(0 != activate_threads_~tmp___0~0); 2021#L329-2 assume !(1 == ~M_E~0); 2028#L289-1 assume !(1 == ~T1_E~0); 2127#L294-1 assume !(1 == ~E_M~0); 2022#L299-1 assume !(1 == ~E_1~0); 2023#L430-1 [2019-10-22 08:56:43,081 INFO L793 eck$LassoCheckResult]: Loop: 2023#L430-1 assume !false; 2030#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 2031#L236 assume !false; 2057#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2058#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2049#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2056#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 2159#L217 assume !(0 != eval_~tmp~0); 2062#L251 start_simulation_~kernel_st~0 := 2; 2063#L165-1 start_simulation_~kernel_st~0 := 3; 2128#L261-2 assume 0 == ~M_E~0;~M_E~0 := 1; 2153#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2154#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 2046#L271-3 assume !(0 == ~E_1~0); 2047#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2054#L126-9 assume 1 == ~m_pc~0; 2069#L127-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 2070#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2137#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2232#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 2166#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2144#L145-9 assume !(1 == ~t1_pc~0); 2145#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 2179#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2180#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2015#L329-9 assume !(0 != activate_threads_~tmp___0~0); 2016#L329-11 assume 1 == ~M_E~0;~M_E~0 := 2; 2108#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2109#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 2157#L299-3 assume !(1 == ~E_1~0); 2221#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2213#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2210#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2208#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 2207#L449 assume !(0 == start_simulation_~tmp~3); 2089#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, 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~2;havoc exists_runnable_thread_~__retres1~2; 2103#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2038#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2039#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 2148#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2060#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 2061#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2131#L462 assume !(0 != start_simulation_~tmp___0~1); 2023#L430-1 [2019-10-22 08:56:43,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:43,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 1 times [2019-10-22 08:56:43,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:43,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59160295] [2019-10-22 08:56:43,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:43,129 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:43,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1758697231, now seen corresponding path program 1 times [2019-10-22 08:56:43,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:43,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058950215] [2019-10-22 08:56:43,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:43,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058950215] [2019-10-22 08:56:43,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:43,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:43,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512592516] [2019-10-22 08:56:43,188 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:43,188 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:43,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:43,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:43,188 INFO L87 Difference]: Start difference. First operand 256 states and 359 transitions. cyclomatic complexity: 105 Second operand 5 states. [2019-10-22 08:56:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:43,272 INFO L93 Difference]: Finished difference Result 432 states and 596 transitions. [2019-10-22 08:56:43,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:56:43,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 432 states and 596 transitions. [2019-10-22 08:56:43,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 399 [2019-10-22 08:56:43,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 432 states to 432 states and 596 transitions. [2019-10-22 08:56:43,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 432 [2019-10-22 08:56:43,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 432 [2019-10-22 08:56:43,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 432 states and 596 transitions. [2019-10-22 08:56:43,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:43,282 INFO L688 BuchiCegarLoop]: Abstraction has 432 states and 596 transitions. [2019-10-22 08:56:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states and 596 transitions. [2019-10-22 08:56:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 262. [2019-10-22 08:56:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-22 08:56:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 365 transitions. [2019-10-22 08:56:43,298 INFO L711 BuchiCegarLoop]: Abstraction has 262 states and 365 transitions. [2019-10-22 08:56:43,298 INFO L591 BuchiCegarLoop]: Abstraction has 262 states and 365 transitions. [2019-10-22 08:56:43,298 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:56:43,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 262 states and 365 transitions. [2019-10-22 08:56:43,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 231 [2019-10-22 08:56:43,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:43,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:43,302 INFO L849 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] [2019-10-22 08:56:43,302 INFO L850 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] [2019-10-22 08:56:43,303 INFO L791 eck$LassoCheckResult]: Stem: 2831#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 2722#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 2723#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 2826#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 2747#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2748#L177-1 assume !(0 == ~M_E~0); 2758#L261-1 assume !(0 == ~T1_E~0); 2861#L266-1 assume !(0 == ~E_M~0); 2755#L271-1 assume !(0 == ~E_1~0); 2756#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2760#L126 assume !(1 == ~m_pc~0); 2820#L126-2 is_master_triggered_~__retres1~0 := 0; 2841#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2821#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2716#L321 assume !(0 != activate_threads_~tmp~1); 2717#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2721#L145 assume !(1 == ~t1_pc~0); 2862#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 2863#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2814#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2724#L329 assume !(0 != activate_threads_~tmp___0~0); 2725#L329-2 assume !(1 == ~M_E~0); 2732#L289-1 assume !(1 == ~T1_E~0); 2832#L294-1 assume !(1 == ~E_M~0); 2726#L299-1 assume !(1 == ~E_1~0); 2727#L430-1 [2019-10-22 08:56:43,303 INFO L793 eck$LassoCheckResult]: Loop: 2727#L430-1 assume !false; 2734#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 2735#L236 assume !false; 2762#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2763#L190 assume !(0 == ~m_st~0); 2752#L194 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 2754#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2910#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 2909#L217 assume !(0 != eval_~tmp~0); 2767#L251 start_simulation_~kernel_st~0 := 2; 2768#L165-1 start_simulation_~kernel_st~0 := 3; 2833#L261-2 assume 0 == ~M_E~0;~M_E~0 := 1; 2852#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2853#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 2898#L271-3 assume !(0 == ~E_1~0); 2897#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2896#L126-9 assume 1 == ~m_pc~0; 2894#L127-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 2892#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2889#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2886#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 2869#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2844#L145-9 assume !(1 == ~t1_pc~0); 2845#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 2881#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2882#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2719#L329-9 assume !(0 != activate_threads_~tmp___0~0); 2720#L329-11 assume 1 == ~M_E~0;~M_E~0 := 2; 2816#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2817#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 2870#L299-3 assume !(1 == ~E_1~0); 2871#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2815#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2744#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2745#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 2811#L449 assume !(0 == start_simulation_~tmp~3); 2812#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, 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~2;havoc exists_runnable_thread_~__retres1~2; 2810#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2742#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2743#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 2847#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2961#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 2960#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2959#L462 assume !(0 != start_simulation_~tmp___0~1); 2727#L430-1 [2019-10-22 08:56:43,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:43,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 2 times [2019-10-22 08:56:43,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:43,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562977360] [2019-10-22 08:56:43,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:43,321 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:43,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:43,324 INFO L82 PathProgramCache]: Analyzing trace with hash 844256468, now seen corresponding path program 1 times [2019-10-22 08:56:43,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:43,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605063757] [2019-10-22 08:56:43,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:43,354 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:43,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:43,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1654840916, now seen corresponding path program 1 times [2019-10-22 08:56:43,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:43,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614158189] [2019-10-22 08:56:43,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:43,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:43,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614158189] [2019-10-22 08:56:43,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:43,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:43,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854745251] [2019-10-22 08:56:43,643 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-10-22 08:56:43,754 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:43,755 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:43,755 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:43,755 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:43,756 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:56:43,756 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:43,756 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:43,756 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:43,756 INFO L131 ssoRankerPreferences]: Filename of dumped script: token_ring.01.cil-2.c_Iteration6_Loop [2019-10-22 08:56:43,756 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:43,757 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:43,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:43,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,103 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:44,104 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/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 [2019-10-22 08:56:44,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:44,115 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,116 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret2=0} Honda state: {ULTIMATE.start_eval_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/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 [2019-10-22 08:56:44,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:44,124 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,124 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:44,141 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,141 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:44,148 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,148 INFO L440 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_b5fa7134-772d-464b-8310-ff38990ac215/bin/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 [2019-10-22 08:56:44,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:44,188 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,188 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~t1_pc~0=-8} Honda state: {~t1_pc~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:44,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,198 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:44,216 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,216 INFO L440 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_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:44,243 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,243 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:44,262 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,262 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~E_1~0=3} Honda state: {~E_1~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:44,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,284 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:44,287 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,288 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret7=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/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 [2019-10-22 08:56:44,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:44,308 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,309 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp~1=1, ULTIMATE.start_is_master_triggered_#res=1, ULTIMATE.start_is_master_triggered_~__retres1~0=1} Honda state: {ULTIMATE.start_activate_threads_~tmp~1=1, ULTIMATE.start_is_master_triggered_#res=1, ULTIMATE.start_is_master_triggered_~__retres1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:44,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,316 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:44,320 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,320 INFO L440 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_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:44,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,327 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:44,330 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,330 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret8=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:44,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,338 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:44,342 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,342 INFO L440 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_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:44,352 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,352 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:44,355 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,355 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_~__retres2~0=0} Honda state: {ULTIMATE.start_stop_simulation_~__retres2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:44,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,362 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:44,368 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,368 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_exists_runnable_thread_~__retres1~2=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Honda state: {ULTIMATE.start_exists_runnable_thread_~__retres1~2=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_b5fa7134-772d-464b-8310-ff38990ac215/bin/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 [2019-10-22 08:56:44,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:44,380 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,380 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~t1_st~0=-5} Honda state: {~t1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/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 [2019-10-22 08:56:44,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:56:44,392 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:56:44,392 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret6=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:44,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:56:44,400 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:56:44,413 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:56:44,413 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:44,429 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:56:44,431 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:44,431 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:44,431 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:44,431 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:44,431 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:44,432 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:44,432 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:44,432 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:44,432 INFO L131 ssoRankerPreferences]: Filename of dumped script: token_ring.01.cil-2.c_Iteration6_Loop [2019-10-22 08:56:44,432 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:44,432 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:44,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:44,758 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:44,764 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:44,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,768 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,769 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,769 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,771 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,777 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,778 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,778 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,781 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,782 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,782 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,782 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,782 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,789 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,789 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,790 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,791 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,795 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,795 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,795 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:56:44,795 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,796 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:56:44,797 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,799 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,800 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,800 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,802 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,802 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:56:44,802 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,802 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:56:44,802 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,807 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,808 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,808 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,808 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,809 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,812 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,812 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,812 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,812 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,812 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,813 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,813 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,816 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,817 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,817 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,817 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,817 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,817 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,819 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,819 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,826 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,828 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,831 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,831 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,831 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,831 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,831 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,831 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,835 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,837 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,837 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:56:44,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,837 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:56:44,837 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,839 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,839 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,839 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:56:44,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,842 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:56:44,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,848 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,848 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,848 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,850 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,851 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,851 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,853 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,853 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,854 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,854 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,855 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,855 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,855 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,856 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,857 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,858 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,858 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,858 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,859 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,859 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,859 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:44,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:44,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:44,863 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:44,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:44,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:44,863 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:44,864 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:44,864 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:44,865 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:44,867 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:56:44,867 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:56:44,868 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:44,869 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:56:44,869 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:44,869 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~M_E~0) = -1*~M_E~0 + 1 Supporting invariants [] [2019-10-22 08:56:44,871 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:56:44,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:44,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:44,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:44,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:44,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:44,963 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:56:44,964 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 262 states and 365 transitions. cyclomatic complexity: 105 Second operand 5 states. [2019-10-22 08:56:45,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 262 states and 365 transitions. cyclomatic complexity: 105. Second operand 5 states. Result 656 states and 924 transitions. Complement of second has 5 states. [2019-10-22 08:56:45,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:56:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2019-10-22 08:56:45,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 179 transitions. Stem has 25 letters. Loop has 44 letters. [2019-10-22 08:56:45,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:45,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 179 transitions. Stem has 69 letters. Loop has 44 letters. [2019-10-22 08:56:45,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:45,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 179 transitions. Stem has 25 letters. Loop has 88 letters. [2019-10-22 08:56:45,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:45,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 924 transitions. [2019-10-22 08:56:45,069 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 421 [2019-10-22 08:56:45,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 656 states and 924 transitions. [2019-10-22 08:56:45,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 455 [2019-10-22 08:56:45,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 460 [2019-10-22 08:56:45,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 656 states and 924 transitions. [2019-10-22 08:56:45,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:45,074 INFO L688 BuchiCegarLoop]: Abstraction has 656 states and 924 transitions. [2019-10-22 08:56:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states and 924 transitions. [2019-10-22 08:56:45,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 651. [2019-10-22 08:56:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-22 08:56:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 915 transitions. [2019-10-22 08:56:45,087 INFO L711 BuchiCegarLoop]: Abstraction has 651 states and 915 transitions. [2019-10-22 08:56:45,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:45,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:45,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:45,088 INFO L87 Difference]: Start difference. First operand 651 states and 915 transitions. Second operand 3 states. [2019-10-22 08:56:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:45,119 INFO L93 Difference]: Finished difference Result 1018 states and 1386 transitions. [2019-10-22 08:56:45,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:45,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1018 states and 1386 transitions. [2019-10-22 08:56:45,143 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 674 [2019-10-22 08:56:45,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1018 states to 1018 states and 1386 transitions. [2019-10-22 08:56:45,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 712 [2019-10-22 08:56:45,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 712 [2019-10-22 08:56:45,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1018 states and 1386 transitions. [2019-10-22 08:56:45,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:45,158 INFO L688 BuchiCegarLoop]: Abstraction has 1018 states and 1386 transitions. [2019-10-22 08:56:45,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states and 1386 transitions. [2019-10-22 08:56:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 973. [2019-10-22 08:56:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-10-22 08:56:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1329 transitions. [2019-10-22 08:56:45,175 INFO L711 BuchiCegarLoop]: Abstraction has 973 states and 1329 transitions. [2019-10-22 08:56:45,176 INFO L591 BuchiCegarLoop]: Abstraction has 973 states and 1329 transitions. [2019-10-22 08:56:45,176 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:56:45,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 973 states and 1329 transitions. [2019-10-22 08:56:45,180 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 644 [2019-10-22 08:56:45,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:45,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:45,182 INFO L849 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] [2019-10-22 08:56:45,185 INFO L850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:45,185 INFO L791 eck$LassoCheckResult]: Stem: 5743#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 5546#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 5547#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 5735#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 5590#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 5591#L177-1 assume !(0 == ~M_E~0); 5608#L261-1 assume !(0 == ~T1_E~0); 5803#L266-1 assume !(0 == ~E_M~0); 5605#L271-1 assume !(0 == ~E_1~0); 5606#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 5612#L126 assume !(1 == ~m_pc~0); 5728#L126-2 is_master_triggered_~__retres1~0 := 0; 5767#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 5773#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5537#L321 assume !(0 != activate_threads_~tmp~1); 5538#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5545#L145 assume !(1 == ~t1_pc~0); 5804#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 5805#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5715#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 5548#L329 assume !(0 != activate_threads_~tmp___0~0); 5549#L329-2 assume !(1 == ~M_E~0); 5558#L289-1 assume !(1 == ~T1_E~0); 5744#L294-1 assume !(1 == ~E_M~0); 5550#L299-1 assume !(1 == ~E_1~0); 5551#L430-1 assume !false; 5561#L431 [2019-10-22 08:56:45,185 INFO L793 eck$LassoCheckResult]: Loop: 5561#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 5562#L236 assume !false; 6481#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5720#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5721#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6475#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 5798#L217 assume 0 != eval_~tmp~0; 5788#L217-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 5789#L225 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1;havoc master_#t~nondet0, master_#t~nondet1, master_~tmp_var~0;master_~tmp_var~0 := master_#t~nondet0;havoc master_#t~nondet0; 5828#L34 assume 0 == ~m_pc~0; 5571#L70 assume !false; 5572#L46 ~token~0 := master_#t~nondet1;havoc master_#t~nondet1;~local~0 := ~token~0;~E_1~0 := 1;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 5756#L126-3 assume !(1 == ~m_pc~0); 5757#L126-5 is_master_triggered_~__retres1~0 := 0; 6495#L137-1 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6493#L138-1 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6491#L321-3 assume !(0 != activate_threads_~tmp~1); 6489#L321-5 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 6488#L145-3 assume !(1 == ~t1_pc~0); 5832#L145-5 is_transmit1_triggered_~__retres1~1 := 0; 5813#L156-1 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5705#L157-1 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 5559#L329-3 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 5529#L329-5 ~E_1~0 := 2;~m_pc~0 := 1;~m_st~0 := 2; 5530#L222 assume !(0 == ~t1_st~0); 5831#L236 assume !false; 5616#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5617#L190 assume !(0 == ~m_st~0); 5599#L194 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 5601#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6480#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 6479#L217 assume !(0 != eval_~tmp~0); 5626#L251 start_simulation_~kernel_st~0 := 2; 5627#L165-1 start_simulation_~kernel_st~0 := 3; 5745#L261-2 assume !(0 == ~M_E~0); 5792#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 6110#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 6108#L271-3 assume !(0 == ~E_1~0); 6106#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 6104#L126-9 assume 1 == ~m_pc~0; 6101#L127-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 6099#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6097#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6094#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 6092#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 6090#L145-9 assume !(1 == ~t1_pc~0); 6088#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 6086#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 6084#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 6082#L329-9 assume !(0 != activate_threads_~tmp___0~0); 6080#L329-11 assume !(1 == ~M_E~0); 6081#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 6072#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 6073#L299-3 assume !(1 == ~E_1~0); 6041#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5716#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5583#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5584#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 5710#L449 assume !(0 == start_simulation_~tmp~3); 5711#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, 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~2;havoc exists_runnable_thread_~__retres1~2; 5718#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5998#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6487#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 6486#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 6485#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 6484#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 6483#L462 assume !(0 != start_simulation_~tmp___0~1); 6482#L430-1 assume !false; 5561#L431 [2019-10-22 08:56:45,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,186 INFO L82 PathProgramCache]: Analyzing trace with hash -874485989, now seen corresponding path program 1 times [2019-10-22 08:56:45,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136127293] [2019-10-22 08:56:45,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,207 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:45,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,213 INFO L82 PathProgramCache]: Analyzing trace with hash 827320895, now seen corresponding path program 1 times [2019-10-22 08:56:45,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377040264] [2019-10-22 08:56:45,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:45,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377040264] [2019-10-22 08:56:45,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:45,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:56:45,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999357142] [2019-10-22 08:56:45,255 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:45,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:45,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:45,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:45,255 INFO L87 Difference]: Start difference. First operand 973 states and 1329 transitions. cyclomatic complexity: 362 Second operand 5 states. [2019-10-22 08:56:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:45,333 INFO L93 Difference]: Finished difference Result 1413 states and 1915 transitions. [2019-10-22 08:56:45,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:45,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1413 states and 1915 transitions. [2019-10-22 08:56:45,341 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 936 [2019-10-22 08:56:45,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1413 states to 1413 states and 1915 transitions. [2019-10-22 08:56:45,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 974 [2019-10-22 08:56:45,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 974 [2019-10-22 08:56:45,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1413 states and 1915 transitions. [2019-10-22 08:56:45,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:45,349 INFO L688 BuchiCegarLoop]: Abstraction has 1413 states and 1915 transitions. [2019-10-22 08:56:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states and 1915 transitions. [2019-10-22 08:56:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 982. [2019-10-22 08:56:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-10-22 08:56:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1312 transitions. [2019-10-22 08:56:45,363 INFO L711 BuchiCegarLoop]: Abstraction has 982 states and 1312 transitions. [2019-10-22 08:56:45,363 INFO L591 BuchiCegarLoop]: Abstraction has 982 states and 1312 transitions. [2019-10-22 08:56:45,364 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:56:45,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 982 states and 1312 transitions. [2019-10-22 08:56:45,368 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 650 [2019-10-22 08:56:45,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:45,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:45,369 INFO L849 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] [2019-10-22 08:56:45,369 INFO L850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:45,369 INFO L791 eck$LassoCheckResult]: Stem: 8145#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 7948#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 7949#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 8139#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 7990#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 7991#L177-1 assume !(0 == ~M_E~0); 8010#L261-1 assume !(0 == ~T1_E~0); 8207#L266-1 assume !(0 == ~E_M~0); 8006#L271-1 assume !(0 == ~E_1~0); 8007#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 8013#L126 assume !(1 == ~m_pc~0); 8132#L126-2 is_master_triggered_~__retres1~0 := 0; 8166#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8269#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 7937#L321 assume !(0 != activate_threads_~tmp~1); 7938#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 7947#L145 assume !(1 == ~t1_pc~0); 8208#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 8209#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8119#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 7950#L329 assume !(0 != activate_threads_~tmp___0~0); 7951#L329-2 assume !(1 == ~M_E~0); 7960#L289-1 assume !(1 == ~T1_E~0); 8146#L294-1 assume !(1 == ~E_M~0); 7952#L299-1 assume !(1 == ~E_1~0); 7953#L430-1 assume !false; 8385#L431 [2019-10-22 08:56:45,369 INFO L793 eck$LassoCheckResult]: Loop: 8385#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 8641#L236 assume !false; 8638#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8636#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 8548#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8633#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 8631#L217 assume 0 != eval_~tmp~0; 8630#L217-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 8565#L225 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1;havoc master_#t~nondet0, master_#t~nondet1, master_~tmp_var~0;master_~tmp_var~0 := master_#t~nondet0;havoc master_#t~nondet0; 8622#L34 assume 0 == ~m_pc~0; 8618#L70 assume !false; 8615#L46 ~token~0 := master_#t~nondet1;havoc master_#t~nondet1;~local~0 := ~token~0;~E_1~0 := 1;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 8611#L126-3 assume 1 == ~m_pc~0; 8605#L127-1 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 8601#L137-1 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8595#L138-1 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8591#L321-3 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 8588#L321-5 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 8263#L145-3 assume !(1 == ~t1_pc~0); 8264#L145-5 is_transmit1_triggered_~__retres1~1 := 0; 8581#L156-1 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8576#L157-1 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8570#L329-3 assume !(0 != activate_threads_~tmp___0~0); 8564#L329-5 ~E_1~0 := 2;~m_pc~0 := 1;~m_st~0 := 2; 8557#L222 assume !(0 == ~t1_st~0); 8552#L236 assume !false; 8550#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8547#L190 assume !(0 == ~m_st~0); 8543#L194 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 8540#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8538#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 8535#L217 assume !(0 != eval_~tmp~0); 8532#L251 start_simulation_~kernel_st~0 := 2; 8530#L165-1 start_simulation_~kernel_st~0 := 3; 8528#L261-2 assume !(0 == ~M_E~0); 8526#L261-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 8524#L266-3 assume 0 == ~E_M~0;~E_M~0 := 1; 8522#L271-3 assume !(0 == ~E_1~0); 8520#L276-3 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 8518#L126-9 assume 1 == ~m_pc~0; 8515#L127-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 8512#L137-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8510#L138-3 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8507#L321-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 8504#L321-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 8502#L145-9 assume !(1 == ~t1_pc~0); 8500#L145-11 is_transmit1_triggered_~__retres1~1 := 0; 8498#L156-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8496#L157-3 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8494#L329-9 assume !(0 != activate_threads_~tmp___0~0); 8492#L329-11 assume !(1 == ~M_E~0); 8486#L289-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 8487#L294-3 assume 1 == ~E_M~0;~E_M~0 := 2; 8478#L299-3 assume !(1 == ~E_1~0); 8479#L304-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8467#L190-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 8468#L202-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8453#L203-1 start_simulation_#t~ret8 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret8;havoc start_simulation_#t~ret8; 8454#L449 assume !(0 == start_simulation_~tmp~3); 8674#L449-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret7, 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~2;havoc exists_runnable_thread_~__retres1~2; 8672#L190-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 8600#L202-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8669#L203-2 stop_simulation_#t~ret7 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret7;havoc stop_simulation_#t~ret7; 8668#L404 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 8666#L411 stop_simulation_#res := stop_simulation_~__retres2~0; 8664#L412 start_simulation_#t~ret9 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 8662#L462 assume !(0 != start_simulation_~tmp___0~1); 8660#L430-1 assume !false; 8385#L431 [2019-10-22 08:56:45,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,370 INFO L82 PathProgramCache]: Analyzing trace with hash -874485989, now seen corresponding path program 2 times [2019-10-22 08:56:45,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109907754] [2019-10-22 08:56:45,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,379 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:45,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1209503008, now seen corresponding path program 1 times [2019-10-22 08:56:45,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393158247] [2019-10-22 08:56:45,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:45,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393158247] [2019-10-22 08:56:45,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:45,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:45,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334642193] [2019-10-22 08:56:45,402 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:45,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:45,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:45,402 INFO L87 Difference]: Start difference. First operand 982 states and 1312 transitions. cyclomatic complexity: 336 Second operand 3 states. [2019-10-22 08:56:45,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:45,429 INFO L93 Difference]: Finished difference Result 1160 states and 1516 transitions. [2019-10-22 08:56:45,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:45,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1160 states and 1516 transitions. [2019-10-22 08:56:45,435 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 752 [2019-10-22 08:56:45,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1160 states to 1160 states and 1516 transitions. [2019-10-22 08:56:45,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 791 [2019-10-22 08:56:45,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 791 [2019-10-22 08:56:45,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1160 states and 1516 transitions. [2019-10-22 08:56:45,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:45,441 INFO L688 BuchiCegarLoop]: Abstraction has 1160 states and 1516 transitions. [2019-10-22 08:56:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states and 1516 transitions. [2019-10-22 08:56:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1082. [2019-10-22 08:56:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2019-10-22 08:56:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1429 transitions. [2019-10-22 08:56:45,456 INFO L711 BuchiCegarLoop]: Abstraction has 1082 states and 1429 transitions. [2019-10-22 08:56:45,456 INFO L591 BuchiCegarLoop]: Abstraction has 1082 states and 1429 transitions. [2019-10-22 08:56:45,456 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:56:45,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1082 states and 1429 transitions. [2019-10-22 08:56:45,461 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 700 [2019-10-22 08:56:45,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:45,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:45,461 INFO L849 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] [2019-10-22 08:56:45,462 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:45,462 INFO L791 eck$LassoCheckResult]: Stem: 10283#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 10095#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 10096#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 10276#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 10140#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 10141#L177-1 assume !(0 == ~M_E~0); 10159#L261-1 assume !(0 == ~T1_E~0); 10349#L266-1 assume !(0 == ~E_M~0); 10156#L271-1 assume !(0 == ~E_1~0); 10157#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 10163#L126 assume !(1 == ~m_pc~0); 10308#L126-2 is_master_triggered_~__retres1~0 := 0; 10309#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 10271#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 10085#L321 assume !(0 != activate_threads_~tmp~1); 10086#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 10094#L145 assume !(1 == ~t1_pc~0); 10350#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 10351#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 10265#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 10097#L329 assume !(0 != activate_threads_~tmp___0~0); 10098#L329-2 assume !(1 == ~M_E~0); 10107#L289-1 assume !(1 == ~T1_E~0); 10284#L294-1 assume !(1 == ~E_M~0); 10099#L299-1 assume !(1 == ~E_1~0); 10100#L430-1 assume !false; 10442#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 10937#L236 [2019-10-22 08:56:45,463 INFO L793 eck$LassoCheckResult]: Loop: 10937#L236 assume !false; 10935#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10933#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 10932#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10930#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 10928#L217 assume 0 != eval_~tmp~0; 10926#L217-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 10924#L225 assume !(0 != eval_~tmp_ndt_1~0); 10925#L222 assume !(0 == ~t1_st~0); 10937#L236 [2019-10-22 08:56:45,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1339261757, now seen corresponding path program 1 times [2019-10-22 08:56:45,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597843102] [2019-10-22 08:56:45,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,472 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:45,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1331440565, now seen corresponding path program 1 times [2019-10-22 08:56:45,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351867885] [2019-10-22 08:56:45,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,482 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:45,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,484 INFO L82 PathProgramCache]: Analyzing trace with hash 610963913, now seen corresponding path program 1 times [2019-10-22 08:56:45,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62457676] [2019-10-22 08:56:45,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:45,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62457676] [2019-10-22 08:56:45,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:45,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:45,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356852790] [2019-10-22 08:56:45,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:45,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:45,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:45,545 INFO L87 Difference]: Start difference. First operand 1082 states and 1429 transitions. cyclomatic complexity: 357 Second operand 3 states. [2019-10-22 08:56:45,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:45,569 INFO L93 Difference]: Finished difference Result 1619 states and 2100 transitions. [2019-10-22 08:56:45,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:45,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1619 states and 2100 transitions. [2019-10-22 08:56:45,578 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 980 [2019-10-22 08:56:45,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1619 states to 1619 states and 2100 transitions. [2019-10-22 08:56:45,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1119 [2019-10-22 08:56:45,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1119 [2019-10-22 08:56:45,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1619 states and 2100 transitions. [2019-10-22 08:56:45,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:45,588 INFO L688 BuchiCegarLoop]: Abstraction has 1619 states and 2100 transitions. [2019-10-22 08:56:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states and 2100 transitions. [2019-10-22 08:56:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1619. [2019-10-22 08:56:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1619 states. [2019-10-22 08:56:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2100 transitions. [2019-10-22 08:56:45,613 INFO L711 BuchiCegarLoop]: Abstraction has 1619 states and 2100 transitions. [2019-10-22 08:56:45,613 INFO L591 BuchiCegarLoop]: Abstraction has 1619 states and 2100 transitions. [2019-10-22 08:56:45,613 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:56:45,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1619 states and 2100 transitions. [2019-10-22 08:56:45,620 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 980 [2019-10-22 08:56:45,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:45,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:45,620 INFO L849 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] [2019-10-22 08:56:45,622 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:45,622 INFO L791 eck$LassoCheckResult]: Stem: 12992#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 12803#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 12804#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 12986#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 12848#L172-1 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 12849#L177-1 assume !(0 == ~M_E~0); 13486#L261-1 assume !(0 == ~T1_E~0); 13485#L266-1 assume !(0 == ~E_M~0); 13484#L271-1 assume !(0 == ~E_1~0); 13483#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 13482#L126 assume !(1 == ~m_pc~0); 13481#L126-2 is_master_triggered_~__retres1~0 := 0; 13480#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 13479#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 13478#L321 assume !(0 != activate_threads_~tmp~1); 13477#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 13476#L145 assume !(1 == ~t1_pc~0); 13475#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 13474#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 13473#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 13472#L329 assume !(0 != activate_threads_~tmp___0~0); 13471#L329-2 assume !(1 == ~M_E~0); 13470#L289-1 assume !(1 == ~T1_E~0); 13469#L294-1 assume !(1 == ~E_M~0); 13468#L299-1 assume !(1 == ~E_1~0); 13466#L430-1 assume !false; 13467#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 13666#L236 [2019-10-22 08:56:45,622 INFO L793 eck$LassoCheckResult]: Loop: 13666#L236 assume !false; 13663#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13660#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 13658#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13655#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 13651#L217 assume 0 != eval_~tmp~0; 13648#L217-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 13643#L225 assume !(0 != eval_~tmp_ndt_1~0); 13644#L222 assume !(0 == ~t1_st~0); 13666#L236 [2019-10-22 08:56:45,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1150267205, now seen corresponding path program 1 times [2019-10-22 08:56:45,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157449752] [2019-10-22 08:56:45,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:45,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157449752] [2019-10-22 08:56:45,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:45,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:45,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557578620] [2019-10-22 08:56:45,635 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:45,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1331440565, now seen corresponding path program 2 times [2019-10-22 08:56:45,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213245917] [2019-10-22 08:56:45,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,646 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:45,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:45,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:45,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:45,680 INFO L87 Difference]: Start difference. First operand 1619 states and 2100 transitions. cyclomatic complexity: 496 Second operand 3 states. [2019-10-22 08:56:45,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:45,686 INFO L93 Difference]: Finished difference Result 1037 states and 1346 transitions. [2019-10-22 08:56:45,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:45,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1037 states and 1346 transitions. [2019-10-22 08:56:45,692 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 652 [2019-10-22 08:56:45,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1037 states to 1037 states and 1346 transitions. [2019-10-22 08:56:45,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 688 [2019-10-22 08:56:45,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 688 [2019-10-22 08:56:45,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1037 states and 1346 transitions. [2019-10-22 08:56:45,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:45,699 INFO L688 BuchiCegarLoop]: Abstraction has 1037 states and 1346 transitions. [2019-10-22 08:56:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states and 1346 transitions. [2019-10-22 08:56:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2019-10-22 08:56:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-10-22 08:56:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1346 transitions. [2019-10-22 08:56:45,713 INFO L711 BuchiCegarLoop]: Abstraction has 1037 states and 1346 transitions. [2019-10-22 08:56:45,713 INFO L591 BuchiCegarLoop]: Abstraction has 1037 states and 1346 transitions. [2019-10-22 08:56:45,713 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:56:45,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1037 states and 1346 transitions. [2019-10-22 08:56:45,717 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 652 [2019-10-22 08:56:45,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:45,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:45,718 INFO L849 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] [2019-10-22 08:56:45,718 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:45,718 INFO L791 eck$LassoCheckResult]: Stem: 15655#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 15466#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 15467#L393 havoc start_simulation_#t~ret8, start_simulation_#t~ret9, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 15649#L165 assume 1 == ~m_i~0;~m_st~0 := 0; 15510#L172-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 15511#L177-1 assume !(0 == ~M_E~0); 15528#L261-1 assume !(0 == ~T1_E~0); 15713#L266-1 assume !(0 == ~E_M~0); 15525#L271-1 assume !(0 == ~E_1~0); 15526#L276-1 havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 15532#L126 assume !(1 == ~m_pc~0); 15673#L126-2 is_master_triggered_~__retres1~0 := 0; 15674#L137 is_master_triggered_#res := is_master_triggered_~__retres1~0; 15644#L138 activate_threads_#t~ret5 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 15456#L321 assume !(0 != activate_threads_~tmp~1); 15457#L321-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 15465#L145 assume !(1 == ~t1_pc~0); 15714#L145-2 is_transmit1_triggered_~__retres1~1 := 0; 15715#L156 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 15636#L157 activate_threads_#t~ret6 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 15468#L329 assume !(0 != activate_threads_~tmp___0~0); 15469#L329-2 assume !(1 == ~M_E~0); 15478#L289-1 assume !(1 == ~T1_E~0); 15656#L294-1 assume !(1 == ~E_M~0); 15470#L299-1 assume !(1 == ~E_1~0); 15471#L430-1 assume !false; 15481#L431 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret2, eval_#t~nondet3, eval_~tmp_ndt_1~0, eval_#t~nondet4, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 15482#L236 [2019-10-22 08:56:45,718 INFO L793 eck$LassoCheckResult]: Loop: 15482#L236 assume !false; 16474#L213 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 16473#L190 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 16471#L202 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 16469#L203 eval_#t~ret2 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret2;havoc eval_#t~ret2; 16468#L217 assume 0 != eval_~tmp~0; 16467#L217-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 16464#L225 assume !(0 != eval_~tmp_ndt_1~0); 16465#L222 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet4;havoc eval_#t~nondet4; 16475#L239 assume !(0 != eval_~tmp_ndt_2~0); 15482#L236 [2019-10-22 08:56:45,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1339261757, now seen corresponding path program 2 times [2019-10-22 08:56:45,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165165766] [2019-10-22 08:56:45,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,728 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:45,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1675013239, now seen corresponding path program 1 times [2019-10-22 08:56:45,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641877261] [2019-10-22 08:56:45,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,738 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:45,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1760009913, now seen corresponding path program 1 times [2019-10-22 08:56:45,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:45,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898930098] [2019-10-22 08:56:45,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:45,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:45,758 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:45,921 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-10-22 08:56:45,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:56:45 BoogieIcfgContainer [2019-10-22 08:56:45,989 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:56:45,989 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:45,989 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:45,989 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:45,990 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:41" (3/4) ... [2019-10-22 08:56:45,993 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 08:56:46,054 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b5fa7134-772d-464b-8310-ff38990ac215/bin/uautomizer/witness.graphml [2019-10-22 08:56:46,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:46,058 INFO L168 Benchmark]: Toolchain (without parser) took 5121.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 941.0 MB in the beginning and 1.0 GB in the end (delta: -59.0 MB). Peak memory consumption was 153.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:46,059 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:46,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 941.0 MB in the beginning and 1.2 GB in the end (delta: -219.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:46,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:46,060 INFO L168 Benchmark]: Boogie Preprocessor took 30.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:46,060 INFO L168 Benchmark]: RCFGBuilder took 488.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:46,060 INFO L168 Benchmark]: BuchiAutomizer took 4092.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.9 MB). Peak memory consumption was 149.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:46,062 INFO L168 Benchmark]: Witness Printer took 68.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:46,064 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 941.0 MB in the beginning and 1.2 GB in the end (delta: -219.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 488.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4092.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 101.9 MB). Peak memory consumption was 149.1 MB. Max. memory is 11.5 GB. * Witness Printer took 68.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 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 11 terminating modules (10 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * M_E + 1 and consists of 3 locations. 10 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1037 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 1079 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1619 states and ocurred in iteration 9. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2359 SDtfs, 2447 SDslu, 2661 SDs, 0 SdLazy, 237 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT1 SILN1 SILU0 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 212]: 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 {\result=0, token=0, __retres1=0, tmp=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@78d62eb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3700847e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7378d7e3=0, kernel_st=1, __retres1=0, tmp___0=0, t1_pc=0, __retres1=1, T1_E=2, \result=0, E_1=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@451875c9=0, tmp_ndt_1=0, M_E=2, tmp_ndt_2=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2548a261=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@251c24d3=0, m_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4cf2db05=0, t1_st=0, local=0, m_st=0, E_M=2, tmp___0=0, tmp=0, __retres1=0, t1_i=1, m_pc=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 212]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; [L475] int __retres1 ; [L390] m_i = 1 [L391] t1_i = 1 [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 [L172] COND TRUE m_i == 1 [L173] m_st = 0 [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 [L261] COND FALSE !(M_E == 0) [L266] COND FALSE !(T1_E == 0) [L271] COND FALSE !(E_M == 0) [L276] COND FALSE !(E_1 == 0) [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; [L126] COND FALSE !(m_pc == 1) [L136] __retres1 = 0 [L138] return (__retres1); [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) [L142] int __retres1 ; [L145] COND FALSE !(t1_pc == 1) [L155] __retres1 = 0 [L157] return (__retres1); [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) [L289] COND FALSE !(M_E == 1) [L294] COND FALSE !(T1_E == 1) [L299] COND FALSE !(E_M == 1) [L304] COND FALSE !(E_1 == 1) [L430] COND TRUE 1 [L433] kernel_st = 1 [L208] int tmp ; Loop: [L212] COND TRUE 1 [L187] int __retres1 ; [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 [L203] return (__retres1); [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND FALSE !(\read(tmp_ndt_2)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...