./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/transmitter.04.cil.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/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/transmitter.04.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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 bcbeb24241e70d50816527d1472e428919d63db5 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-11-15 23:58:51,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:58:51,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:58:51,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:58:51,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:58:51,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:58:51,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:58:51,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:58:51,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:58:51,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:58:51,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:58:51,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:58:51,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:58:51,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:58:51,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:58:51,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:58:51,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:58:51,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:58:51,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:58:51,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:58:51,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:58:51,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:58:51,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:58:51,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:58:51,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:58:51,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:58:51,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:58:51,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:58:51,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:58:51,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:58:51,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:58:51,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:58:51,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:58:51,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:58:51,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:58:51,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:58:51,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:58:51,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:58:51,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:58:51,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:58:51,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:58:51,763 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 23:58:51,789 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:58:51,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:58:51,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:58:51,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:58:51,801 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:58:51,801 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:58:51,801 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:58:51,801 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:58:51,802 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:58:51,802 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:58:51,802 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:58:51,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:58:51,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:58:51,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:58:51,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:58:51,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:58:51,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:58:51,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:58:51,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:58:51,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:58:51,805 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:58:51,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:58:51,806 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:58:51,806 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:58:51,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:58:51,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:58:51,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:58:51,807 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:58:51,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:58:51,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:58:51,808 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:58:51,809 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:58:51,810 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/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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 -> bcbeb24241e70d50816527d1472e428919d63db5 [2019-11-15 23:58:51,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:58:51,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:58:51,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:58:51,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:58:51,850 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:58:51,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/bin/uautomizer/../../sv-benchmarks/c/systemc/transmitter.04.cil.c [2019-11-15 23:58:51,901 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/bin/uautomizer/data/65a478cd3/e1c112a8a7e1413c8e61462628d892be/FLAG641d826c5 [2019-11-15 23:58:52,307 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:58:52,308 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/sv-benchmarks/c/systemc/transmitter.04.cil.c [2019-11-15 23:58:52,318 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/bin/uautomizer/data/65a478cd3/e1c112a8a7e1413c8e61462628d892be/FLAG641d826c5 [2019-11-15 23:58:52,331 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/bin/uautomizer/data/65a478cd3/e1c112a8a7e1413c8e61462628d892be [2019-11-15 23:58:52,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:58:52,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:58:52,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:58:52,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:58:52,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:58:52,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:58:52" (1/1) ... [2019-11-15 23:58:52,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eaea65a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:52, skipping insertion in model container [2019-11-15 23:58:52,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:58:52" (1/1) ... [2019-11-15 23:58:52,349 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:58:52,382 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:58:52,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:58:52,658 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:58:52,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:58:52,732 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:58:52,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:52 WrapperNode [2019-11-15 23:58:52,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:58:52,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:58:52,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:58:52,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:58:52,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:52" (1/1) ... [2019-11-15 23:58:52,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:52" (1/1) ... [2019-11-15 23:58:52,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:58:52,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:58:52,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:58:52,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:58:52,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:52" (1/1) ... [2019-11-15 23:58:52,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:52" (1/1) ... [2019-11-15 23:58:52,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:52" (1/1) ... [2019-11-15 23:58:52,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:52" (1/1) ... [2019-11-15 23:58:52,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:52" (1/1) ... [2019-11-15 23:58:52,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:52" (1/1) ... [2019-11-15 23:58:52,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:52" (1/1) ... [2019-11-15 23:58:52,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:58:52,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:58:52,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:58:52,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:58:52,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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-11-15 23:58:52,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:58:52,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:58:54,060 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:58:54,060 INFO L284 CfgBuilder]: Removed 148 assume(true) statements. [2019-11-15 23:58:54,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:58:54 BoogieIcfgContainer [2019-11-15 23:58:54,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:58:54,062 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:58:54,062 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:58:54,065 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:58:54,066 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:58:54,066 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:58:52" (1/3) ... [2019-11-15 23:58:54,067 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f3788cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:58:54, skipping insertion in model container [2019-11-15 23:58:54,068 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:58:54,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:52" (2/3) ... [2019-11-15 23:58:54,068 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f3788cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:58:54, skipping insertion in model container [2019-11-15 23:58:54,068 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:58:54,069 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:58:54" (3/3) ... [2019-11-15 23:58:54,070 INFO L371 chiAutomizerObserver]: Analyzing ICFG transmitter.04.cil.c [2019-11-15 23:58:54,107 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:58:54,108 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:58:54,108 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:58:54,108 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:58:54,108 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:58:54,108 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:58:54,109 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:58:54,109 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:58:54,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states. [2019-11-15 23:58:54,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2019-11-15 23:58:54,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:54,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:54,183 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, 1, 1, 1, 1, 1, 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-11-15 23:58:54,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:54,184 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:58:54,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states. [2019-11-15 23:58:54,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 308 [2019-11-15 23:58:54,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:54,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:54,202 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, 1, 1, 1, 1, 1, 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-11-15 23:58:54,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:54,208 INFO L791 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRYtrue ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 17#L-1true havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 301#L729true havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 162#L324true assume !(1 == ~m_i~0);~m_st~0 := 2; 256#L331-1true assume 1 == ~t1_i~0;~t1_st~0 := 0; 101#L336-1true assume !(1 == ~t2_i~0);~t2_st~0 := 2; 122#L341-1true assume !(1 == ~t3_i~0);~t3_st~0 := 2; 165#L346-1true assume !(1 == ~t4_i~0);~t4_st~0 := 2; 19#L351-1true assume !(0 == ~M_E~0); 357#L492-1true assume !(0 == ~T1_E~0); 214#L497-1true assume !(0 == ~T2_E~0); 243#L502-1true assume !(0 == ~T3_E~0); 259#L507-1true assume 0 == ~T4_E~0;~T4_E~0 := 1; 121#L512-1true assume !(0 == ~E_1~0); 134#L517-1true assume !(0 == ~E_2~0); 176#L522-1true assume !(0 == ~E_3~0); 32#L527-1true assume !(0 == ~E_4~0); 51#L532-1true havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 340#L228true assume !(1 == ~m_pc~0); 329#L228-2true is_master_triggered_~__retres1~0 := 0; 299#L239true is_master_triggered_#res := is_master_triggered_~__retres1~0; 58#L240true activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 154#L605true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 157#L605-2true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 189#L247true assume 1 == ~t1_pc~0; 96#L248true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 190#L258true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 98#L259true activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 373#L613true assume !(0 != activate_threads_~tmp___0~0); 346#L613-2true havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 207#L266true assume !(1 == ~t2_pc~0); 358#L266-2true is_transmit2_triggered_~__retres1~2 := 0; 208#L277true is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 293#L278true activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 7#L621true assume !(0 != activate_threads_~tmp___1~0); 12#L621-2true havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 11#L285true assume 1 == ~t3_pc~0; 118#L286true assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 13#L296true is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 119#L297true activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 228#L629true assume !(0 != activate_threads_~tmp___2~0); 209#L629-2true havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 240#L304true assume !(1 == ~t4_pc~0); 221#L304-2true is_transmit4_triggered_~__retres1~4 := 0; 239#L315true is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 327#L316true activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 44#L637true assume !(0 != activate_threads_~tmp___3~0); 46#L637-2true assume !(1 == ~M_E~0); 117#L545-1true assume !(1 == ~T1_E~0); 159#L550-1true assume 1 == ~T2_E~0;~T2_E~0 := 2; 15#L555-1true assume !(1 == ~T3_E~0); 48#L560-1true assume !(1 == ~T4_E~0); 50#L565-1true assume !(1 == ~E_1~0); 260#L570-1true assume !(1 == ~E_2~0); 288#L575-1true assume !(1 == ~E_3~0); 347#L580-1true assume !(1 == ~E_4~0); 244#L766-1true [2019-11-15 23:58:54,210 INFO L793 eck$LassoCheckResult]: Loop: 244#L766-1true assume !false; 205#L767true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 179#L467true assume !true; 267#L482true start_simulation_~kernel_st~0 := 2; 167#L324-1true start_simulation_~kernel_st~0 := 3; 361#L492-2true assume !(0 == ~M_E~0); 320#L492-4true assume 0 == ~T1_E~0;~T1_E~0 := 1; 196#L497-3true assume 0 == ~T2_E~0;~T2_E~0 := 1; 233#L502-3true assume 0 == ~T3_E~0;~T3_E~0 := 1; 247#L507-3true assume 0 == ~T4_E~0;~T4_E~0 := 1; 87#L512-3true assume 0 == ~E_1~0;~E_1~0 := 1; 140#L517-3true assume 0 == ~E_2~0;~E_2~0 := 1; 186#L522-3true assume 0 == ~E_3~0;~E_3~0 := 1; 38#L527-3true assume !(0 == ~E_4~0); 53#L532-3true havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 289#L228-15true assume 1 == ~m_pc~0; 64#L229-5true assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 319#L239-5true is_master_triggered_#res := is_master_triggered_~__retres1~0; 66#L240-5true activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 103#L605-15true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 111#L605-17true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 114#L247-15true assume !(1 == ~t1_pc~0); 108#L247-17true is_transmit1_triggered_~__retres1~1 := 0; 146#L258-5true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 255#L259-5true activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 314#L613-15true assume !(0 != activate_threads_~tmp___0~0); 286#L613-17true havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 305#L266-15true assume !(1 == ~t2_pc~0); 338#L266-17true is_transmit2_triggered_~__retres1~2 := 0; 348#L277-5true is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 268#L278-5true activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 152#L621-15true assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 156#L621-17true havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 193#L285-15true assume 1 == ~t3_pc~0; 131#L286-5true assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 28#L296-5true is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 133#L297-5true activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 372#L629-15true assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 342#L629-17true havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 202#L304-15true assume 1 == ~t4_pc~0; 312#L305-5true assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 225#L315-5true is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 310#L316-5true activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 5#L637-15true assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 10#L637-17true assume 1 == ~M_E~0;~M_E~0 := 2; 84#L545-3true assume 1 == ~T1_E~0;~T1_E~0 := 2; 137#L550-3true assume 1 == ~T2_E~0;~T2_E~0 := 2; 183#L555-3true assume 1 == ~T3_E~0;~T3_E~0 := 2; 34#L560-3true assume 1 == ~T4_E~0;~T4_E~0 := 2; 52#L565-3true assume 1 == ~E_1~0;~E_1~0 := 2; 269#L570-3true assume !(1 == ~E_2~0); 295#L575-3true assume 1 == ~E_3~0;~E_3~0 := 2; 354#L580-3true assume 1 == ~E_4~0;~E_4~0 := 2; 213#L585-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 252#L364-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 95#L391-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 237#L392-1true start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 71#L785true assume !(0 == start_simulation_~tmp~3); 75#L785-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 257#L364-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 99#L391-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 238#L392-2true stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 300#L740true assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 49#L747true stop_simulation_#res := stop_simulation_~__retres2~0; 170#L748true start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 124#L798true assume !(0 != start_simulation_~tmp___0~1); 244#L766-1true [2019-11-15 23:58:54,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:54,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1688618289, now seen corresponding path program 1 times [2019-11-15 23:58:54,222 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:54,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043802413] [2019-11-15 23:58:54,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:54,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043802413] [2019-11-15 23:58:54,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:54,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:54,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128109609] [2019-11-15 23:58:54,376 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:58:54,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:54,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1580088769, now seen corresponding path program 1 times [2019-11-15 23:58:54,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:54,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664374927] [2019-11-15 23:58:54,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:54,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664374927] [2019-11-15 23:58:54,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:54,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:58:54,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383001960] [2019-11-15 23:58:54,442 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:54,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:54,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:58:54,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:58:54,463 INFO L87 Difference]: Start difference. First operand 373 states. Second operand 3 states. [2019-11-15 23:58:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:54,506 INFO L93 Difference]: Finished difference Result 373 states and 564 transitions. [2019-11-15 23:58:54,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:58:54,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 564 transitions. [2019-11-15 23:58:54,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2019-11-15 23:58:54,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 368 states and 559 transitions. [2019-11-15 23:58:54,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 368 [2019-11-15 23:58:54,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2019-11-15 23:58:54,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 559 transitions. [2019-11-15 23:58:54,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:54,542 INFO L688 BuchiCegarLoop]: Abstraction has 368 states and 559 transitions. [2019-11-15 23:58:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 559 transitions. [2019-11-15 23:58:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2019-11-15 23:58:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-15 23:58:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 559 transitions. [2019-11-15 23:58:54,593 INFO L711 BuchiCegarLoop]: Abstraction has 368 states and 559 transitions. [2019-11-15 23:58:54,593 INFO L591 BuchiCegarLoop]: Abstraction has 368 states and 559 transitions. [2019-11-15 23:58:54,593 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:58:54,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 368 states and 559 transitions. [2019-11-15 23:58:54,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2019-11-15 23:58:54,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:54,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:54,599 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, 1, 1, 1, 1, 1, 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-11-15 23:58:54,599 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, 1, 1, 1, 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-11-15 23:58:54,599 INFO L791 eck$LassoCheckResult]: Stem: 961#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 782#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 783#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 996#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 997#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 932#L336-1 assume !(1 == ~t2_i~0);~t2_st~0 := 2; 933#L341-1 assume !(1 == ~t3_i~0);~t3_st~0 := 2; 958#L346-1 assume !(1 == ~t4_i~0);~t4_st~0 := 2; 785#L351-1 assume !(0 == ~M_E~0); 786#L492-1 assume !(0 == ~T1_E~0); 1039#L497-1 assume !(0 == ~T2_E~0); 1040#L502-1 assume !(0 == ~T3_E~0); 1064#L507-1 assume 0 == ~T4_E~0;~T4_E~0 := 1; 955#L512-1 assume !(0 == ~E_1~0); 956#L517-1 assume !(0 == ~E_2~0); 972#L522-1 assume !(0 == ~E_3~0); 803#L527-1 assume !(0 == ~E_4~0); 804#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 838#L228 assume !(1 == ~m_pc~0); 847#L228-2 is_master_triggered_~__retres1~0 := 0; 846#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 848#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 849#L605 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 990#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 993#L247 assume 1 == ~t1_pc~0; 925#L248 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 926#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 928#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 929#L613 assume !(0 != activate_threads_~tmp___0~0); 1118#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 1024#L266 assume !(1 == ~t2_pc~0); 1025#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 1027#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 1028#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 766#L621 assume !(0 != activate_threads_~tmp___1~0); 767#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 771#L285 assume 1 == ~t3_pc~0; 772#L286 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 763#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 775#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 954#L629 assume !(0 != activate_threads_~tmp___2~0); 1029#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 1030#L304 assume !(1 == ~t4_pc~0); 1045#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 1046#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 1061#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 830#L637 assume !(0 != activate_threads_~tmp___3~0); 831#L637-2 assume !(1 == ~M_E~0); 832#L545-1 assume !(1 == ~T1_E~0); 951#L550-1 assume 1 == ~T2_E~0;~T2_E~0 := 2; 778#L555-1 assume !(1 == ~T3_E~0); 779#L560-1 assume !(1 == ~T4_E~0); 834#L565-1 assume !(1 == ~E_1~0); 837#L570-1 assume !(1 == ~E_2~0); 1069#L575-1 assume !(1 == ~E_3~0); 1101#L580-1 assume !(1 == ~E_4~0); 960#L766-1 [2019-11-15 23:58:54,600 INFO L793 eck$LassoCheckResult]: Loop: 960#L766-1 assume !false; 1023#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 844#L467 assume !false; 914#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 915#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 855#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 916#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 820#L406 assume !(0 != eval_~tmp~0); 822#L482 start_simulation_~kernel_st~0 := 2; 999#L324-1 start_simulation_~kernel_st~0 := 3; 1000#L492-2 assume !(0 == ~M_E~0); 1110#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1012#L497-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 1013#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 1059#L507-3 assume 0 == ~T4_E~0;~T4_E~0 := 1; 910#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 911#L517-3 assume 0 == ~E_2~0;~E_2~0 := 1; 978#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 814#L527-3 assume !(0 == ~E_4~0); 815#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 840#L228-15 assume 1 == ~m_pc~0; 860#L229-5 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 861#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 866#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 867#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 936#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 947#L247-15 assume 1 == ~t1_pc~0; 949#L248-5 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 943#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 984#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1067#L613-15 assume !(0 != activate_threads_~tmp___0~0); 1095#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 1096#L266-15 assume 1 == ~t2_pc~0; 1074#L267-5 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2 := 1; 1075#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 1078#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 987#L621-15 assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 988#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 991#L285-15 assume 1 == ~t3_pc~0; 968#L286-5 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 796#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 797#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 971#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 1116#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 1018#L304-15 assume 1 == ~t4_pc~0; 1019#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 1022#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 1051#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 760#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 761#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 770#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 903#L550-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 975#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 807#L560-3 assume 1 == ~T4_E~0;~T4_E~0 := 2; 808#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 839#L570-3 assume !(1 == ~E_2~0); 1079#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 1103#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 1036#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 1037#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 864#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 923#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 876#L785 assume !(0 == start_simulation_~tmp~3); 877#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 884#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 872#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 930#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 1060#L740 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 835#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 836#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 959#L798 assume !(0 != start_simulation_~tmp___0~1); 960#L766-1 [2019-11-15 23:58:54,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:54,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1244717615, now seen corresponding path program 1 times [2019-11-15 23:58:54,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:54,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644597410] [2019-11-15 23:58:54,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:54,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644597410] [2019-11-15 23:58:54,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:54,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:54,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249413393] [2019-11-15 23:58:54,645 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:58:54,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:54,645 INFO L82 PathProgramCache]: Analyzing trace with hash 554242591, now seen corresponding path program 1 times [2019-11-15 23:58:54,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:54,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983871504] [2019-11-15 23:58:54,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:54,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983871504] [2019-11-15 23:58:54,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:54,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:54,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226016667] [2019-11-15 23:58:54,718 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:54,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:54,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:58:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:58:54,719 INFO L87 Difference]: Start difference. First operand 368 states and 559 transitions. cyclomatic complexity: 192 Second operand 3 states. [2019-11-15 23:58:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:54,737 INFO L93 Difference]: Finished difference Result 368 states and 558 transitions. [2019-11-15 23:58:54,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:58:54,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 368 states and 558 transitions. [2019-11-15 23:58:54,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2019-11-15 23:58:54,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 368 states to 368 states and 558 transitions. [2019-11-15 23:58:54,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 368 [2019-11-15 23:58:54,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2019-11-15 23:58:54,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 558 transitions. [2019-11-15 23:58:54,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:54,765 INFO L688 BuchiCegarLoop]: Abstraction has 368 states and 558 transitions. [2019-11-15 23:58:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 558 transitions. [2019-11-15 23:58:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2019-11-15 23:58:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-15 23:58:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 558 transitions. [2019-11-15 23:58:54,783 INFO L711 BuchiCegarLoop]: Abstraction has 368 states and 558 transitions. [2019-11-15 23:58:54,783 INFO L591 BuchiCegarLoop]: Abstraction has 368 states and 558 transitions. [2019-11-15 23:58:54,783 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:58:54,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 368 states and 558 transitions. [2019-11-15 23:58:54,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2019-11-15 23:58:54,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:54,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:54,789 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, 1, 1, 1, 1, 1, 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-11-15 23:58:54,789 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, 1, 1, 1, 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-11-15 23:58:54,789 INFO L791 eck$LassoCheckResult]: Stem: 1704#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 1523#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 1524#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 1737#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 1738#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1675#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 1676#L341-1 assume !(1 == ~t3_i~0);~t3_st~0 := 2; 1700#L346-1 assume !(1 == ~t4_i~0);~t4_st~0 := 2; 1527#L351-1 assume !(0 == ~M_E~0); 1528#L492-1 assume !(0 == ~T1_E~0); 1781#L497-1 assume !(0 == ~T2_E~0); 1782#L502-1 assume !(0 == ~T3_E~0); 1807#L507-1 assume 0 == ~T4_E~0;~T4_E~0 := 1; 1698#L512-1 assume !(0 == ~E_1~0); 1699#L517-1 assume !(0 == ~E_2~0); 1715#L522-1 assume !(0 == ~E_3~0); 1546#L527-1 assume !(0 == ~E_4~0); 1547#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1581#L228 assume !(1 == ~m_pc~0); 1590#L228-2 is_master_triggered_~__retres1~0 := 0; 1589#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1591#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1592#L605 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1733#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1735#L247 assume 1 == ~t1_pc~0; 1667#L248 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 1668#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1671#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1672#L613 assume !(0 != activate_threads_~tmp___0~0); 1860#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 1767#L266 assume !(1 == ~t2_pc~0); 1768#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 1770#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 1771#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 1507#L621 assume !(0 != activate_threads_~tmp___1~0); 1508#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 1514#L285 assume 1 == ~t3_pc~0; 1515#L286 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 1506#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 1516#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1695#L629 assume !(0 != activate_threads_~tmp___2~0); 1772#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 1773#L304 assume !(1 == ~t4_pc~0); 1788#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 1789#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 1804#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 1571#L637 assume !(0 != activate_threads_~tmp___3~0); 1572#L637-2 assume !(1 == ~M_E~0); 1575#L545-1 assume !(1 == ~T1_E~0); 1694#L550-1 assume 1 == ~T2_E~0;~T2_E~0 := 2; 1519#L555-1 assume !(1 == ~T3_E~0); 1520#L560-1 assume !(1 == ~T4_E~0); 1577#L565-1 assume !(1 == ~E_1~0); 1580#L570-1 assume !(1 == ~E_2~0); 1812#L575-1 assume !(1 == ~E_3~0); 1843#L580-1 assume !(1 == ~E_4~0); 1703#L766-1 [2019-11-15 23:58:54,790 INFO L793 eck$LassoCheckResult]: Loop: 1703#L766-1 assume !false; 1765#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 1587#L467 assume !false; 1655#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 1656#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 1595#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 1659#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 1563#L406 assume !(0 != eval_~tmp~0); 1565#L482 start_simulation_~kernel_st~0 := 2; 1742#L324-1 start_simulation_~kernel_st~0 := 3; 1743#L492-2 assume !(0 == ~M_E~0); 1853#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1755#L497-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 1756#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 1802#L507-3 assume 0 == ~T4_E~0;~T4_E~0 := 1; 1650#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1651#L517-3 assume 0 == ~E_2~0;~E_2~0 := 1; 1723#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 1561#L527-3 assume !(0 == ~E_4~0); 1562#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1583#L228-15 assume 1 == ~m_pc~0; 1603#L229-5 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 1604#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1609#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1610#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1679#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1690#L247-15 assume !(1 == ~t1_pc~0); 1687#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 1688#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1729#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1811#L613-15 assume !(0 != activate_threads_~tmp___0~0); 1838#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 1839#L266-15 assume 1 == ~t2_pc~0; 1818#L267-5 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2 := 1; 1819#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 1821#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 1730#L621-15 assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 1731#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 1734#L285-15 assume !(1 == ~t3_pc~0); 1712#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 1539#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 1540#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 1714#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 1859#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 1761#L304-15 assume 1 == ~t4_pc~0; 1762#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 1766#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 1794#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 1503#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 1504#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 1513#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1646#L550-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 1718#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 1550#L560-3 assume 1 == ~T4_E~0;~T4_E~0 := 2; 1551#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1582#L570-3 assume !(1 == ~E_2~0); 1822#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 1846#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 1779#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 1780#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 1607#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 1666#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 1622#L785 assume !(0 == start_simulation_~tmp~3); 1623#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 1631#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 1615#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 1673#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 1803#L740 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 1578#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 1579#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 1702#L798 assume !(0 != start_simulation_~tmp___0~1); 1703#L766-1 [2019-11-15 23:58:54,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:54,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1021663571, now seen corresponding path program 1 times [2019-11-15 23:58:54,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:54,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083126531] [2019-11-15 23:58:54,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:54,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083126531] [2019-11-15 23:58:54,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:54,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:54,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805911383] [2019-11-15 23:58:54,826 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:58:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1895792863, now seen corresponding path program 1 times [2019-11-15 23:58:54,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:54,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945010853] [2019-11-15 23:58:54,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:54,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945010853] [2019-11-15 23:58:54,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:54,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:54,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510330527] [2019-11-15 23:58:54,883 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:54,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:54,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:58:54,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:58:54,884 INFO L87 Difference]: Start difference. First operand 368 states and 558 transitions. cyclomatic complexity: 191 Second operand 3 states. [2019-11-15 23:58:54,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:54,898 INFO L93 Difference]: Finished difference Result 368 states and 557 transitions. [2019-11-15 23:58:54,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:58:54,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 368 states and 557 transitions. [2019-11-15 23:58:54,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2019-11-15 23:58:54,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 368 states to 368 states and 557 transitions. [2019-11-15 23:58:54,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 368 [2019-11-15 23:58:54,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2019-11-15 23:58:54,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 557 transitions. [2019-11-15 23:58:54,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:54,908 INFO L688 BuchiCegarLoop]: Abstraction has 368 states and 557 transitions. [2019-11-15 23:58:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 557 transitions. [2019-11-15 23:58:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2019-11-15 23:58:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-15 23:58:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 557 transitions. [2019-11-15 23:58:54,919 INFO L711 BuchiCegarLoop]: Abstraction has 368 states and 557 transitions. [2019-11-15 23:58:54,919 INFO L591 BuchiCegarLoop]: Abstraction has 368 states and 557 transitions. [2019-11-15 23:58:54,919 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:58:54,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 368 states and 557 transitions. [2019-11-15 23:58:54,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2019-11-15 23:58:54,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:54,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:54,924 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, 1, 1, 1, 1, 1, 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-11-15 23:58:54,924 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, 1, 1, 1, 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-11-15 23:58:54,924 INFO L791 eck$LassoCheckResult]: Stem: 2447#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 2268#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 2269#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 2482#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 2483#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2418#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 2419#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 2443#L346-1 assume !(1 == ~t4_i~0);~t4_st~0 := 2; 2271#L351-1 assume !(0 == ~M_E~0); 2272#L492-1 assume !(0 == ~T1_E~0); 2525#L497-1 assume !(0 == ~T2_E~0); 2526#L502-1 assume !(0 == ~T3_E~0); 2550#L507-1 assume 0 == ~T4_E~0;~T4_E~0 := 1; 2441#L512-1 assume !(0 == ~E_1~0); 2442#L517-1 assume !(0 == ~E_2~0); 2458#L522-1 assume !(0 == ~E_3~0); 2289#L527-1 assume !(0 == ~E_4~0); 2290#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2324#L228 assume !(1 == ~m_pc~0); 2333#L228-2 is_master_triggered_~__retres1~0 := 0; 2332#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2334#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2335#L605 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 2476#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2479#L247 assume 1 == ~t1_pc~0; 2411#L248 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 2412#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2414#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2415#L613 assume !(0 != activate_threads_~tmp___0~0); 2604#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 2510#L266 assume !(1 == ~t2_pc~0); 2511#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 2513#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 2514#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 2252#L621 assume !(0 != activate_threads_~tmp___1~0); 2253#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 2257#L285 assume 1 == ~t3_pc~0; 2258#L286 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 2249#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 2261#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2438#L629 assume !(0 != activate_threads_~tmp___2~0); 2515#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 2516#L304 assume !(1 == ~t4_pc~0); 2531#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 2532#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 2547#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 2316#L637 assume !(0 != activate_threads_~tmp___3~0); 2317#L637-2 assume !(1 == ~M_E~0); 2318#L545-1 assume !(1 == ~T1_E~0); 2437#L550-1 assume 1 == ~T2_E~0;~T2_E~0 := 2; 2264#L555-1 assume !(1 == ~T3_E~0); 2265#L560-1 assume !(1 == ~T4_E~0); 2320#L565-1 assume !(1 == ~E_1~0); 2323#L570-1 assume !(1 == ~E_2~0); 2555#L575-1 assume !(1 == ~E_3~0); 2587#L580-1 assume !(1 == ~E_4~0); 2446#L766-1 [2019-11-15 23:58:54,925 INFO L793 eck$LassoCheckResult]: Loop: 2446#L766-1 assume !false; 2509#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 2330#L467 assume !false; 2398#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 2399#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 2341#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 2402#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 2306#L406 assume !(0 != eval_~tmp~0); 2308#L482 start_simulation_~kernel_st~0 := 2; 2485#L324-1 start_simulation_~kernel_st~0 := 3; 2486#L492-2 assume !(0 == ~M_E~0); 2596#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2498#L497-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 2499#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 2545#L507-3 assume 0 == ~T4_E~0;~T4_E~0 := 1; 2393#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 2394#L517-3 assume 0 == ~E_2~0;~E_2~0 := 1; 2466#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 2304#L527-3 assume !(0 == ~E_4~0); 2305#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2326#L228-15 assume 1 == ~m_pc~0; 2349#L229-5 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 2350#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2352#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2353#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 2422#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2433#L247-15 assume 1 == ~t1_pc~0; 2435#L248-5 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 2429#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2470#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2553#L613-15 assume !(0 != activate_threads_~tmp___0~0); 2581#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 2582#L266-15 assume 1 == ~t2_pc~0; 2560#L267-5 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2 := 1; 2561#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 2564#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 2473#L621-15 assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 2474#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 2477#L285-15 assume 1 == ~t3_pc~0; 2454#L286-5 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 2282#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 2283#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 2456#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 2602#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 2504#L304-15 assume 1 == ~t4_pc~0; 2505#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 2508#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 2537#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 2246#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 2247#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 2256#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2386#L550-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 2461#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 2293#L560-3 assume 1 == ~T4_E~0;~T4_E~0 := 2; 2294#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 2325#L570-3 assume !(1 == ~E_2~0); 2565#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 2589#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 2522#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 2523#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 2347#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 2409#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 2362#L785 assume !(0 == start_simulation_~tmp~3); 2363#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 2370#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 2355#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 2416#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 2546#L740 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 2321#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 2322#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 2445#L798 assume !(0 != start_simulation_~tmp___0~1); 2446#L766-1 [2019-11-15 23:58:54,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:54,925 INFO L82 PathProgramCache]: Analyzing trace with hash -540583313, now seen corresponding path program 1 times [2019-11-15 23:58:54,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:54,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836316359] [2019-11-15 23:58:54,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:54,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:54,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836316359] [2019-11-15 23:58:54,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:54,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:54,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883389072] [2019-11-15 23:58:54,964 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:58:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:54,965 INFO L82 PathProgramCache]: Analyzing trace with hash 554242591, now seen corresponding path program 2 times [2019-11-15 23:58:54,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:54,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825549357] [2019-11-15 23:58:54,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:54,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:55,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825549357] [2019-11-15 23:58:55,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:55,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:55,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221019563] [2019-11-15 23:58:55,031 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:55,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:55,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:58:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:58:55,032 INFO L87 Difference]: Start difference. First operand 368 states and 557 transitions. cyclomatic complexity: 190 Second operand 3 states. [2019-11-15 23:58:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:55,042 INFO L93 Difference]: Finished difference Result 368 states and 556 transitions. [2019-11-15 23:58:55,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:58:55,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 368 states and 556 transitions. [2019-11-15 23:58:55,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2019-11-15 23:58:55,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 368 states to 368 states and 556 transitions. [2019-11-15 23:58:55,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 368 [2019-11-15 23:58:55,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2019-11-15 23:58:55,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 556 transitions. [2019-11-15 23:58:55,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:55,059 INFO L688 BuchiCegarLoop]: Abstraction has 368 states and 556 transitions. [2019-11-15 23:58:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 556 transitions. [2019-11-15 23:58:55,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2019-11-15 23:58:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-15 23:58:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 556 transitions. [2019-11-15 23:58:55,076 INFO L711 BuchiCegarLoop]: Abstraction has 368 states and 556 transitions. [2019-11-15 23:58:55,076 INFO L591 BuchiCegarLoop]: Abstraction has 368 states and 556 transitions. [2019-11-15 23:58:55,077 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:58:55,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 368 states and 556 transitions. [2019-11-15 23:58:55,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2019-11-15 23:58:55,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:55,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:55,081 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, 1, 1, 1, 1, 1, 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-11-15 23:58:55,081 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, 1, 1, 1, 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-11-15 23:58:55,082 INFO L791 eck$LassoCheckResult]: Stem: 3190#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 3009#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 3010#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 3223#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 3224#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 3161#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 3162#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 3186#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 3013#L351-1 assume !(0 == ~M_E~0); 3014#L492-1 assume !(0 == ~T1_E~0); 3267#L497-1 assume !(0 == ~T2_E~0); 3268#L502-1 assume !(0 == ~T3_E~0); 3293#L507-1 assume 0 == ~T4_E~0;~T4_E~0 := 1; 3184#L512-1 assume !(0 == ~E_1~0); 3185#L517-1 assume !(0 == ~E_2~0); 3201#L522-1 assume !(0 == ~E_3~0); 3032#L527-1 assume !(0 == ~E_4~0); 3033#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 3067#L228 assume !(1 == ~m_pc~0); 3076#L228-2 is_master_triggered_~__retres1~0 := 0; 3075#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 3077#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3078#L605 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 3219#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 3221#L247 assume 1 == ~t1_pc~0; 3153#L248 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 3154#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 3157#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 3158#L613 assume !(0 != activate_threads_~tmp___0~0); 3346#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 3253#L266 assume !(1 == ~t2_pc~0); 3254#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 3256#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 3257#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 2993#L621 assume !(0 != activate_threads_~tmp___1~0); 2994#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 3000#L285 assume 1 == ~t3_pc~0; 3001#L286 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 2992#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 3002#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 3181#L629 assume !(0 != activate_threads_~tmp___2~0); 3258#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 3259#L304 assume !(1 == ~t4_pc~0); 3274#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 3275#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 3290#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 3057#L637 assume !(0 != activate_threads_~tmp___3~0); 3058#L637-2 assume !(1 == ~M_E~0); 3061#L545-1 assume !(1 == ~T1_E~0); 3180#L550-1 assume 1 == ~T2_E~0;~T2_E~0 := 2; 3005#L555-1 assume !(1 == ~T3_E~0); 3006#L560-1 assume !(1 == ~T4_E~0); 3063#L565-1 assume !(1 == ~E_1~0); 3066#L570-1 assume !(1 == ~E_2~0); 3298#L575-1 assume !(1 == ~E_3~0); 3329#L580-1 assume !(1 == ~E_4~0); 3189#L766-1 [2019-11-15 23:58:55,082 INFO L793 eck$LassoCheckResult]: Loop: 3189#L766-1 assume !false; 3251#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 3073#L467 assume !false; 3141#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 3142#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 3081#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 3145#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 3049#L406 assume !(0 != eval_~tmp~0); 3051#L482 start_simulation_~kernel_st~0 := 2; 3228#L324-1 start_simulation_~kernel_st~0 := 3; 3229#L492-2 assume !(0 == ~M_E~0); 3339#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 3241#L497-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 3242#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 3288#L507-3 assume 0 == ~T4_E~0;~T4_E~0 := 1; 3136#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 3137#L517-3 assume 0 == ~E_2~0;~E_2~0 := 1; 3209#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 3047#L527-3 assume !(0 == ~E_4~0); 3048#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 3069#L228-15 assume 1 == ~m_pc~0; 3089#L229-5 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 3090#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 3095#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3096#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 3165#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 3176#L247-15 assume !(1 == ~t1_pc~0); 3173#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 3174#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 3215#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 3297#L613-15 assume !(0 != activate_threads_~tmp___0~0); 3324#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 3325#L266-15 assume 1 == ~t2_pc~0; 3304#L267-5 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2 := 1; 3305#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 3307#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 3216#L621-15 assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 3217#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 3220#L285-15 assume 1 == ~t3_pc~0; 3197#L286-5 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 3025#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 3026#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 3200#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 3345#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 3247#L304-15 assume 1 == ~t4_pc~0; 3248#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 3252#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 3280#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 2989#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 2990#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 2999#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 3132#L550-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 3204#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 3036#L560-3 assume 1 == ~T4_E~0;~T4_E~0 := 2; 3037#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 3068#L570-3 assume !(1 == ~E_2~0); 3308#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 3332#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 3265#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 3266#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 3093#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 3152#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 3108#L785 assume !(0 == start_simulation_~tmp~3); 3109#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 3117#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 3101#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 3159#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 3289#L740 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 3064#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 3065#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 3188#L798 assume !(0 != start_simulation_~tmp___0~1); 3189#L766-1 [2019-11-15 23:58:55,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash -525064595, now seen corresponding path program 1 times [2019-11-15 23:58:55,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:55,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179568575] [2019-11-15 23:58:55,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:55,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179568575] [2019-11-15 23:58:55,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:55,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:58:55,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128710075] [2019-11-15 23:58:55,155 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:58:55,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:55,155 INFO L82 PathProgramCache]: Analyzing trace with hash -319235104, now seen corresponding path program 1 times [2019-11-15 23:58:55,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:55,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277936167] [2019-11-15 23:58:55,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:55,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277936167] [2019-11-15 23:58:55,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:55,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:55,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409487881] [2019-11-15 23:58:55,237 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:55,238 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:55,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:58:55,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:58:55,239 INFO L87 Difference]: Start difference. First operand 368 states and 556 transitions. cyclomatic complexity: 189 Second operand 3 states. [2019-11-15 23:58:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:55,259 INFO L93 Difference]: Finished difference Result 368 states and 551 transitions. [2019-11-15 23:58:55,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:58:55,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 368 states and 551 transitions. [2019-11-15 23:58:55,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2019-11-15 23:58:55,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 368 states to 368 states and 551 transitions. [2019-11-15 23:58:55,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 368 [2019-11-15 23:58:55,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2019-11-15 23:58:55,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 368 states and 551 transitions. [2019-11-15 23:58:55,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:55,268 INFO L688 BuchiCegarLoop]: Abstraction has 368 states and 551 transitions. [2019-11-15 23:58:55,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states and 551 transitions. [2019-11-15 23:58:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2019-11-15 23:58:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-15 23:58:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 551 transitions. [2019-11-15 23:58:55,277 INFO L711 BuchiCegarLoop]: Abstraction has 368 states and 551 transitions. [2019-11-15 23:58:55,277 INFO L591 BuchiCegarLoop]: Abstraction has 368 states and 551 transitions. [2019-11-15 23:58:55,277 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:58:55,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 368 states and 551 transitions. [2019-11-15 23:58:55,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 307 [2019-11-15 23:58:55,280 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:55,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:55,284 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, 1, 1, 1, 1, 1, 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-11-15 23:58:55,284 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, 1, 1, 1, 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-11-15 23:58:55,284 INFO L791 eck$LassoCheckResult]: Stem: 3933#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 3754#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 3755#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 3966#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 3967#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 3904#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 3905#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 3929#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 3757#L351-1 assume !(0 == ~M_E~0); 3758#L492-1 assume !(0 == ~T1_E~0); 4011#L497-1 assume !(0 == ~T2_E~0); 4012#L502-1 assume !(0 == ~T3_E~0); 4036#L507-1 assume !(0 == ~T4_E~0); 3927#L512-1 assume !(0 == ~E_1~0); 3928#L517-1 assume !(0 == ~E_2~0); 3944#L522-1 assume !(0 == ~E_3~0); 3775#L527-1 assume !(0 == ~E_4~0); 3776#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 3810#L228 assume !(1 == ~m_pc~0); 3819#L228-2 is_master_triggered_~__retres1~0 := 0; 3818#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 3820#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3821#L605 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 3962#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 3965#L247 assume 1 == ~t1_pc~0; 3897#L248 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 3898#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 3900#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 3901#L613 assume !(0 != activate_threads_~tmp___0~0); 4090#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 3996#L266 assume !(1 == ~t2_pc~0); 3997#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 3999#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 4000#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 3738#L621 assume !(0 != activate_threads_~tmp___1~0); 3739#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 3743#L285 assume 1 == ~t3_pc~0; 3744#L286 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 3735#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 3747#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 3924#L629 assume !(0 != activate_threads_~tmp___2~0); 4001#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 4002#L304 assume !(1 == ~t4_pc~0); 4017#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 4018#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 4033#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 3802#L637 assume !(0 != activate_threads_~tmp___3~0); 3803#L637-2 assume !(1 == ~M_E~0); 3804#L545-1 assume !(1 == ~T1_E~0); 3923#L550-1 assume 1 == ~T2_E~0;~T2_E~0 := 2; 3748#L555-1 assume !(1 == ~T3_E~0); 3749#L560-1 assume !(1 == ~T4_E~0); 3806#L565-1 assume !(1 == ~E_1~0); 3809#L570-1 assume !(1 == ~E_2~0); 4041#L575-1 assume !(1 == ~E_3~0); 4072#L580-1 assume !(1 == ~E_4~0); 3932#L766-1 [2019-11-15 23:58:55,285 INFO L793 eck$LassoCheckResult]: Loop: 3932#L766-1 assume !false; 3995#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 3816#L467 assume !false; 3884#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 3885#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 3827#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 3888#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 3792#L406 assume !(0 != eval_~tmp~0); 3794#L482 start_simulation_~kernel_st~0 := 2; 3971#L324-1 start_simulation_~kernel_st~0 := 3; 3972#L492-2 assume !(0 == ~M_E~0); 4082#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 3984#L497-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 3985#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 4031#L507-3 assume !(0 == ~T4_E~0); 3879#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 3880#L517-3 assume 0 == ~E_2~0;~E_2~0 := 1; 3952#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 3790#L527-3 assume !(0 == ~E_4~0); 3791#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 3812#L228-15 assume 1 == ~m_pc~0; 3835#L229-5 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 3836#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 3838#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3839#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 3911#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 3920#L247-15 assume 1 == ~t1_pc~0; 3922#L248-5 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 3918#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 3958#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 4040#L613-15 assume !(0 != activate_threads_~tmp___0~0); 4067#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 4068#L266-15 assume !(1 == ~t2_pc~0); 4048#L266-17 is_transmit2_triggered_~__retres1~2 := 0; 4047#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 4050#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 3959#L621-15 assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 3960#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 3963#L285-15 assume 1 == ~t3_pc~0; 3940#L286-5 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 3768#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 3769#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 3942#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 4088#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 3990#L304-15 assume 1 == ~t4_pc~0; 3991#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 3994#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 4023#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 3732#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 3733#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 3740#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 3872#L550-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 3947#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 3779#L560-3 assume !(1 == ~T4_E~0); 3780#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 3811#L570-3 assume !(1 == ~E_2~0); 4051#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 4075#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 4008#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 4009#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 3833#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 3895#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 3848#L785 assume !(0 == start_simulation_~tmp~3); 3849#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 3856#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 3841#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 3902#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 4032#L740 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 3807#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 3808#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 3931#L798 assume !(0 != start_simulation_~tmp___0~1); 3932#L766-1 [2019-11-15 23:58:55,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:55,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1720514859, now seen corresponding path program 1 times [2019-11-15 23:58:55,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:55,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117035726] [2019-11-15 23:58:55,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:55,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117035726] [2019-11-15 23:58:55,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:55,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:58:55,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755525418] [2019-11-15 23:58:55,351 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:58:55,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:55,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1135913248, now seen corresponding path program 1 times [2019-11-15 23:58:55,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:55,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217478275] [2019-11-15 23:58:55,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:55,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217478275] [2019-11-15 23:58:55,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:55,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:55,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659037664] [2019-11-15 23:58:55,399 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:55,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:55,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:58:55,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:58:55,400 INFO L87 Difference]: Start difference. First operand 368 states and 551 transitions. cyclomatic complexity: 184 Second operand 3 states. [2019-11-15 23:58:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:55,463 INFO L93 Difference]: Finished difference Result 633 states and 939 transitions. [2019-11-15 23:58:55,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:58:55,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 633 states and 939 transitions. [2019-11-15 23:58:55,468 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 571 [2019-11-15 23:58:55,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 633 states to 633 states and 939 transitions. [2019-11-15 23:58:55,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 633 [2019-11-15 23:58:55,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 633 [2019-11-15 23:58:55,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 633 states and 939 transitions. [2019-11-15 23:58:55,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:55,476 INFO L688 BuchiCegarLoop]: Abstraction has 633 states and 939 transitions. [2019-11-15 23:58:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states and 939 transitions. [2019-11-15 23:58:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 631. [2019-11-15 23:58:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-11-15 23:58:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 937 transitions. [2019-11-15 23:58:55,496 INFO L711 BuchiCegarLoop]: Abstraction has 631 states and 937 transitions. [2019-11-15 23:58:55,496 INFO L591 BuchiCegarLoop]: Abstraction has 631 states and 937 transitions. [2019-11-15 23:58:55,496 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:58:55,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 631 states and 937 transitions. [2019-11-15 23:58:55,500 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 569 [2019-11-15 23:58:55,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:55,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:55,501 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, 1, 1, 1, 1, 1, 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-11-15 23:58:55,502 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, 1, 1, 1, 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-11-15 23:58:55,502 INFO L791 eck$LassoCheckResult]: Stem: 4938#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 4760#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 4761#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 4972#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 4973#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 4910#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 4911#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 4934#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 4764#L351-1 assume !(0 == ~M_E~0); 4765#L492-1 assume !(0 == ~T1_E~0); 5021#L497-1 assume !(0 == ~T2_E~0); 5022#L502-1 assume !(0 == ~T3_E~0); 5050#L507-1 assume !(0 == ~T4_E~0); 4932#L512-1 assume !(0 == ~E_1~0); 4933#L517-1 assume !(0 == ~E_2~0); 4949#L522-1 assume !(0 == ~E_3~0); 4783#L527-1 assume !(0 == ~E_4~0); 4784#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 4819#L228 assume !(1 == ~m_pc~0); 4828#L228-2 is_master_triggered_~__retres1~0 := 0; 4827#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 4829#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 4830#L605 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 4967#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 4969#L247 assume !(1 == ~t1_pc~0); 4983#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 4984#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 4906#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 4907#L613 assume !(0 != activate_threads_~tmp___0~0); 5114#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 5007#L266 assume !(1 == ~t2_pc~0); 5008#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 5010#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 5011#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 4744#L621 assume !(0 != activate_threads_~tmp___1~0); 4745#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 4751#L285 assume 1 == ~t3_pc~0; 4752#L286 assume 1 == ~E_3~0;is_transmit3_triggered_~__retres1~3 := 1; 4743#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 4753#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 4929#L629 assume !(0 != activate_threads_~tmp___2~0); 5012#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 5013#L304 assume !(1 == ~t4_pc~0); 5030#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 5031#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 5047#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 4809#L637 assume !(0 != activate_threads_~tmp___3~0); 4810#L637-2 assume !(1 == ~M_E~0); 4813#L545-1 assume !(1 == ~T1_E~0); 4928#L550-1 assume 1 == ~T2_E~0;~T2_E~0 := 2; 4756#L555-1 assume !(1 == ~T3_E~0); 4757#L560-1 assume !(1 == ~T4_E~0); 4815#L565-1 assume !(1 == ~E_1~0); 4818#L570-1 assume !(1 == ~E_2~0); 5064#L575-1 assume !(1 == ~E_3~0); 5096#L580-1 assume !(1 == ~E_4~0); 5115#L766-1 [2019-11-15 23:58:55,502 INFO L793 eck$LassoCheckResult]: Loop: 5115#L766-1 assume !false; 5005#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 4825#L467 assume !false; 4893#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 4894#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 4833#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 4897#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 4800#L406 assume !(0 != eval_~tmp~0); 4802#L482 start_simulation_~kernel_st~0 := 2; 4977#L324-1 start_simulation_~kernel_st~0 := 3; 4978#L492-2 assume !(0 == ~M_E~0); 5107#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 4995#L497-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 4996#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 5044#L507-3 assume !(0 == ~T4_E~0); 4888#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 4889#L517-3 assume 0 == ~E_2~0;~E_2~0 := 1; 4957#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 4798#L527-3 assume !(0 == ~E_4~0); 4799#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 4821#L228-15 assume 1 == ~m_pc~0; 4841#L229-5 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 4842#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 4847#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 4848#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 4914#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 4924#L247-15 assume !(1 == ~t1_pc~0); 4926#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 5308#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5307#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 5306#L613-15 assume !(0 != activate_threads_~tmp___0~0); 5305#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 5304#L266-15 assume 1 == ~t2_pc~0; 5302#L267-5 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2 := 1; 5301#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 5300#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 5299#L621-15 assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 5297#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 5295#L285-15 assume !(1 == ~t3_pc~0); 5292#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 5290#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 5289#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 5286#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 5284#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 5282#L304-15 assume !(1 == ~t4_pc~0); 5280#L304-17 is_transmit4_triggered_~__retres1~4 := 0; 5277#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 5275#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 5274#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 5273#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 5271#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 5269#L550-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 5267#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 5265#L560-3 assume !(1 == ~T4_E~0); 5263#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 5260#L570-3 assume !(1 == ~E_2~0); 5258#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 5256#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 5254#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 5245#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 5241#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 5239#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 5238#L785 assume !(0 == start_simulation_~tmp~3); 5236#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 5233#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 5230#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 5229#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 5228#L740 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 5227#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 5226#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 5225#L798 assume !(0 != start_simulation_~tmp___0~1); 5115#L766-1 [2019-11-15 23:58:55,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:55,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1655477814, now seen corresponding path program 1 times [2019-11-15 23:58:55,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:55,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933606916] [2019-11-15 23:58:55,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:55,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933606916] [2019-11-15 23:58:55,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:55,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:58:55,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340248850] [2019-11-15 23:58:55,545 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:58:55,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:55,545 INFO L82 PathProgramCache]: Analyzing trace with hash -6570654, now seen corresponding path program 1 times [2019-11-15 23:58:55,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:55,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966378019] [2019-11-15 23:58:55,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:55,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966378019] [2019-11-15 23:58:55,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:55,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:55,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520211762] [2019-11-15 23:58:55,570 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:55,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:55,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:58:55,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:58:55,571 INFO L87 Difference]: Start difference. First operand 631 states and 937 transitions. cyclomatic complexity: 308 Second operand 3 states. [2019-11-15 23:58:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:55,626 INFO L93 Difference]: Finished difference Result 1121 states and 1653 transitions. [2019-11-15 23:58:55,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:58:55,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1121 states and 1653 transitions. [2019-11-15 23:58:55,635 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1054 [2019-11-15 23:58:55,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1121 states to 1121 states and 1653 transitions. [2019-11-15 23:58:55,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1121 [2019-11-15 23:58:55,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1121 [2019-11-15 23:58:55,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1121 states and 1653 transitions. [2019-11-15 23:58:55,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:55,649 INFO L688 BuchiCegarLoop]: Abstraction has 1121 states and 1653 transitions. [2019-11-15 23:58:55,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states and 1653 transitions. [2019-11-15 23:58:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1117. [2019-11-15 23:58:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2019-11-15 23:58:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1649 transitions. [2019-11-15 23:58:55,671 INFO L711 BuchiCegarLoop]: Abstraction has 1117 states and 1649 transitions. [2019-11-15 23:58:55,671 INFO L591 BuchiCegarLoop]: Abstraction has 1117 states and 1649 transitions. [2019-11-15 23:58:55,671 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:58:55,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1117 states and 1649 transitions. [2019-11-15 23:58:55,678 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1050 [2019-11-15 23:58:55,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:55,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:55,679 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, 1, 1, 1, 1, 1, 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-11-15 23:58:55,679 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, 1, 1, 1, 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-11-15 23:58:55,679 INFO L791 eck$LassoCheckResult]: Stem: 6700#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 6520#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 6521#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 6742#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 6743#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 6668#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 6669#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 6696#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 6522#L351-1 assume !(0 == ~M_E~0); 6523#L492-1 assume !(0 == ~T1_E~0); 6793#L497-1 assume !(0 == ~T2_E~0); 6794#L502-1 assume !(0 == ~T3_E~0); 6820#L507-1 assume !(0 == ~T4_E~0); 6694#L512-1 assume !(0 == ~E_1~0); 6695#L517-1 assume !(0 == ~E_2~0); 6712#L522-1 assume !(0 == ~E_3~0); 6540#L527-1 assume !(0 == ~E_4~0); 6541#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 6576#L228 assume !(1 == ~m_pc~0); 6586#L228-2 is_master_triggered_~__retres1~0 := 0; 6585#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6587#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 6588#L605 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 6735#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 6741#L247 assume !(1 == ~t1_pc~0); 6756#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 6757#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 6664#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 6665#L613 assume !(0 != activate_threads_~tmp___0~0); 6894#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 6779#L266 assume !(1 == ~t2_pc~0); 6780#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 6782#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 6783#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 6503#L621 assume !(0 != activate_threads_~tmp___1~0); 6504#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 6510#L285 assume !(1 == ~t3_pc~0); 6501#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 6502#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 6513#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 6691#L629 assume !(0 != activate_threads_~tmp___2~0); 6784#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 6785#L304 assume !(1 == ~t4_pc~0); 6800#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 6801#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 6817#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 6568#L637 assume !(0 != activate_threads_~tmp___3~0); 6569#L637-2 assume !(1 == ~M_E~0); 6570#L545-1 assume !(1 == ~T1_E~0); 6690#L550-1 assume 1 == ~T2_E~0;~T2_E~0 := 2; 6514#L555-1 assume !(1 == ~T3_E~0); 6515#L560-1 assume !(1 == ~T4_E~0); 6572#L565-1 assume !(1 == ~E_1~0); 6575#L570-1 assume !(1 == ~E_2~0); 6836#L575-1 assume !(1 == ~E_3~0); 6869#L580-1 assume !(1 == ~E_4~0); 6895#L766-1 [2019-11-15 23:58:55,680 INFO L793 eck$LassoCheckResult]: Loop: 6895#L766-1 assume !false; 7349#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 7348#L467 assume !false; 7302#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 7026#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 7016#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 7014#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 7011#L406 assume !(0 != eval_~tmp~0); 7012#L482 start_simulation_~kernel_st~0 := 2; 7608#L324-1 start_simulation_~kernel_st~0 := 3; 7606#L492-2 assume !(0 == ~M_E~0); 7604#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 7603#L497-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 7602#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 7601#L507-3 assume !(0 == ~T4_E~0); 7600#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 7599#L517-3 assume 0 == ~E_2~0;~E_2~0 := 1; 7598#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 7597#L527-3 assume !(0 == ~E_4~0); 7521#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 7520#L228-15 assume !(1 == ~m_pc~0); 7518#L228-17 is_master_triggered_~__retres1~0 := 0; 7517#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 7516#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 7515#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 7514#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 7513#L247-15 assume !(1 == ~t1_pc~0); 7512#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 7511#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 7510#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 7509#L613-15 assume !(0 != activate_threads_~tmp___0~0); 7508#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 7507#L266-15 assume 1 == ~t2_pc~0; 7475#L267-5 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2 := 1; 7474#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 6847#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 6733#L621-15 assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 6734#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 7339#L285-15 assume !(1 == ~t3_pc~0); 7340#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 7450#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 7448#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 6902#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 6892#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 6773#L304-15 assume 1 == ~t4_pc~0; 6774#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 6777#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 6806#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 6497#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 6498#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 6507#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 6639#L550-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 6715#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 6544#L560-3 assume !(1 == ~T4_E~0); 6545#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 6577#L570-3 assume !(1 == ~E_2~0); 6848#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 6872#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 6791#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 6792#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 7403#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 7401#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 7398#L785 assume !(0 == start_simulation_~tmp~3); 7395#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 7384#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 7380#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 7378#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 7376#L740 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 7375#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 7374#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 7372#L798 assume !(0 != start_simulation_~tmp___0~1); 6895#L766-1 [2019-11-15 23:58:55,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:55,680 INFO L82 PathProgramCache]: Analyzing trace with hash -994144023, now seen corresponding path program 1 times [2019-11-15 23:58:55,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:55,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519836702] [2019-11-15 23:58:55,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:55,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519836702] [2019-11-15 23:58:55,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:55,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:58:55,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444705698] [2019-11-15 23:58:55,705 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:58:55,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:55,705 INFO L82 PathProgramCache]: Analyzing trace with hash -434894238, now seen corresponding path program 1 times [2019-11-15 23:58:55,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:55,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368382808] [2019-11-15 23:58:55,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:55,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368382808] [2019-11-15 23:58:55,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:55,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:55,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210976286] [2019-11-15 23:58:55,730 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:55,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:55,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:58:55,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:58:55,730 INFO L87 Difference]: Start difference. First operand 1117 states and 1649 transitions. cyclomatic complexity: 536 Second operand 3 states. [2019-11-15 23:58:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:55,755 INFO L93 Difference]: Finished difference Result 1117 states and 1635 transitions. [2019-11-15 23:58:55,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:58:55,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1117 states and 1635 transitions. [2019-11-15 23:58:55,764 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1050 [2019-11-15 23:58:55,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1117 states to 1117 states and 1635 transitions. [2019-11-15 23:58:55,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1117 [2019-11-15 23:58:55,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1117 [2019-11-15 23:58:55,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1117 states and 1635 transitions. [2019-11-15 23:58:55,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:55,778 INFO L688 BuchiCegarLoop]: Abstraction has 1117 states and 1635 transitions. [2019-11-15 23:58:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states and 1635 transitions. [2019-11-15 23:58:55,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2019-11-15 23:58:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2019-11-15 23:58:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1635 transitions. [2019-11-15 23:58:55,800 INFO L711 BuchiCegarLoop]: Abstraction has 1117 states and 1635 transitions. [2019-11-15 23:58:55,800 INFO L591 BuchiCegarLoop]: Abstraction has 1117 states and 1635 transitions. [2019-11-15 23:58:55,800 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:58:55,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1117 states and 1635 transitions. [2019-11-15 23:58:55,806 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1050 [2019-11-15 23:58:55,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:55,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:55,812 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, 1, 1, 1, 1, 1, 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-11-15 23:58:55,812 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, 1, 1, 1, 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-11-15 23:58:55,813 INFO L791 eck$LassoCheckResult]: Stem: 8943#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 8760#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 8761#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 8984#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 8985#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 8907#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 8908#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 8939#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 8763#L351-1 assume !(0 == ~M_E~0); 8764#L492-1 assume !(0 == ~T1_E~0); 9033#L497-1 assume !(0 == ~T2_E~0); 9034#L502-1 assume !(0 == ~T3_E~0); 9060#L507-1 assume !(0 == ~T4_E~0); 8937#L512-1 assume !(0 == ~E_1~0); 8938#L517-1 assume !(0 == ~E_2~0); 8957#L522-1 assume !(0 == ~E_3~0); 8780#L527-1 assume !(0 == ~E_4~0); 8781#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 8815#L228 assume !(1 == ~m_pc~0); 8825#L228-2 is_master_triggered_~__retres1~0 := 0; 8824#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8826#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8827#L605 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 8976#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 8981#L247 assume !(1 == ~t1_pc~0); 8994#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 8995#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8903#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 8904#L613 assume !(0 != activate_threads_~tmp___0~0); 9138#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 9018#L266 assume !(1 == ~t2_pc~0); 9019#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 9021#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 9022#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 8745#L621 assume !(0 != activate_threads_~tmp___1~0); 8746#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 8750#L285 assume !(1 == ~t3_pc~0); 8741#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 8742#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 8753#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 8934#L629 assume !(0 != activate_threads_~tmp___2~0); 9023#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 9024#L304 assume !(1 == ~t4_pc~0); 9040#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 9041#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 9057#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 8807#L637 assume !(0 != activate_threads_~tmp___3~0); 8808#L637-2 assume !(1 == ~M_E~0); 8809#L545-1 assume !(1 == ~T1_E~0); 8933#L550-1 assume !(1 == ~T2_E~0); 8756#L555-1 assume !(1 == ~T3_E~0); 8757#L560-1 assume !(1 == ~T4_E~0); 8811#L565-1 assume !(1 == ~E_1~0); 8814#L570-1 assume !(1 == ~E_2~0); 9073#L575-1 assume !(1 == ~E_3~0); 9115#L580-1 assume !(1 == ~E_4~0); 9139#L766-1 [2019-11-15 23:58:55,813 INFO L793 eck$LassoCheckResult]: Loop: 9139#L766-1 assume !false; 9696#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 9694#L467 assume !false; 9693#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 9691#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 9683#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 9678#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 9674#L406 assume !(0 != eval_~tmp~0); 9675#L482 start_simulation_~kernel_st~0 := 2; 9719#L324-1 start_simulation_~kernel_st~0 := 3; 9717#L492-2 assume !(0 == ~M_E~0); 9715#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 9713#L497-3 assume !(0 == ~T2_E~0); 9711#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 9709#L507-3 assume !(0 == ~T4_E~0); 9706#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 9704#L517-3 assume 0 == ~E_2~0;~E_2~0 := 1; 9702#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 9700#L527-3 assume !(0 == ~E_4~0); 9698#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 9685#L228-15 assume !(1 == ~m_pc~0); 9680#L228-17 is_master_triggered_~__retres1~0 := 0; 9677#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8844#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8845#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 8913#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 8927#L247-15 assume !(1 == ~t1_pc~0); 8931#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 9795#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 9793#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 9791#L613-15 assume !(0 != activate_threads_~tmp___0~0); 9789#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 9787#L266-15 assume 1 == ~t2_pc~0; 9784#L267-5 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2 := 1; 9782#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 9779#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 9777#L621-15 assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 9775#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 9773#L285-15 assume !(1 == ~t3_pc~0); 9771#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 9769#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 9767#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 9765#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 9763#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 9761#L304-15 assume 1 == ~t4_pc~0; 9758#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 9756#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 9754#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 9753#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 9752#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 9751#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 9750#L550-3 assume !(1 == ~T2_E~0); 9744#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 9742#L560-3 assume !(1 == ~T4_E~0); 9740#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 9738#L570-3 assume !(1 == ~E_2~0); 9736#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 9735#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 9734#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 9731#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 9728#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 9727#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 9725#L785 assume !(0 == start_simulation_~tmp~3); 9726#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 9747#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 9743#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 9741#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 9739#L740 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 9737#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 9724#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 9723#L798 assume !(0 != start_simulation_~tmp___0~1); 9139#L766-1 [2019-11-15 23:58:55,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:55,813 INFO L82 PathProgramCache]: Analyzing trace with hash 780863339, now seen corresponding path program 1 times [2019-11-15 23:58:55,813 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:55,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65184918] [2019-11-15 23:58:55,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:55,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:55,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65184918] [2019-11-15 23:58:55,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:55,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:58:55,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825217960] [2019-11-15 23:58:55,901 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:58:55,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:55,901 INFO L82 PathProgramCache]: Analyzing trace with hash -691842910, now seen corresponding path program 1 times [2019-11-15 23:58:55,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:55,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262202625] [2019-11-15 23:58:55,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:55,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:55,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262202625] [2019-11-15 23:58:55,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:55,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:55,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058795243] [2019-11-15 23:58:55,928 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:55,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:55,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:58:55,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:58:55,929 INFO L87 Difference]: Start difference. First operand 1117 states and 1635 transitions. cyclomatic complexity: 522 Second operand 5 states. [2019-11-15 23:58:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:56,135 INFO L93 Difference]: Finished difference Result 3126 states and 4538 transitions. [2019-11-15 23:58:56,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:58:56,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3126 states and 4538 transitions. [2019-11-15 23:58:56,160 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2970 [2019-11-15 23:58:56,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3126 states to 3126 states and 4538 transitions. [2019-11-15 23:58:56,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3126 [2019-11-15 23:58:56,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3126 [2019-11-15 23:58:56,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3126 states and 4538 transitions. [2019-11-15 23:58:56,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:56,194 INFO L688 BuchiCegarLoop]: Abstraction has 3126 states and 4538 transitions. [2019-11-15 23:58:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states and 4538 transitions. [2019-11-15 23:58:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 1180. [2019-11-15 23:58:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-11-15 23:58:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1698 transitions. [2019-11-15 23:58:56,226 INFO L711 BuchiCegarLoop]: Abstraction has 1180 states and 1698 transitions. [2019-11-15 23:58:56,226 INFO L591 BuchiCegarLoop]: Abstraction has 1180 states and 1698 transitions. [2019-11-15 23:58:56,226 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 23:58:56,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1180 states and 1698 transitions. [2019-11-15 23:58:56,232 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1110 [2019-11-15 23:58:56,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:56,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:56,234 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, 1, 1, 1, 1, 1, 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-11-15 23:58:56,234 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, 1, 1, 1, 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-11-15 23:58:56,234 INFO L791 eck$LassoCheckResult]: Stem: 13201#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 13014#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 13015#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 13245#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 13246#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 13165#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 13166#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 13196#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 13018#L351-1 assume !(0 == ~M_E~0); 13019#L492-1 assume !(0 == ~T1_E~0); 13294#L497-1 assume !(0 == ~T2_E~0); 13295#L502-1 assume !(0 == ~T3_E~0); 13322#L507-1 assume !(0 == ~T4_E~0); 13194#L512-1 assume !(0 == ~E_1~0); 13195#L517-1 assume !(0 == ~E_2~0); 13216#L522-1 assume !(0 == ~E_3~0); 13036#L527-1 assume !(0 == ~E_4~0); 13037#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 13071#L228 assume !(1 == ~m_pc~0); 13080#L228-2 is_master_triggered_~__retres1~0 := 0; 13392#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 13393#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 13238#L605 assume !(0 != activate_threads_~tmp~1); 13239#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 13243#L247 assume !(1 == ~t1_pc~0); 13258#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 13259#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 13160#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 13161#L613 assume !(0 != activate_threads_~tmp___0~0); 13415#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 13280#L266 assume !(1 == ~t2_pc~0); 13281#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 13283#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 13284#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 12999#L621 assume !(0 != activate_threads_~tmp___1~0); 13000#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 13006#L285 assume !(1 == ~t3_pc~0); 12997#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 12998#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 13007#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 13191#L629 assume !(0 != activate_threads_~tmp___2~0); 13285#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 13286#L304 assume !(1 == ~t4_pc~0); 13301#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 13302#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 13319#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 13061#L637 assume !(0 != activate_threads_~tmp___3~0); 13062#L637-2 assume !(1 == ~M_E~0); 13065#L545-1 assume !(1 == ~T1_E~0); 13190#L550-1 assume !(1 == ~T2_E~0); 13010#L555-1 assume !(1 == ~T3_E~0); 13011#L560-1 assume !(1 == ~T4_E~0); 13067#L565-1 assume !(1 == ~E_1~0); 13070#L570-1 assume !(1 == ~E_2~0); 13335#L575-1 assume !(1 == ~E_3~0); 13379#L580-1 assume !(1 == ~E_4~0); 13416#L766-1 [2019-11-15 23:58:56,234 INFO L793 eck$LassoCheckResult]: Loop: 13416#L766-1 assume !false; 13278#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 13077#L467 assume !false; 13147#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 13148#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 13086#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 13151#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 13053#L406 assume !(0 != eval_~tmp~0); 13055#L482 start_simulation_~kernel_st~0 := 2; 14135#L324-1 start_simulation_~kernel_st~0 := 3; 14133#L492-2 assume !(0 == ~M_E~0); 14131#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 14129#L497-3 assume !(0 == ~T2_E~0); 14126#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 13324#L507-3 assume !(0 == ~T4_E~0); 13142#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 13143#L517-3 assume 0 == ~E_2~0;~E_2~0 := 1; 13225#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 13051#L527-3 assume !(0 == ~E_4~0); 13052#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 13073#L228-15 assume 1 == ~m_pc~0; 13094#L229-5 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 13095#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 14142#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 14141#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 13169#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 13182#L247-15 assume !(1 == ~t1_pc~0); 13187#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 14140#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 14139#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 14138#L613-15 assume !(0 != activate_threads_~tmp___0~0); 14123#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 13395#L266-15 assume !(1 == ~t2_pc~0); 13345#L266-17 is_transmit2_triggered_~__retres1~2 := 0; 13344#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 13347#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 13236#L621-15 assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 13237#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 13242#L285-15 assume !(1 == ~t3_pc~0); 13260#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 13029#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 13030#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 13215#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 13414#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 13274#L304-15 assume 1 == ~t4_pc~0; 13275#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 13279#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 13307#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 12995#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 12996#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 13005#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 13138#L550-3 assume !(1 == ~T2_E~0); 13219#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 13040#L560-3 assume !(1 == ~T4_E~0); 13041#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 13072#L570-3 assume !(1 == ~E_2~0); 13348#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 13386#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 13292#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 13293#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 13098#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 13158#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 13113#L785 assume !(0 == start_simulation_~tmp~3); 13114#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 13122#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 13106#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 13995#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 13994#L740 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 13993#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 13992#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 13990#L798 assume !(0 != start_simulation_~tmp___0~1); 13416#L766-1 [2019-11-15 23:58:56,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:56,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1463119959, now seen corresponding path program 1 times [2019-11-15 23:58:56,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:56,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114708760] [2019-11-15 23:58:56,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:56,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:56,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:56,280 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:58:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:56,281 INFO L82 PathProgramCache]: Analyzing trace with hash 452069922, now seen corresponding path program 1 times [2019-11-15 23:58:56,282 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:56,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002581514] [2019-11-15 23:58:56,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:56,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:56,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:56,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002581514] [2019-11-15 23:58:56,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:56,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:56,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553577021] [2019-11-15 23:58:56,308 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:56,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:56,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:58:56,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:58:56,309 INFO L87 Difference]: Start difference. First operand 1180 states and 1698 transitions. cyclomatic complexity: 522 Second operand 3 states. [2019-11-15 23:58:56,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:56,393 INFO L93 Difference]: Finished difference Result 2078 states and 2956 transitions. [2019-11-15 23:58:56,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:58:56,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2078 states and 2956 transitions. [2019-11-15 23:58:56,407 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1955 [2019-11-15 23:58:56,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2078 states to 2078 states and 2956 transitions. [2019-11-15 23:58:56,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2078 [2019-11-15 23:58:56,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2078 [2019-11-15 23:58:56,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2078 states and 2956 transitions. [2019-11-15 23:58:56,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:56,428 INFO L688 BuchiCegarLoop]: Abstraction has 2078 states and 2956 transitions. [2019-11-15 23:58:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states and 2956 transitions. [2019-11-15 23:58:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2076. [2019-11-15 23:58:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2076 states. [2019-11-15 23:58:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2954 transitions. [2019-11-15 23:58:56,468 INFO L711 BuchiCegarLoop]: Abstraction has 2076 states and 2954 transitions. [2019-11-15 23:58:56,468 INFO L591 BuchiCegarLoop]: Abstraction has 2076 states and 2954 transitions. [2019-11-15 23:58:56,468 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 23:58:56,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2076 states and 2954 transitions. [2019-11-15 23:58:56,479 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1953 [2019-11-15 23:58:56,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:56,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:56,481 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, 1, 1, 1, 1, 1, 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-11-15 23:58:56,481 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, 1, 1, 1, 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-11-15 23:58:56,481 INFO L791 eck$LassoCheckResult]: Stem: 16466#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 16280#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 16281#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 16510#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 16511#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 16430#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 16431#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 16462#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 16284#L351-1 assume !(0 == ~M_E~0); 16285#L492-1 assume !(0 == ~T1_E~0); 16564#L497-1 assume !(0 == ~T2_E~0); 16565#L502-1 assume !(0 == ~T3_E~0); 16592#L507-1 assume !(0 == ~T4_E~0); 16460#L512-1 assume !(0 == ~E_1~0); 16461#L517-1 assume 0 == ~E_2~0;~E_2~0 := 1; 16478#L522-1 assume !(0 == ~E_3~0); 16303#L527-1 assume !(0 == ~E_4~0); 16304#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 16339#L228 assume !(1 == ~m_pc~0); 16740#L228-2 is_master_triggered_~__retres1~0 := 0; 16653#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 16349#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 16350#L605 assume !(0 != activate_threads_~tmp~1); 16502#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 16737#L247 assume !(1 == ~t1_pc~0); 16523#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 16524#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 16426#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 16427#L613 assume !(0 != activate_threads_~tmp___0~0); 16695#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 16729#L266 assume !(1 == ~t2_pc~0); 16728#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 16646#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 16647#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 16648#L621 assume !(0 != activate_threads_~tmp___1~0); 16271#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 16272#L285 assume !(1 == ~t3_pc~0); 16727#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 16726#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 16725#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 16724#L629 assume !(0 != activate_threads_~tmp___2~0); 16717#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 16589#L304 assume !(1 == ~t4_pc~0); 16571#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 16572#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 16588#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 16329#L637 assume !(0 != activate_threads_~tmp___3~0); 16330#L637-2 assume !(1 == ~M_E~0); 16333#L545-1 assume !(1 == ~T1_E~0); 16456#L550-1 assume !(1 == ~T2_E~0); 16276#L555-1 assume !(1 == ~T3_E~0); 16277#L560-1 assume !(1 == ~T4_E~0); 16335#L565-1 assume !(1 == ~E_1~0); 16338#L570-1 assume 1 == ~E_2~0;~E_2~0 := 2; 16608#L575-1 assume !(1 == ~E_3~0); 16642#L580-1 assume !(1 == ~E_4~0); 16465#L766-1 [2019-11-15 23:58:56,482 INFO L793 eck$LassoCheckResult]: Loop: 16465#L766-1 assume !false; 16547#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 16548#L467 assume !false; 17624#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 17517#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 17511#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 17509#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 17506#L406 assume !(0 != eval_~tmp~0); 17507#L482 start_simulation_~kernel_st~0 := 2; 18174#L324-1 start_simulation_~kernel_st~0 := 3; 18172#L492-2 assume !(0 == ~M_E~0); 18170#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 18168#L497-3 assume !(0 == ~T2_E~0); 18166#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 18164#L507-3 assume !(0 == ~T4_E~0); 18162#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 18161#L517-3 assume !(0 == ~E_2~0); 18160#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 18158#L527-3 assume !(0 == ~E_4~0); 18157#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 18156#L228-15 assume !(1 == ~m_pc~0); 18153#L228-17 is_master_triggered_~__retres1~0 := 0; 18151#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 18149#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 18147#L605-15 assume !(0 != activate_threads_~tmp~1); 18144#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 18142#L247-15 assume !(1 == ~t1_pc~0); 18140#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 18138#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 18134#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 18132#L613-15 assume !(0 != activate_threads_~tmp___0~0); 18131#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 18130#L266-15 assume !(1 == ~t2_pc~0); 18128#L266-17 is_transmit2_triggered_~__retres1~2 := 0; 18126#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 18124#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 18121#L621-15 assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 18116#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 18111#L285-15 assume !(1 == ~t3_pc~0); 18106#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 18101#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 18098#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 18095#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 18093#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 18091#L304-15 assume 1 == ~t4_pc~0; 18087#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 18084#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 18081#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 18078#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 18072#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 18068#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 18063#L550-3 assume !(1 == ~T2_E~0); 18058#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 18053#L560-3 assume !(1 == ~T4_E~0); 18049#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 17984#L570-3 assume !(1 == ~E_2~0); 16619#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 16650#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 16562#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 16563#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 16365#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 16424#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 16380#L785 assume !(0 == start_simulation_~tmp~3); 16381#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 16389#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 16373#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 16428#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 16587#L740 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 16336#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 16337#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 16464#L798 assume !(0 != start_simulation_~tmp___0~1); 16465#L766-1 [2019-11-15 23:58:56,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:56,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1711268375, now seen corresponding path program 1 times [2019-11-15 23:58:56,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:56,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45914773] [2019-11-15 23:58:56,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:56,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:56,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:56,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45914773] [2019-11-15 23:58:56,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:56,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:58:56,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256647539] [2019-11-15 23:58:56,505 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:58:56,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:56,505 INFO L82 PathProgramCache]: Analyzing trace with hash -615074265, now seen corresponding path program 1 times [2019-11-15 23:58:56,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:56,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2715859] [2019-11-15 23:58:56,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:56,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:56,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:56,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2715859] [2019-11-15 23:58:56,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:56,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:58:56,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529458665] [2019-11-15 23:58:56,601 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:56,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:56,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:58:56,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:58:56,602 INFO L87 Difference]: Start difference. First operand 2076 states and 2954 transitions. cyclomatic complexity: 882 Second operand 3 states. [2019-11-15 23:58:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:56,662 INFO L93 Difference]: Finished difference Result 1180 states and 1663 transitions. [2019-11-15 23:58:56,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:58:56,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1180 states and 1663 transitions. [2019-11-15 23:58:56,667 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1110 [2019-11-15 23:58:56,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1180 states to 1180 states and 1663 transitions. [2019-11-15 23:58:56,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1180 [2019-11-15 23:58:56,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1180 [2019-11-15 23:58:56,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1180 states and 1663 transitions. [2019-11-15 23:58:56,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:56,679 INFO L688 BuchiCegarLoop]: Abstraction has 1180 states and 1663 transitions. [2019-11-15 23:58:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states and 1663 transitions. [2019-11-15 23:58:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2019-11-15 23:58:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-11-15 23:58:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1663 transitions. [2019-11-15 23:58:56,698 INFO L711 BuchiCegarLoop]: Abstraction has 1180 states and 1663 transitions. [2019-11-15 23:58:56,698 INFO L591 BuchiCegarLoop]: Abstraction has 1180 states and 1663 transitions. [2019-11-15 23:58:56,698 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 23:58:56,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1180 states and 1663 transitions. [2019-11-15 23:58:56,702 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1110 [2019-11-15 23:58:56,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:56,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:56,703 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, 1, 1, 1, 1, 1, 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-11-15 23:58:56,703 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, 1, 1, 1, 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-11-15 23:58:56,703 INFO L791 eck$LassoCheckResult]: Stem: 19734#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 19551#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 19552#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 19777#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 19778#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 19698#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 19699#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 19731#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 19554#L351-1 assume !(0 == ~M_E~0); 19555#L492-1 assume !(0 == ~T1_E~0); 19826#L497-1 assume !(0 == ~T2_E~0); 19827#L502-1 assume !(0 == ~T3_E~0); 19852#L507-1 assume !(0 == ~T4_E~0); 19728#L512-1 assume !(0 == ~E_1~0); 19729#L517-1 assume !(0 == ~E_2~0); 19747#L522-1 assume !(0 == ~E_3~0); 19571#L527-1 assume !(0 == ~E_4~0); 19572#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 19606#L228 assume !(1 == ~m_pc~0); 19615#L228-2 is_master_triggered_~__retres1~0 := 0; 19901#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 19616#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 19617#L605 assume !(0 != activate_threads_~tmp~1); 19768#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 19773#L247 assume !(1 == ~t1_pc~0); 19789#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 19790#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 19694#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 19695#L613 assume !(0 != activate_threads_~tmp___0~0); 19922#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 19811#L266 assume !(1 == ~t2_pc~0); 19812#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 19814#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 19815#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 19536#L621 assume !(0 != activate_threads_~tmp___1~0); 19537#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 19541#L285 assume !(1 == ~t3_pc~0); 19532#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 19533#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 19544#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 19727#L629 assume !(0 != activate_threads_~tmp___2~0); 19816#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 19817#L304 assume !(1 == ~t4_pc~0); 19832#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 19833#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 19849#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 19598#L637 assume !(0 != activate_threads_~tmp___3~0); 19599#L637-2 assume !(1 == ~M_E~0); 19600#L545-1 assume !(1 == ~T1_E~0); 19724#L550-1 assume !(1 == ~T2_E~0); 19547#L555-1 assume !(1 == ~T3_E~0); 19548#L560-1 assume !(1 == ~T4_E~0); 19602#L565-1 assume !(1 == ~E_1~0); 19605#L570-1 assume !(1 == ~E_2~0); 19863#L575-1 assume !(1 == ~E_3~0); 19895#L580-1 assume !(1 == ~E_4~0); 19733#L766-1 [2019-11-15 23:58:56,704 INFO L793 eck$LassoCheckResult]: Loop: 19733#L766-1 assume !false; 19810#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 19612#L467 assume !false; 19681#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 19682#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 19620#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 19685#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 19590#L406 assume !(0 != eval_~tmp~0); 19592#L482 start_simulation_~kernel_st~0 := 2; 20704#L324-1 start_simulation_~kernel_st~0 := 3; 20703#L492-2 assume !(0 == ~M_E~0); 20702#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 20701#L497-3 assume !(0 == ~T2_E~0); 20700#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 20699#L507-3 assume !(0 == ~T4_E~0); 19676#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 19677#L517-3 assume !(0 == ~E_2~0); 20674#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 20673#L527-3 assume !(0 == ~E_4~0); 20579#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 20578#L228-15 assume !(1 == ~m_pc~0); 20576#L228-17 is_master_triggered_~__retres1~0 := 0; 20574#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 20572#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 20571#L605-15 assume !(0 != activate_threads_~tmp~1); 20569#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 20548#L247-15 assume !(1 == ~t1_pc~0); 20519#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 20515#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 20513#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 20511#L613-15 assume !(0 != activate_threads_~tmp___0~0); 20509#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 20506#L266-15 assume !(1 == ~t2_pc~0); 20503#L266-17 is_transmit2_triggered_~__retres1~2 := 0; 20501#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 20499#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 20497#L621-15 assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 20495#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 20493#L285-15 assume !(1 == ~t3_pc~0); 20491#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 20488#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 20486#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 20484#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 20482#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 20480#L304-15 assume 1 == ~t4_pc~0; 20477#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 20475#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 20473#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 20471#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 20469#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 20467#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 20465#L550-3 assume !(1 == ~T2_E~0); 20463#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 20460#L560-3 assume !(1 == ~T4_E~0); 20458#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 20456#L570-3 assume !(1 == ~E_2~0); 20454#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 20452#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 20450#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 20443#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 20439#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 20437#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 20435#L785 assume !(0 == start_simulation_~tmp~3); 19656#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 19657#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 19640#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 19696#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 19848#L740 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 19603#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 19604#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 19732#L798 assume !(0 != start_simulation_~tmp___0~1); 19733#L766-1 [2019-11-15 23:58:56,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:56,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1463119959, now seen corresponding path program 2 times [2019-11-15 23:58:56,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:56,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612047880] [2019-11-15 23:58:56,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:56,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:56,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:56,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:56,726 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:58:56,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:56,726 INFO L82 PathProgramCache]: Analyzing trace with hash -615074265, now seen corresponding path program 2 times [2019-11-15 23:58:56,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:56,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146619149] [2019-11-15 23:58:56,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:56,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:56,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:56,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146619149] [2019-11-15 23:58:56,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:56,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:58:56,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433765840] [2019-11-15 23:58:56,836 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:56,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:56,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:58:56,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:58:56,837 INFO L87 Difference]: Start difference. First operand 1180 states and 1663 transitions. cyclomatic complexity: 487 Second operand 11 states. [2019-11-15 23:58:57,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:57,063 INFO L93 Difference]: Finished difference Result 2050 states and 2853 transitions. [2019-11-15 23:58:57,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:58:57,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 2853 transitions. [2019-11-15 23:58:57,073 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1972 [2019-11-15 23:58:57,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 2853 transitions. [2019-11-15 23:58:57,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2019-11-15 23:58:57,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2019-11-15 23:58:57,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 2853 transitions. [2019-11-15 23:58:57,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:57,093 INFO L688 BuchiCegarLoop]: Abstraction has 2050 states and 2853 transitions. [2019-11-15 23:58:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 2853 transitions. [2019-11-15 23:58:57,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1192. [2019-11-15 23:58:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-11-15 23:58:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1675 transitions. [2019-11-15 23:58:57,119 INFO L711 BuchiCegarLoop]: Abstraction has 1192 states and 1675 transitions. [2019-11-15 23:58:57,119 INFO L591 BuchiCegarLoop]: Abstraction has 1192 states and 1675 transitions. [2019-11-15 23:58:57,119 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 23:58:57,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1192 states and 1675 transitions. [2019-11-15 23:58:57,122 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1122 [2019-11-15 23:58:57,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:57,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:57,124 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, 1, 1, 1, 1, 1, 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-11-15 23:58:57,124 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, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:58:57,124 INFO L791 eck$LassoCheckResult]: Stem: 22984#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 22802#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 22803#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 23024#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 23025#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 22951#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 22952#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 22979#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 22806#L351-1 assume !(0 == ~M_E~0); 22807#L492-1 assume !(0 == ~T1_E~0); 23072#L497-1 assume !(0 == ~T2_E~0); 23073#L502-1 assume !(0 == ~T3_E~0); 23101#L507-1 assume !(0 == ~T4_E~0); 22977#L512-1 assume !(0 == ~E_1~0); 22978#L517-1 assume !(0 == ~E_2~0); 22995#L522-1 assume !(0 == ~E_3~0); 22824#L527-1 assume !(0 == ~E_4~0); 22825#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 22858#L228 assume !(1 == ~m_pc~0); 22867#L228-2 is_master_triggered_~__retres1~0 := 0; 23172#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 23194#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 23019#L605 assume !(0 != activate_threads_~tmp~1); 23020#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 23022#L247 assume !(1 == ~t1_pc~0); 23035#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 23036#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 22947#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 22948#L613 assume !(0 != activate_threads_~tmp___0~0); 23180#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 23058#L266 assume !(1 == ~t2_pc~0); 23059#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 23061#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 23062#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 22787#L621 assume !(0 != activate_threads_~tmp___1~0); 22788#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 22794#L285 assume !(1 == ~t3_pc~0); 22785#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 22786#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 22795#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 22974#L629 assume !(0 != activate_threads_~tmp___2~0); 23063#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 23064#L304 assume !(1 == ~t4_pc~0); 23081#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 23082#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 23098#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 22848#L637 assume !(0 != activate_threads_~tmp___3~0); 22849#L637-2 assume !(1 == ~M_E~0); 22852#L545-1 assume !(1 == ~T1_E~0); 22973#L550-1 assume !(1 == ~T2_E~0); 22798#L555-1 assume !(1 == ~T3_E~0); 22799#L560-1 assume !(1 == ~T4_E~0); 22854#L565-1 assume !(1 == ~E_1~0); 22857#L570-1 assume !(1 == ~E_2~0); 23114#L575-1 assume !(1 == ~E_3~0); 23147#L580-1 assume !(1 == ~E_4~0); 23181#L766-1 [2019-11-15 23:58:57,124 INFO L793 eck$LassoCheckResult]: Loop: 23181#L766-1 assume !false; 23696#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 23695#L467 assume !false; 23468#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 23414#L364 assume !(0 == ~m_st~0); 23411#L368 assume !(0 == ~t1_st~0); 23412#L372 assume !(0 == ~t2_st~0); 23413#L376 assume !(0 == ~t3_st~0); 23410#L380 assume !(0 == ~t4_st~0);exists_runnable_thread_~__retres1~5 := 0; 23393#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 23385#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 23383#L406 assume !(0 != eval_~tmp~0); 23122#L482 start_simulation_~kernel_st~0 := 2; 23029#L324-1 start_simulation_~kernel_st~0 := 3; 23030#L492-2 assume !(0 == ~M_E~0); 23167#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 23046#L497-3 assume !(0 == ~T2_E~0); 23047#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 23096#L507-3 assume !(0 == ~T4_E~0); 22927#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 22928#L517-3 assume !(0 == ~E_2~0); 23492#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 22839#L527-3 assume !(0 == ~E_4~0); 22840#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 22860#L228-15 assume 1 == ~m_pc~0; 23489#L229-5 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 23487#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 23485#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 23483#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 23482#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 23481#L247-15 assume !(1 == ~t1_pc~0); 23480#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 23479#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 23478#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 23476#L613-15 assume !(0 != activate_threads_~tmp___0~0); 23474#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 23472#L266-15 assume !(1 == ~t2_pc~0); 23469#L266-17 is_transmit2_triggered_~__retres1~2 := 0; 23260#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 23261#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 23017#L621-15 assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 23018#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 23021#L285-15 assume !(1 == ~t3_pc~0); 23041#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 23857#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 23856#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 23855#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 23177#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 23052#L304-15 assume 1 == ~t4_pc~0; 23053#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 23057#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 23087#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 22783#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 22784#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 22793#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 22923#L550-3 assume !(1 == ~T2_E~0); 23843#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 23841#L560-3 assume !(1 == ~T4_E~0); 23839#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 23837#L570-3 assume !(1 == ~E_2~0); 23834#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 23832#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 23830#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 23826#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 23820#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 23742#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 23739#L785 assume !(0 == start_simulation_~tmp~3); 23736#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 23722#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 23718#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 23716#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 23714#L740 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 23712#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 23710#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 23708#L798 assume !(0 != start_simulation_~tmp___0~1); 23181#L766-1 [2019-11-15 23:58:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:57,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1463119959, now seen corresponding path program 3 times [2019-11-15 23:58:57,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:57,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968447720] [2019-11-15 23:58:57,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:57,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:57,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:57,158 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:58:57,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:57,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1470455504, now seen corresponding path program 1 times [2019-11-15 23:58:57,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:57,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092222764] [2019-11-15 23:58:57,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:57,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:57,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:57,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092222764] [2019-11-15 23:58:57,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:57,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:58:57,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551277810] [2019-11-15 23:58:57,218 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:57,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:57,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:58:57,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:58:57,219 INFO L87 Difference]: Start difference. First operand 1192 states and 1675 transitions. cyclomatic complexity: 487 Second operand 8 states. [2019-11-15 23:58:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:57,408 INFO L93 Difference]: Finished difference Result 3866 states and 5377 transitions. [2019-11-15 23:58:57,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:58:57,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3866 states and 5377 transitions. [2019-11-15 23:58:57,427 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 3772 [2019-11-15 23:58:57,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3866 states to 3866 states and 5377 transitions. [2019-11-15 23:58:57,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3866 [2019-11-15 23:58:57,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3866 [2019-11-15 23:58:57,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3866 states and 5377 transitions. [2019-11-15 23:58:57,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:57,463 INFO L688 BuchiCegarLoop]: Abstraction has 3866 states and 5377 transitions. [2019-11-15 23:58:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3866 states and 5377 transitions. [2019-11-15 23:58:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3866 to 1204. [2019-11-15 23:58:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-11-15 23:58:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1687 transitions. [2019-11-15 23:58:57,497 INFO L711 BuchiCegarLoop]: Abstraction has 1204 states and 1687 transitions. [2019-11-15 23:58:57,497 INFO L591 BuchiCegarLoop]: Abstraction has 1204 states and 1687 transitions. [2019-11-15 23:58:57,497 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 23:58:57,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1204 states and 1687 transitions. [2019-11-15 23:58:57,500 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1134 [2019-11-15 23:58:57,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:57,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:57,502 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, 1, 1, 1, 1, 1, 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-11-15 23:58:57,502 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, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:58:57,502 INFO L791 eck$LassoCheckResult]: Stem: 28066#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 27881#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 27882#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 28110#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 28111#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 28031#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 28032#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 28063#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 27884#L351-1 assume !(0 == ~M_E~0); 27885#L492-1 assume !(0 == ~T1_E~0); 28159#L497-1 assume !(0 == ~T2_E~0); 28160#L502-1 assume !(0 == ~T3_E~0); 28185#L507-1 assume !(0 == ~T4_E~0); 28059#L512-1 assume !(0 == ~E_1~0); 28060#L517-1 assume !(0 == ~E_2~0); 28080#L522-1 assume !(0 == ~E_3~0); 27902#L527-1 assume !(0 == ~E_4~0); 27903#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 27936#L228 assume !(1 == ~m_pc~0); 27945#L228-2 is_master_triggered_~__retres1~0 := 0; 28257#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 28274#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 28103#L605 assume !(0 != activate_threads_~tmp~1); 28104#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 28107#L247 assume !(1 == ~t1_pc~0); 28119#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 28120#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 28026#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 28027#L613 assume !(0 != activate_threads_~tmp___0~0); 28266#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 28144#L266 assume !(1 == ~t2_pc~0); 28145#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 28147#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 28148#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 27866#L621 assume !(0 != activate_threads_~tmp___1~0); 27867#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 27871#L285 assume !(1 == ~t3_pc~0); 27862#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 27863#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 27874#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 28058#L629 assume !(0 != activate_threads_~tmp___2~0); 28149#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 28150#L304 assume !(1 == ~t4_pc~0); 28165#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 28166#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 28182#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 27928#L637 assume !(0 != activate_threads_~tmp___3~0); 27929#L637-2 assume !(1 == ~M_E~0); 27930#L545-1 assume !(1 == ~T1_E~0); 28055#L550-1 assume !(1 == ~T2_E~0); 27877#L555-1 assume !(1 == ~T3_E~0); 27878#L560-1 assume !(1 == ~T4_E~0); 27932#L565-1 assume !(1 == ~E_1~0); 27935#L570-1 assume !(1 == ~E_2~0); 28196#L575-1 assume !(1 == ~E_3~0); 28230#L580-1 assume !(1 == ~E_4~0); 28267#L766-1 [2019-11-15 23:58:57,503 INFO L793 eck$LassoCheckResult]: Loop: 28267#L766-1 assume !false; 28545#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 28523#L467 assume !false; 28442#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 28443#L364 assume !(0 == ~m_st~0); 28435#L368 assume !(0 == ~t1_st~0); 28436#L372 assume !(0 == ~t2_st~0); 28429#L376 assume !(0 == ~t3_st~0); 28430#L380 assume !(0 == ~t4_st~0);exists_runnable_thread_~__retres1~5 := 0; 28420#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 28421#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 28391#L406 assume !(0 != eval_~tmp~0); 28392#L482 start_simulation_~kernel_st~0 := 2; 28367#L324-1 start_simulation_~kernel_st~0 := 3; 28368#L492-2 assume !(0 == ~M_E~0); 28359#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 28360#L497-3 assume !(0 == ~T2_E~0); 28349#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 28350#L507-3 assume !(0 == ~T4_E~0); 28518#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 28087#L517-3 assume !(0 == ~E_2~0); 28088#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 28122#L527-3 assume !(0 == ~E_4~0); 28516#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 28515#L228-15 assume 1 == ~m_pc~0; 27958#L229-5 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 27959#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 27964#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 27965#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 28036#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 28047#L247-15 assume !(1 == ~t1_pc~0); 28053#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 28097#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 28098#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 28193#L613-15 assume !(0 != activate_threads_~tmp___0~0); 28223#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 28224#L266-15 assume !(1 == ~t2_pc~0); 28854#L266-17 is_transmit2_triggered_~__retres1~2 := 0; 28853#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 28204#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 28205#L621-15 assume 0 != activate_threads_~tmp___1~0;~t2_st~0 := 0; 28852#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 28851#L285-15 assume !(1 == ~t3_pc~0); 28850#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 28849#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 28848#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 28847#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 28846#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 28845#L304-15 assume 1 == ~t4_pc~0; 28843#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 28842#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 28841#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 28840#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 28839#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 28838#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 28837#L550-3 assume !(1 == ~T2_E~0); 28836#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 28835#L560-3 assume !(1 == ~T4_E~0); 28834#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 28833#L570-3 assume !(1 == ~E_2~0); 28832#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 28831#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 28830#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 28827#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 28816#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 28812#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 28803#L785 assume !(0 == start_simulation_~tmp~3); 27986#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 27987#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 28577#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 28575#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 28573#L740 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 28571#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 28558#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 28556#L798 assume !(0 != start_simulation_~tmp___0~1); 28267#L766-1 [2019-11-15 23:58:57,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:57,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1463119959, now seen corresponding path program 4 times [2019-11-15 23:58:57,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:57,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605546160] [2019-11-15 23:58:57,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:57,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:57,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:57,521 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:58:57,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1470515086, now seen corresponding path program 1 times [2019-11-15 23:58:57,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:57,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423206038] [2019-11-15 23:58:57,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:57,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:57,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:57,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423206038] [2019-11-15 23:58:57,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:57,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:58:57,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329450825] [2019-11-15 23:58:57,570 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:57,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:57,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:58:57,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:58:57,571 INFO L87 Difference]: Start difference. First operand 1204 states and 1687 transitions. cyclomatic complexity: 487 Second operand 5 states. [2019-11-15 23:58:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:57,706 INFO L93 Difference]: Finished difference Result 1655 states and 2315 transitions. [2019-11-15 23:58:57,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:58:57,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1655 states and 2315 transitions. [2019-11-15 23:58:57,713 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1581 [2019-11-15 23:58:57,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1655 states to 1655 states and 2315 transitions. [2019-11-15 23:58:57,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1655 [2019-11-15 23:58:57,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1655 [2019-11-15 23:58:57,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1655 states and 2315 transitions. [2019-11-15 23:58:57,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:57,727 INFO L688 BuchiCegarLoop]: Abstraction has 1655 states and 2315 transitions. [2019-11-15 23:58:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states and 2315 transitions. [2019-11-15 23:58:57,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1210. [2019-11-15 23:58:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-11-15 23:58:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1674 transitions. [2019-11-15 23:58:57,749 INFO L711 BuchiCegarLoop]: Abstraction has 1210 states and 1674 transitions. [2019-11-15 23:58:57,750 INFO L591 BuchiCegarLoop]: Abstraction has 1210 states and 1674 transitions. [2019-11-15 23:58:57,750 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-15 23:58:57,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1210 states and 1674 transitions. [2019-11-15 23:58:57,753 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1140 [2019-11-15 23:58:57,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:57,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:57,754 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, 1, 1, 1, 1, 1, 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-11-15 23:58:57,755 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, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:58:57,755 INFO L791 eck$LassoCheckResult]: Stem: 30942#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 30752#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 30753#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 30984#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 30985#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 30906#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 30907#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 30937#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 30756#L351-1 assume !(0 == ~M_E~0); 30757#L492-1 assume !(0 == ~T1_E~0); 31038#L497-1 assume !(0 == ~T2_E~0); 31039#L502-1 assume !(0 == ~T3_E~0); 31067#L507-1 assume !(0 == ~T4_E~0); 30935#L512-1 assume !(0 == ~E_1~0); 30936#L517-1 assume !(0 == ~E_2~0); 30957#L522-1 assume !(0 == ~E_3~0); 30775#L527-1 assume !(0 == ~E_4~0); 30776#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 30809#L228 assume !(1 == ~m_pc~0); 30819#L228-2 is_master_triggered_~__retres1~0 := 0; 31149#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 31178#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 30977#L605 assume !(0 != activate_threads_~tmp~1); 30978#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 30980#L247 assume !(1 == ~t1_pc~0); 30998#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 30999#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 30901#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 30902#L613 assume !(0 != activate_threads_~tmp___0~0); 31157#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 31024#L266 assume !(1 == ~t2_pc~0); 31025#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 31027#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 31028#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 30737#L621 assume !(0 != activate_threads_~tmp___1~0); 30738#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 30744#L285 assume !(1 == ~t3_pc~0); 30735#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 30736#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 30745#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 30932#L629 assume !(0 != activate_threads_~tmp___2~0); 31029#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 31030#L304 assume !(1 == ~t4_pc~0); 31045#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 31046#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 31064#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 30799#L637 assume !(0 != activate_threads_~tmp___3~0); 30800#L637-2 assume !(1 == ~M_E~0); 30803#L545-1 assume !(1 == ~T1_E~0); 30931#L550-1 assume !(1 == ~T2_E~0); 30748#L555-1 assume !(1 == ~T3_E~0); 30749#L560-1 assume !(1 == ~T4_E~0); 30805#L565-1 assume !(1 == ~E_1~0); 30808#L570-1 assume !(1 == ~E_2~0); 31083#L575-1 assume !(1 == ~E_3~0); 31113#L580-1 assume !(1 == ~E_4~0); 31158#L766-1 [2019-11-15 23:58:57,755 INFO L793 eck$LassoCheckResult]: Loop: 31158#L766-1 assume !false; 31729#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 31722#L467 assume !false; 31676#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 31673#L364 assume !(0 == ~m_st~0); 31670#L368 assume !(0 == ~t1_st~0); 31671#L372 assume !(0 == ~t2_st~0); 31672#L376 assume !(0 == ~t3_st~0); 31668#L380 assume !(0 == ~t4_st~0);exists_runnable_thread_~__retres1~5 := 0; 31669#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 31662#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 31663#L406 assume !(0 != eval_~tmp~0); 31091#L482 start_simulation_~kernel_st~0 := 2; 30989#L324-1 start_simulation_~kernel_st~0 := 3; 30990#L492-2 assume !(0 == ~M_E~0); 31141#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 31010#L497-3 assume !(0 == ~T2_E~0); 31011#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 31059#L507-3 assume !(0 == ~T4_E~0); 30881#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 30882#L517-3 assume !(0 == ~E_2~0); 30966#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 31001#L527-3 assume !(0 == ~E_4~0); 30811#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 30812#L228-15 assume 1 == ~m_pc~0; 30832#L229-5 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 30833#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 31915#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 31912#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 30911#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 30925#L247-15 assume !(1 == ~t1_pc~0); 30919#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 30920#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 30971#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 31080#L613-15 assume !(0 != activate_threads_~tmp___0~0); 31109#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 31110#L266-15 assume !(1 == ~t2_pc~0); 31090#L266-17 is_transmit2_triggered_~__retres1~2 := 0; 31153#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 31159#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 31584#L621-15 assume !(0 != activate_threads_~tmp___1~0); 31583#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 31582#L285-15 assume !(1 == ~t3_pc~0); 31581#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 31580#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 31578#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 31177#L629-15 assume 0 != activate_threads_~tmp___2~0;~t3_st~0 := 0; 31154#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 31017#L304-15 assume 1 == ~t4_pc~0; 31018#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 31572#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 31571#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 31570#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 31569#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 31568#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 31567#L550-3 assume !(1 == ~T2_E~0); 31566#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 31564#L560-3 assume !(1 == ~T4_E~0); 31562#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 31560#L570-3 assume !(1 == ~E_2~0); 31557#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 31553#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 31550#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 31545#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 31540#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 31536#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 30851#L785 assume !(0 == start_simulation_~tmp~3); 30852#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 31758#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 31754#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 31752#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 31749#L740 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 31746#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 31744#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 31742#L798 assume !(0 != start_simulation_~tmp___0~1); 31158#L766-1 [2019-11-15 23:58:57,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:57,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1463119959, now seen corresponding path program 5 times [2019-11-15 23:58:57,756 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:57,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800065565] [2019-11-15 23:58:57,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:57,756 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:57,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:57,773 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:58:57,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:57,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1980446708, now seen corresponding path program 1 times [2019-11-15 23:58:57,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:57,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734880420] [2019-11-15 23:58:57,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:57,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:57,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:57,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734880420] [2019-11-15 23:58:57,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:57,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:58:57,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105093146] [2019-11-15 23:58:57,825 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:58:57,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:57,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:58:57,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:58:57,826 INFO L87 Difference]: Start difference. First operand 1210 states and 1674 transitions. cyclomatic complexity: 468 Second operand 5 states. [2019-11-15 23:58:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:57,978 INFO L93 Difference]: Finished difference Result 2087 states and 2893 transitions. [2019-11-15 23:58:57,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:58:57,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2087 states and 2893 transitions. [2019-11-15 23:58:57,986 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 2013 [2019-11-15 23:58:57,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2087 states to 2087 states and 2893 transitions. [2019-11-15 23:58:57,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2087 [2019-11-15 23:58:58,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2087 [2019-11-15 23:58:58,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2087 states and 2893 transitions. [2019-11-15 23:58:58,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:58:58,003 INFO L688 BuchiCegarLoop]: Abstraction has 2087 states and 2893 transitions. [2019-11-15 23:58:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states and 2893 transitions. [2019-11-15 23:58:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1243. [2019-11-15 23:58:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2019-11-15 23:58:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1697 transitions. [2019-11-15 23:58:58,028 INFO L711 BuchiCegarLoop]: Abstraction has 1243 states and 1697 transitions. [2019-11-15 23:58:58,028 INFO L591 BuchiCegarLoop]: Abstraction has 1243 states and 1697 transitions. [2019-11-15 23:58:58,028 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-15 23:58:58,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1243 states and 1697 transitions. [2019-11-15 23:58:58,031 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1173 [2019-11-15 23:58:58,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:58:58,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:58:58,033 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, 1, 1, 1, 1, 1, 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-11-15 23:58:58,033 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, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:58:58,033 INFO L791 eck$LassoCheckResult]: Stem: 34254#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 34066#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 34067#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 34299#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 34300#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 34218#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 34219#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 34251#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 34068#L351-1 assume !(0 == ~M_E~0); 34069#L492-1 assume !(0 == ~T1_E~0); 34357#L497-1 assume !(0 == ~T2_E~0); 34358#L502-1 assume !(0 == ~T3_E~0); 34385#L507-1 assume !(0 == ~T4_E~0); 34248#L512-1 assume !(0 == ~E_1~0); 34249#L517-1 assume !(0 == ~E_2~0); 34268#L522-1 assume !(0 == ~E_3~0); 34089#L527-1 assume !(0 == ~E_4~0); 34090#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 34123#L228 assume !(1 == ~m_pc~0); 34132#L228-2 is_master_triggered_~__retres1~0 := 0; 34454#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 34479#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 34290#L605 assume !(0 != activate_threads_~tmp~1); 34291#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 34294#L247 assume !(1 == ~t1_pc~0); 34313#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 34314#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 34213#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 34214#L613 assume !(0 != activate_threads_~tmp___0~0); 34463#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 34341#L266 assume !(1 == ~t2_pc~0); 34342#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 34344#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 34345#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 34049#L621 assume !(0 != activate_threads_~tmp___1~0); 34050#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 34056#L285 assume !(1 == ~t3_pc~0); 34047#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 34048#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 34059#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 34247#L629 assume !(0 != activate_threads_~tmp___2~0); 34346#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 34347#L304 assume !(1 == ~t4_pc~0); 34364#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 34365#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 34382#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 34115#L637 assume !(0 != activate_threads_~tmp___3~0); 34116#L637-2 assume !(1 == ~M_E~0); 34117#L545-1 assume !(1 == ~T1_E~0); 34244#L550-1 assume !(1 == ~T2_E~0); 34062#L555-1 assume !(1 == ~T3_E~0); 34063#L560-1 assume !(1 == ~T4_E~0); 34119#L565-1 assume !(1 == ~E_1~0); 34122#L570-1 assume !(1 == ~E_2~0); 34398#L575-1 assume !(1 == ~E_3~0); 34432#L580-1 assume !(1 == ~E_4~0); 34464#L766-1 [2019-11-15 23:58:58,034 INFO L793 eck$LassoCheckResult]: Loop: 34464#L766-1 assume !false; 34904#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 34903#L467 assume !false; 34902#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 34901#L364 assume !(0 == ~m_st~0); 34898#L368 assume !(0 == ~t1_st~0); 34899#L372 assume !(0 == ~t2_st~0); 34900#L376 assume !(0 == ~t3_st~0); 34896#L380 assume !(0 == ~t4_st~0);exists_runnable_thread_~__retres1~5 := 0; 34897#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 34816#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 34817#L406 assume !(0 != eval_~tmp~0); 35079#L482 start_simulation_~kernel_st~0 := 2; 35078#L324-1 start_simulation_~kernel_st~0 := 3; 35077#L492-2 assume !(0 == ~M_E~0); 35076#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 35075#L497-3 assume !(0 == ~T2_E~0); 35074#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 35073#L507-3 assume !(0 == ~T4_E~0); 35072#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 35071#L517-3 assume !(0 == ~E_2~0); 35070#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 35069#L527-3 assume !(0 == ~E_4~0); 35068#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 35067#L228-15 assume 1 == ~m_pc~0; 35065#L229-5 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 35063#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 35061#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 35059#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 34239#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 34240#L247-15 assume !(1 == ~t1_pc~0); 34235#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 34236#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 34284#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 34395#L613-15 assume !(0 != activate_threads_~tmp___0~0); 34427#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 34428#L266-15 assume !(1 == ~t2_pc~0); 34404#L266-17 is_transmit2_triggered_~__retres1~2 := 0; 34457#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 34407#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 34287#L621-15 assume !(0 != activate_threads_~tmp___1~0); 34288#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 34292#L285-15 assume !(1 == ~t3_pc~0); 34322#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 34992#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 34991#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 34990#L629-15 assume !(0 != activate_threads_~tmp___2~0); 34989#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 34988#L304-15 assume 1 == ~t4_pc~0; 34986#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 34984#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 34982#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 34980#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 34978#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 34976#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 34973#L550-3 assume !(1 == ~T2_E~0); 34971#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 34969#L560-3 assume !(1 == ~T4_E~0); 34967#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 34965#L570-3 assume !(1 == ~E_2~0); 34963#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 34961#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 34959#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 34954#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 34949#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 34946#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 34942#L785 assume !(0 == start_simulation_~tmp~3); 34939#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 34934#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 34930#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 34927#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 34924#L740 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 34919#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 34917#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 34912#L798 assume !(0 != start_simulation_~tmp___0~1); 34464#L766-1 [2019-11-15 23:58:58,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:58,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1463119959, now seen corresponding path program 6 times [2019-11-15 23:58:58,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:58,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402370102] [2019-11-15 23:58:58,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:58,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:58,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:58,051 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:58:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:58,051 INFO L82 PathProgramCache]: Analyzing trace with hash -928317194, now seen corresponding path program 1 times [2019-11-15 23:58:58,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:58,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846041206] [2019-11-15 23:58:58,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:58,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:58,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:58,073 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:58:58,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:58,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1060034638, now seen corresponding path program 1 times [2019-11-15 23:58:58,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:58,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578447398] [2019-11-15 23:58:58,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:58,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:58,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:58,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578447398] [2019-11-15 23:58:58,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:58,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:58:58,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981728401] [2019-11-15 23:58:58,786 WARN L191 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 144 [2019-11-15 23:58:59,040 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-15 23:58:59,054 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:58:59,055 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:58:59,055 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:58:59,055 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:58:59,055 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:58:59,055 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:58:59,055 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:58:59,056 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:58:59,056 INFO L131 ssoRankerPreferences]: Filename of dumped script: transmitter.04.cil.c_Iteration16_Loop [2019-11-15 23:58:59,056 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:58:59,056 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:58:59,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:58:59,900 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:58:59,901 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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) [2019-11-15 23:58:59,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:58:59,920 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:58:59,928 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:58:59,929 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret11=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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-11-15 23:58:59,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:58:59,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:58:59,970 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:58:59,970 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/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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-11-15 23:58:59,982 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:58:59,983 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:58:59,986 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:58:59,987 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: [] Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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-11-15 23:59:00,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:59:00,134 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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-11-15 23:59:00,153 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:59:00,153 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-11-15 23:59:00,168 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:59:00,170 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:59:00,170 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:59:00,170 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:59:00,170 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:59:00,171 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:59:00,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:59:00,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:59:00,171 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:59:00,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: transmitter.04.cil.c_Iteration16_Loop [2019-11-15 23:59:00,171 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:59:00,171 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:59:00,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:00,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:01,038 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:59:01,043 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:59:01,044 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-11-15 23:59:01,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:01,046 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:01,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:01,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:01,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:01,049 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:01,050 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:01,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:01,058 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-11-15 23:59:01,059 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:01,059 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:01,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:01,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:01,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:01,061 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:01,061 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:01,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:01,066 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-11-15 23:59:01,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:01,069 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:01,069 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:01,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:01,069 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:01,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:01,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:01,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:01,079 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-11-15 23:59:01,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:01,081 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:01,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:01,081 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:59:01,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:01,093 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:59:01,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:01,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:01,097 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-11-15 23:59:01,103 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:01,103 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:01,103 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:01,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:01,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:01,104 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:01,104 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:01,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:01,106 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-11-15 23:59:01,107 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:01,107 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:01,107 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:01,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:01,108 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:01,109 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:01,109 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:01,112 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:59:01,113 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:59:01,114 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:59:01,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:59:01,116 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:59:01,117 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:59:01,117 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~E_3~0) = -1*~E_3~0 + 1 Supporting invariants [] [2019-11-15 23:59:01,119 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:59:01,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:01,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:59:01,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:59:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:01,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:59:01,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:59:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:01,299 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-11-15 23:59:01,300 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1243 states and 1697 transitions. cyclomatic complexity: 458 Second operand 5 states. [2019-11-15 23:59:01,530 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1243 states and 1697 transitions. cyclomatic complexity: 458. Second operand 5 states. Result 4504 states and 6194 transitions. Complement of second has 5 states. [2019-11-15 23:59:01,533 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-11-15 23:59:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:59:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2019-11-15 23:59:01,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 920 transitions. Stem has 56 letters. Loop has 75 letters. [2019-11-15 23:59:01,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:59:01,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 920 transitions. Stem has 131 letters. Loop has 75 letters. [2019-11-15 23:59:01,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:59:01,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 920 transitions. Stem has 56 letters. Loop has 150 letters. [2019-11-15 23:59:01,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:59:01,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4504 states and 6194 transitions. [2019-11-15 23:59:01,583 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 3361 [2019-11-15 23:59:01,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4504 states to 4500 states and 6190 transitions. [2019-11-15 23:59:01,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3452 [2019-11-15 23:59:01,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3465 [2019-11-15 23:59:01,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4500 states and 6190 transitions. [2019-11-15 23:59:01,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:59:01,629 INFO L688 BuchiCegarLoop]: Abstraction has 4500 states and 6190 transitions. [2019-11-15 23:59:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states and 6190 transitions. [2019-11-15 23:59:01,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 3302. [2019-11-15 23:59:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3302 states. [2019-11-15 23:59:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4559 transitions. [2019-11-15 23:59:01,713 INFO L711 BuchiCegarLoop]: Abstraction has 3302 states and 4559 transitions. [2019-11-15 23:59:01,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:01,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:59:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:59:01,714 INFO L87 Difference]: Start difference. First operand 3302 states and 4559 transitions. Second operand 3 states. [2019-11-15 23:59:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:01,802 INFO L93 Difference]: Finished difference Result 5901 states and 7989 transitions. [2019-11-15 23:59:01,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:59:01,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5901 states and 7989 transitions. [2019-11-15 23:59:01,835 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 3952 [2019-11-15 23:59:01,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5901 states to 5901 states and 7989 transitions. [2019-11-15 23:59:01,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4047 [2019-11-15 23:59:01,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4047 [2019-11-15 23:59:01,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5901 states and 7989 transitions. [2019-11-15 23:59:01,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:59:01,862 INFO L688 BuchiCegarLoop]: Abstraction has 5901 states and 7989 transitions. [2019-11-15 23:59:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5901 states and 7989 transitions. [2019-11-15 23:59:01,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5901 to 5523. [2019-11-15 23:59:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5523 states. [2019-11-15 23:59:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5523 states to 5523 states and 7521 transitions. [2019-11-15 23:59:01,971 INFO L711 BuchiCegarLoop]: Abstraction has 5523 states and 7521 transitions. [2019-11-15 23:59:01,971 INFO L591 BuchiCegarLoop]: Abstraction has 5523 states and 7521 transitions. [2019-11-15 23:59:01,971 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-15 23:59:01,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5523 states and 7521 transitions. [2019-11-15 23:59:01,990 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 3700 [2019-11-15 23:59:01,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:59:01,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:59:01,991 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, 1, 1, 1, 1, 1, 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-11-15 23:59:01,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:01,992 INFO L791 eck$LassoCheckResult]: Stem: 49781#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 49442#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 49443#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 49859#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 49860#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 49722#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 49723#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 49775#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 49446#L351-1 assume !(0 == ~M_E~0); 49447#L492-1 assume !(0 == ~T1_E~0); 49949#L497-1 assume !(0 == ~T2_E~0); 49950#L502-1 assume !(0 == ~T3_E~0); 50004#L507-1 assume !(0 == ~T4_E~0); 49773#L512-1 assume !(0 == ~E_1~0); 49774#L517-1 assume !(0 == ~E_2~0); 49808#L522-1 assume !(0 == ~E_3~0); 49481#L527-1 assume !(0 == ~E_4~0); 49482#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 49544#L228 assume !(1 == ~m_pc~0); 49563#L228-2 is_master_triggered_~__retres1~0 := 0; 50125#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 49564#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 49565#L605 assume !(0 != activate_threads_~tmp~1); 49850#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 49855#L247 assume !(1 == ~t1_pc~0); 49880#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 49881#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 49712#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 49713#L613 assume !(0 != activate_threads_~tmp___0~0); 50169#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 49930#L266 assume !(1 == ~t2_pc~0); 49931#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 49933#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 49934#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 49418#L621 assume !(0 != activate_threads_~tmp___1~0); 49419#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 49430#L285 assume !(1 == ~t3_pc~0); 49416#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 49417#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 49435#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 49768#L629 assume !(0 != activate_threads_~tmp___2~0); 49935#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 49936#L304 assume !(1 == ~t4_pc~0); 49960#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 49961#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 50000#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 49532#L637 assume !(0 != activate_threads_~tmp___3~0); 49533#L637-2 assume !(1 == ~M_E~0); 49534#L545-1 assume !(1 == ~T1_E~0); 49767#L550-1 assume !(1 == ~T2_E~0); 49436#L555-1 assume !(1 == ~T3_E~0); 49437#L560-1 assume !(1 == ~T4_E~0); 49538#L565-1 assume !(1 == ~E_1~0); 49543#L570-1 assume !(1 == ~E_2~0); 50042#L575-1 assume !(1 == ~E_3~0); 50107#L580-1 assume 1 == ~E_4~0;~E_4~0 := 2; 50170#L766-1 [2019-11-15 23:59:01,992 INFO L793 eck$LassoCheckResult]: Loop: 50170#L766-1 assume !false; 54277#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 54092#L467 assume !false; 54093#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 53971#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 53970#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 53969#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 53968#L406 assume 0 != eval_~tmp~0; 53227#L406-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 53224#L414 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 53225#L49 assume !(0 == ~m_pc~0); 53957#L52 assume 1 == ~m_pc~0; 53947#L53 assume !false; 50043#L69 ~m_pc~0 := 1;~m_st~0 := 2; 49551#L411 assume !(0 == ~t1_st~0); 49502#L425 assume !(0 == ~t2_st~0); 53023#L439 assume !(0 == ~t3_st~0); 52915#L453 assume !(0 == ~t4_st~0); 54101#L467 assume !false; 53977#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 53978#L364 assume !(0 == ~m_st~0); 49897#L368 assume !(0 == ~t1_st~0); 49568#L372 assume !(0 == ~t2_st~0); 49570#L376 assume !(0 == ~t3_st~0); 49693#L380 assume !(0 == ~t4_st~0);exists_runnable_thread_~__retres1~5 := 0; 49694#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 54521#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 54516#L406 assume !(0 != eval_~tmp~0); 54517#L482 start_simulation_~kernel_st~0 := 2; 49866#L324-1 start_simulation_~kernel_st~0 := 3; 49867#L492-2 assume !(0 == ~M_E~0); 50144#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 50145#L497-3 assume !(0 == ~T2_E~0); 54747#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 54746#L507-3 assume !(0 == ~T4_E~0); 49671#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 49672#L517-3 assume !(0 == ~E_2~0); 49887#L522-3 assume 0 == ~E_3~0;~E_3~0 := 1; 49511#L527-3 assume !(0 == ~E_4~0); 49512#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 54744#L228-15 assume !(1 == ~m_pc~0); 50081#L228-17 is_master_triggered_~__retres1~0 := 0; 50082#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 49598#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 49599#L605-15 assume !(0 != activate_threads_~tmp~1); 49729#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 49753#L247-15 assume !(1 == ~t1_pc~0); 49744#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 49745#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 49838#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 50035#L613-15 assume !(0 != activate_threads_~tmp___0~0); 50099#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 50100#L266-15 assume !(1 == ~t2_pc~0); 50058#L266-17 is_transmit2_triggered_~__retres1~2 := 0; 50160#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 50065#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 49844#L621-15 assume !(0 != activate_threads_~tmp___1~0); 49845#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 49853#L285-15 assume !(1 == ~t3_pc~0); 49895#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 49466#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 49467#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 49805#L629-15 assume !(0 != activate_threads_~tmp___2~0); 50163#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 49919#L304-15 assume 1 == ~t4_pc~0; 49920#L305-5 assume 1 == ~E_4~0;is_transmit4_triggered_~__retres1~4 := 1; 49928#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 49973#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 49412#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 49413#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 49428#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 49665#L550-3 assume !(1 == ~T2_E~0); 49813#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 49487#L560-3 assume !(1 == ~T4_E~0); 49488#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 49545#L570-3 assume !(1 == ~E_2~0); 50067#L575-3 assume 1 == ~E_3~0;~E_3~0 := 2; 50117#L580-3 assume 1 == ~E_4~0;~E_4~0 := 2; 49945#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 49946#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 50024#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 54634#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 54587#L785 assume !(0 == start_simulation_~tmp~3); 54583#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 50037#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 49714#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 49715#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 54295#L740 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 54291#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 54288#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 54287#L798 assume !(0 != start_simulation_~tmp___0~1); 50170#L766-1 [2019-11-15 23:59:01,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:01,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1463119961, now seen corresponding path program 1 times [2019-11-15 23:59:01,995 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:01,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443130612] [2019-11-15 23:59:01,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:01,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:01,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:02,050 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443130612] [2019-11-15 23:59:02,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:02,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-15 23:59:02,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245600244] [2019-11-15 23:59:02,050 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:59:02,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:02,051 INFO L82 PathProgramCache]: Analyzing trace with hash 64244943, now seen corresponding path program 1 times [2019-11-15 23:59:02,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:02,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599703407] [2019-11-15 23:59:02,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:02,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:02,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:02,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599703407] [2019-11-15 23:59:02,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:02,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:59:02,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220418794] [2019-11-15 23:59:02,090 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:59:02,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:02,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:59:02,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:59:02,090 INFO L87 Difference]: Start difference. First operand 5523 states and 7521 transitions. cyclomatic complexity: 2010 Second operand 3 states. [2019-11-15 23:59:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:02,158 INFO L93 Difference]: Finished difference Result 5523 states and 7338 transitions. [2019-11-15 23:59:02,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:59:02,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5523 states and 7338 transitions. [2019-11-15 23:59:02,188 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 3700 [2019-11-15 23:59:02,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5523 states to 5523 states and 7338 transitions. [2019-11-15 23:59:02,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3795 [2019-11-15 23:59:02,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3795 [2019-11-15 23:59:02,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5523 states and 7338 transitions. [2019-11-15 23:59:02,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:59:02,216 INFO L688 BuchiCegarLoop]: Abstraction has 5523 states and 7338 transitions. [2019-11-15 23:59:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states and 7338 transitions. [2019-11-15 23:59:02,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 5523. [2019-11-15 23:59:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5523 states. [2019-11-15 23:59:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5523 states to 5523 states and 7338 transitions. [2019-11-15 23:59:02,308 INFO L711 BuchiCegarLoop]: Abstraction has 5523 states and 7338 transitions. [2019-11-15 23:59:02,308 INFO L591 BuchiCegarLoop]: Abstraction has 5523 states and 7338 transitions. [2019-11-15 23:59:02,309 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-15 23:59:02,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5523 states and 7338 transitions. [2019-11-15 23:59:02,330 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 3700 [2019-11-15 23:59:02,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:59:02,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:59:02,332 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, 1, 1, 1, 1, 1, 1, 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-11-15 23:59:02,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:02,333 INFO L791 eck$LassoCheckResult]: Stem: 60843#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 60498#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 60499#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 60924#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 60925#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 60782#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 60783#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 60837#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 60502#L351-1 assume !(0 == ~M_E~0); 60503#L492-1 assume !(0 == ~T1_E~0); 61024#L497-1 assume !(0 == ~T2_E~0); 61025#L502-1 assume !(0 == ~T3_E~0); 61078#L507-1 assume !(0 == ~T4_E~0); 60835#L512-1 assume !(0 == ~E_1~0); 60836#L517-1 assume !(0 == ~E_2~0); 60871#L522-1 assume !(0 == ~E_3~0); 60541#L527-1 assume !(0 == ~E_4~0); 60542#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 60603#L228 assume !(1 == ~m_pc~0); 60622#L228-2 is_master_triggered_~__retres1~0 := 0; 61203#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 60623#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 60624#L605 assume !(0 != activate_threads_~tmp~1); 60911#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 60919#L247 assume !(1 == ~t1_pc~0); 60947#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 60948#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 60772#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 60773#L613 assume !(0 != activate_threads_~tmp___0~0); 61271#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 61001#L266 assume !(1 == ~t2_pc~0); 61002#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 61004#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 61005#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 60475#L621 assume !(0 != activate_threads_~tmp___1~0); 60476#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 60484#L285 assume !(1 == ~t3_pc~0); 60469#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 60470#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 60489#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 60834#L629 assume !(0 != activate_threads_~tmp___2~0); 61006#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 61007#L304 assume !(1 == ~t4_pc~0); 61036#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 61037#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 61074#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 60591#L637 assume !(0 != activate_threads_~tmp___3~0); 60592#L637-2 assume !(1 == ~M_E~0); 60593#L545-1 assume !(1 == ~T1_E~0); 60829#L550-1 assume !(1 == ~T2_E~0); 60494#L555-1 assume !(1 == ~T3_E~0); 60495#L560-1 assume !(1 == ~T4_E~0); 60597#L565-1 assume !(1 == ~E_1~0); 60602#L570-1 assume !(1 == ~E_2~0); 61112#L575-1 assume !(1 == ~E_3~0); 61187#L580-1 assume !(1 == ~E_4~0); 61272#L766-1 assume !false; 61806#L767 [2019-11-15 23:59:02,333 INFO L793 eck$LassoCheckResult]: Loop: 61806#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 65427#L467 assume !false; 65425#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 62924#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 62925#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 63805#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 63804#L406 assume 0 != eval_~tmp~0; 62906#L406-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 62907#L414 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 62900#L49 assume !(0 == ~m_pc~0); 62902#L52 assume 1 == ~m_pc~0; 62903#L53 assume !false; 62911#L69 ~m_pc~0 := 1;~m_st~0 := 2; 62910#L411 assume !(0 == ~t1_st~0); 64275#L425 assume !(0 == ~t2_st~0); 64801#L439 assume !(0 == ~t3_st~0); 61027#L453 assume !(0 == ~t4_st~0); 60617#L467 assume !false; 60949#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 65252#L364 assume !(0 == ~m_st~0); 60961#L368 assume !(0 == ~t1_st~0); 60627#L372 assume !(0 == ~t2_st~0); 60629#L376 assume !(0 == ~t3_st~0); 60752#L380 assume !(0 == ~t4_st~0);exists_runnable_thread_~__retres1~5 := 0; 60753#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 65975#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 65974#L406 assume !(0 != eval_~tmp~0); 61136#L482 start_simulation_~kernel_st~0 := 2; 60930#L324-1 start_simulation_~kernel_st~0 := 3; 60931#L492-2 assume !(0 == ~M_E~0); 61236#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 60974#L497-3 assume !(0 == ~T2_E~0); 60975#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 61066#L507-3 assume !(0 == ~T4_E~0); 60731#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 60732#L517-3 assume !(0 == ~E_2~0); 60886#L522-3 assume !(0 == ~E_3~0); 60570#L527-3 assume !(0 == ~E_4~0); 60571#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 60606#L228-15 assume 1 == ~m_pc~0; 61186#L229-5 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 65765#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 65763#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 65761#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 65760#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 65758#L247-15 assume !(1 == ~t1_pc~0); 65757#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 65756#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 65754#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 65752#L613-15 assume !(0 != activate_threads_~tmp___0~0); 65750#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 65695#L266-15 assume !(1 == ~t2_pc~0); 65692#L266-17 is_transmit2_triggered_~__retres1~2 := 0; 65690#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 65687#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 65686#L621-15 assume !(0 != activate_threads_~tmp___1~0); 65685#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 65682#L285-15 assume !(1 == ~t3_pc~0); 65678#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 65675#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 65672#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 65669#L629-15 assume !(0 != activate_threads_~tmp___2~0); 65666#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 65664#L304-15 assume !(1 == ~t4_pc~0); 65661#L304-17 is_transmit4_triggered_~__retres1~4 := 0; 65659#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 65657#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 65654#L637-15 assume 0 != activate_threads_~tmp___3~0;~t4_st~0 := 0; 65650#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 65647#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 65644#L550-3 assume !(1 == ~T2_E~0); 65636#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 65603#L560-3 assume !(1 == ~T4_E~0); 65599#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 65595#L570-3 assume !(1 == ~E_2~0); 65592#L575-3 assume !(1 == ~E_3~0); 65575#L580-3 assume !(1 == ~E_4~0); 65547#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 65478#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 65473#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 65471#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 65468#L785 assume !(0 == start_simulation_~tmp~3); 65463#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 65461#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 65420#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 65452#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 65449#L740 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 65446#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 65444#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 65442#L798 assume !(0 != start_simulation_~tmp___0~1); 65439#L766-1 assume !false; 61806#L767 [2019-11-15 23:59:02,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:02,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1887921798, now seen corresponding path program 1 times [2019-11-15 23:59:02,334 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:02,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058715795] [2019-11-15 23:59:02,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:02,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:02,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:02,357 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:02,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:02,357 INFO L82 PathProgramCache]: Analyzing trace with hash -474259599, now seen corresponding path program 1 times [2019-11-15 23:59:02,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:02,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727905137] [2019-11-15 23:59:02,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:02,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:02,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:59:02,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727905137] [2019-11-15 23:59:02,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:02,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:59:02,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817989301] [2019-11-15 23:59:02,416 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:59:02,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:02,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:59:02,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:59:02,417 INFO L87 Difference]: Start difference. First operand 5523 states and 7338 transitions. cyclomatic complexity: 1827 Second operand 5 states. [2019-11-15 23:59:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:02,585 INFO L93 Difference]: Finished difference Result 7970 states and 10578 transitions. [2019-11-15 23:59:02,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:59:02,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7970 states and 10578 transitions. [2019-11-15 23:59:02,619 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 5360 [2019-11-15 23:59:02,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7970 states to 7970 states and 10578 transitions. [2019-11-15 23:59:02,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5471 [2019-11-15 23:59:02,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5471 [2019-11-15 23:59:02,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7970 states and 10578 transitions. [2019-11-15 23:59:02,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:59:02,650 INFO L688 BuchiCegarLoop]: Abstraction has 7970 states and 10578 transitions. [2019-11-15 23:59:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7970 states and 10578 transitions. [2019-11-15 23:59:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7970 to 5559. [2019-11-15 23:59:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5559 states. [2019-11-15 23:59:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5559 states to 5559 states and 7293 transitions. [2019-11-15 23:59:02,728 INFO L711 BuchiCegarLoop]: Abstraction has 5559 states and 7293 transitions. [2019-11-15 23:59:02,728 INFO L591 BuchiCegarLoop]: Abstraction has 5559 states and 7293 transitions. [2019-11-15 23:59:02,728 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-15 23:59:02,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5559 states and 7293 transitions. [2019-11-15 23:59:02,745 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 3724 [2019-11-15 23:59:02,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:59:02,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:59:02,747 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, 1, 1, 1, 1, 1, 1, 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-11-15 23:59:02,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:02,747 INFO L791 eck$LassoCheckResult]: Stem: 74352#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 74004#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 74005#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 74439#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 74440#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 74296#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 74297#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 74346#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 74008#L351-1 assume !(0 == ~M_E~0); 74009#L492-1 assume !(0 == ~T1_E~0); 74539#L497-1 assume !(0 == ~T2_E~0); 74540#L502-1 assume !(0 == ~T3_E~0); 74610#L507-1 assume !(0 == ~T4_E~0); 74344#L512-1 assume !(0 == ~E_1~0); 74345#L517-1 assume !(0 == ~E_2~0); 74382#L522-1 assume !(0 == ~E_3~0); 74048#L527-1 assume !(0 == ~E_4~0); 74049#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 74115#L228 assume !(1 == ~m_pc~0); 74133#L228-2 is_master_triggered_~__retres1~0 := 0; 74744#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 74134#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 74135#L605 assume !(0 != activate_threads_~tmp~1); 74428#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 74433#L247 assume !(1 == ~t1_pc~0); 74464#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 74465#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 74286#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 74287#L613 assume !(0 != activate_threads_~tmp___0~0); 74818#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 74519#L266 assume !(1 == ~t2_pc~0); 74520#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 74522#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 74523#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 73979#L621 assume !(0 != activate_threads_~tmp___1~0); 73980#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 73992#L285 assume !(1 == ~t3_pc~0); 73977#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 73978#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 73993#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 74339#L629 assume !(0 != activate_threads_~tmp___2~0); 74524#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 74525#L304 assume !(1 == ~t4_pc~0); 74559#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 74560#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 74605#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 74098#L637 assume !(0 != activate_threads_~tmp___3~0); 74099#L637-2 assume !(1 == ~M_E~0); 74104#L545-1 assume !(1 == ~T1_E~0); 74338#L550-1 assume !(1 == ~T2_E~0); 73998#L555-1 assume !(1 == ~T3_E~0); 73999#L560-1 assume !(1 == ~T4_E~0); 74109#L565-1 assume !(1 == ~E_1~0); 74114#L570-1 assume !(1 == ~E_2~0); 74650#L575-1 assume !(1 == ~E_3~0); 74722#L580-1 assume !(1 == ~E_4~0); 74819#L766-1 assume !false; 74992#L767 [2019-11-15 23:59:02,748 INFO L793 eck$LassoCheckResult]: Loop: 74992#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 77778#L467 assume !false; 77776#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 77774#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 77516#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 77764#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 77760#L406 assume 0 != eval_~tmp~0; 77212#L406-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 77210#L414 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 77211#L49 assume !(0 == ~m_pc~0); 77276#L52 assume 1 == ~m_pc~0; 77272#L53 assume !false; 77270#L69 ~m_pc~0 := 1;~m_st~0 := 2; 77266#L411 assume !(0 == ~t1_st~0); 77263#L425 assume !(0 == ~t2_st~0); 77262#L439 assume !(0 == ~t3_st~0); 77533#L453 assume !(0 == ~t4_st~0); 77526#L467 assume !false; 77520#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 77515#L364 assume !(0 == ~m_st~0); 77507#L368 assume !(0 == ~t1_st~0); 77508#L372 assume !(0 == ~t2_st~0); 77509#L376 assume !(0 == ~t3_st~0); 77506#L380 assume !(0 == ~t4_st~0);exists_runnable_thread_~__retres1~5 := 0; 77501#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 77496#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 77491#L406 assume !(0 != eval_~tmp~0); 77492#L482 start_simulation_~kernel_st~0 := 2; 78018#L324-1 start_simulation_~kernel_st~0 := 3; 78017#L492-2 assume !(0 == ~M_E~0); 78016#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 78015#L497-3 assume !(0 == ~T2_E~0); 78014#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 78013#L507-3 assume !(0 == ~T4_E~0); 78012#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 78011#L517-3 assume !(0 == ~E_2~0); 78010#L522-3 assume !(0 == ~E_3~0); 78009#L527-3 assume !(0 == ~E_4~0); 76368#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 78008#L228-15 assume !(1 == ~m_pc~0); 78007#L228-17 is_master_triggered_~__retres1~0 := 0; 78102#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 78097#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 78092#L605-15 assume !(0 != activate_threads_~tmp~1); 78003#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 78084#L247-15 assume !(1 == ~t1_pc~0); 78081#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 78077#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 78072#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 78063#L613-15 assume !(0 != activate_threads_~tmp___0~0); 78058#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 78053#L266-15 assume !(1 == ~t2_pc~0); 78047#L266-17 is_transmit2_triggered_~__retres1~2 := 0; 78044#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 78041#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 78038#L621-15 assume !(0 != activate_threads_~tmp___1~0); 78035#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 76306#L285-15 assume !(1 == ~t3_pc~0); 76307#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 77750#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 77748#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 77745#L629-15 assume !(0 != activate_threads_~tmp___2~0); 77743#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 77740#L304-15 assume !(1 == ~t4_pc~0); 77737#L304-17 is_transmit4_triggered_~__retres1~4 := 0; 77734#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 77730#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 77725#L637-15 assume !(0 != activate_threads_~tmp___3~0); 77721#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 77717#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 77713#L550-3 assume !(1 == ~T2_E~0); 77708#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 77702#L560-3 assume !(1 == ~T4_E~0); 77697#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 77693#L570-3 assume !(1 == ~E_2~0); 77687#L575-3 assume !(1 == ~E_3~0); 77668#L580-3 assume !(1 == ~E_4~0); 76234#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 77657#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 77658#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 77888#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 77884#L785 assume !(0 == start_simulation_~tmp~3); 77881#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 77878#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 77627#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 77873#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 77870#L740 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 77867#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 77865#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 77863#L798 assume !(0 != start_simulation_~tmp___0~1); 77861#L766-1 assume !false; 74992#L767 [2019-11-15 23:59:02,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:02,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1887921798, now seen corresponding path program 2 times [2019-11-15 23:59:02,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:02,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986263105] [2019-11-15 23:59:02,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:02,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:02,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:02,777 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:02,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:02,778 INFO L82 PathProgramCache]: Analyzing trace with hash 629320716, now seen corresponding path program 1 times [2019-11-15 23:59:02,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:02,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133426626] [2019-11-15 23:59:02,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:02,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:02,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:02,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:02,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133426626] [2019-11-15 23:59:02,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:02,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:59:02,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152710393] [2019-11-15 23:59:02,811 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 23:59:02,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:02,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:59:02,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:59:02,812 INFO L87 Difference]: Start difference. First operand 5559 states and 7293 transitions. cyclomatic complexity: 1746 Second operand 3 states. [2019-11-15 23:59:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:02,867 INFO L93 Difference]: Finished difference Result 7030 states and 9084 transitions. [2019-11-15 23:59:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:59:02,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7030 states and 9084 transitions. [2019-11-15 23:59:02,895 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4084 [2019-11-15 23:59:02,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7030 states to 7030 states and 9084 transitions. [2019-11-15 23:59:02,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4860 [2019-11-15 23:59:02,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4860 [2019-11-15 23:59:02,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7030 states and 9084 transitions. [2019-11-15 23:59:02,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:59:02,924 INFO L688 BuchiCegarLoop]: Abstraction has 7030 states and 9084 transitions. [2019-11-15 23:59:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7030 states and 9084 transitions. [2019-11-15 23:59:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7030 to 6604. [2019-11-15 23:59:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6604 states. [2019-11-15 23:59:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6604 states to 6604 states and 8592 transitions. [2019-11-15 23:59:03,004 INFO L711 BuchiCegarLoop]: Abstraction has 6604 states and 8592 transitions. [2019-11-15 23:59:03,004 INFO L591 BuchiCegarLoop]: Abstraction has 6604 states and 8592 transitions. [2019-11-15 23:59:03,004 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-15 23:59:03,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6604 states and 8592 transitions. [2019-11-15 23:59:03,023 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4084 [2019-11-15 23:59:03,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:59:03,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:59:03,025 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, 1, 1, 1, 1, 1, 1, 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-11-15 23:59:03,025 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:03,025 INFO L791 eck$LassoCheckResult]: Stem: 86951#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 86604#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 86605#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 87038#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 87039#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 86888#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 86889#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 86945#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 86610#L351-1 assume !(0 == ~M_E~0); 86611#L492-1 assume !(0 == ~T1_E~0); 87133#L497-1 assume !(0 == ~T2_E~0); 87134#L502-1 assume !(0 == ~T3_E~0); 87192#L507-1 assume !(0 == ~T4_E~0); 86943#L512-1 assume !(0 == ~E_1~0); 86944#L517-1 assume !(0 == ~E_2~0); 86978#L522-1 assume !(0 == ~E_3~0); 86643#L527-1 assume !(0 == ~E_4~0); 86644#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 86709#L228 assume 1 == ~m_pc~0; 86724#L229 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 86725#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 87414#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 87413#L605 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 87030#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 87031#L247 assume !(1 == ~t1_pc~0); 87062#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 87063#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 86878#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 86879#L613 assume !(0 != activate_threads_~tmp___0~0); 87380#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 87381#L266 assume !(1 == ~t2_pc~0); 87393#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 87394#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 87304#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 87305#L621 assume !(0 != activate_threads_~tmp___1~0); 86592#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 86593#L285 assume !(1 == ~t3_pc~0); 86572#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 86573#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 86941#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 86942#L629 assume !(0 != activate_threads_~tmp___2~0); 87117#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 87118#L304 assume !(1 == ~t4_pc~0); 87144#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 87145#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 87357#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 87358#L637 assume !(0 != activate_threads_~tmp___3~0); 86697#L637-2 assume !(1 == ~M_E~0); 86698#L545-1 assume !(1 == ~T1_E~0); 87032#L550-1 assume !(1 == ~T2_E~0); 87033#L555-1 assume !(1 == ~T3_E~0); 86701#L560-1 assume !(1 == ~T4_E~0); 86702#L565-1 assume !(1 == ~E_1~0); 87228#L570-1 assume !(1 == ~E_2~0); 87229#L575-1 assume !(1 == ~E_3~0); 87382#L580-1 assume !(1 == ~E_4~0); 87383#L766-1 assume !false; 88723#L767 [2019-11-15 23:59:03,026 INFO L793 eck$LassoCheckResult]: Loop: 88723#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 92787#L467 assume !false; 92786#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 87197#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 87198#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 92745#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 86677#L406 assume 0 != eval_~tmp~0; 86678#L406-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 91408#L414 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 91409#L49 assume !(0 == ~m_pc~0); 91807#L52 assume 1 == ~m_pc~0; 91805#L53 assume !false; 91507#L69 ~m_pc~0 := 1;~m_st~0 := 2; 91504#L411 assume !(0 == ~t1_st~0); 91491#L425 assume !(0 == ~t2_st~0); 91486#L439 assume !(0 == ~t3_st~0); 91484#L453 assume !(0 == ~t4_st~0); 91529#L467 assume !false; 91525#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 91524#L364 assume !(0 == ~m_st~0); 91521#L368 assume !(0 == ~t1_st~0); 91522#L372 assume !(0 == ~t2_st~0); 91523#L376 assume !(0 == ~t3_st~0); 91519#L380 assume !(0 == ~t4_st~0);exists_runnable_thread_~__retres1~5 := 0; 91520#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 91513#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 91514#L406 assume !(0 != eval_~tmp~0); 87251#L482 start_simulation_~kernel_st~0 := 2; 87042#L324-1 start_simulation_~kernel_st~0 := 3; 87043#L492-2 assume !(0 == ~M_E~0); 87343#L492-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 87089#L497-3 assume !(0 == ~T2_E~0); 87090#L502-3 assume 0 == ~T3_E~0;~T3_E~0 := 1; 87175#L507-3 assume !(0 == ~T4_E~0); 86838#L512-3 assume 0 == ~E_1~0;~E_1~0 := 1; 86839#L517-3 assume !(0 == ~E_2~0); 86993#L522-3 assume !(0 == ~E_3~0); 86673#L527-3 assume !(0 == ~E_4~0); 86674#L532-3 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 86712#L228-15 assume 1 == ~m_pc~0; 86751#L229-5 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 86752#L239-5 is_master_triggered_#res := is_master_triggered_~__retres1~0; 92887#L240-5 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 92885#L605-15 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 92883#L605-17 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 92881#L247-15 assume !(1 == ~t1_pc~0); 92879#L247-17 is_transmit1_triggered_~__retres1~1 := 0; 92877#L258-5 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 92875#L259-5 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 92872#L613-15 assume !(0 != activate_threads_~tmp___0~0); 92870#L613-17 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 92868#L266-15 assume !(1 == ~t2_pc~0); 92865#L266-17 is_transmit2_triggered_~__retres1~2 := 0; 92863#L277-5 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 92861#L278-5 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 92859#L621-15 assume !(0 != activate_threads_~tmp___1~0); 92857#L621-17 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 92855#L285-15 assume !(1 == ~t3_pc~0); 92853#L285-17 is_transmit3_triggered_~__retres1~3 := 0; 92851#L296-5 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 92849#L297-5 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 92846#L629-15 assume !(0 != activate_threads_~tmp___2~0); 92844#L629-17 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 92842#L304-15 assume !(1 == ~t4_pc~0); 92839#L304-17 is_transmit4_triggered_~__retres1~4 := 0; 92837#L315-5 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 92835#L316-5 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 92833#L637-15 assume !(0 != activate_threads_~tmp___3~0); 92831#L637-17 assume 1 == ~M_E~0;~M_E~0 := 2; 92829#L545-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 92827#L550-3 assume !(1 == ~T2_E~0); 92825#L555-3 assume 1 == ~T3_E~0;~T3_E~0 := 2; 92823#L560-3 assume !(1 == ~T4_E~0); 92821#L565-3 assume 1 == ~E_1~0;~E_1~0 := 2; 92820#L570-3 assume !(1 == ~E_2~0); 92819#L575-3 assume !(1 == ~E_3~0); 92818#L580-3 assume !(1 == ~E_4~0); 92817#L585-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 92816#L364-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 91633#L391-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 92814#L392-1 start_simulation_#t~ret12 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret12;havoc start_simulation_#t~ret12; 92811#L785 assume !(0 == start_simulation_~tmp~3); 92808#L785-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret11, 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~5;havoc exists_runnable_thread_~__retres1~5; 92806#L364-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 91604#L391-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 92803#L392-2 stop_simulation_#t~ret11 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret11;havoc stop_simulation_#t~ret11; 92801#L740 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 92799#L747 stop_simulation_#res := stop_simulation_~__retres2~0; 92797#L748 start_simulation_#t~ret13 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 92795#L798 assume !(0 != start_simulation_~tmp___0~1); 92793#L766-1 assume !false; 88723#L767 [2019-11-15 23:59:03,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:03,026 INFO L82 PathProgramCache]: Analyzing trace with hash -606111613, now seen corresponding path program 1 times [2019-11-15 23:59:03,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:03,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535764405] [2019-11-15 23:59:03,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:03,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:03,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:03,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535764405] [2019-11-15 23:59:03,047 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:03,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:59:03,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237538186] [2019-11-15 23:59:03,048 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:59:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:03,048 INFO L82 PathProgramCache]: Analyzing trace with hash -608273105, now seen corresponding path program 1 times [2019-11-15 23:59:03,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:03,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430354102] [2019-11-15 23:59:03,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:03,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:03,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:03,085 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:03,783 WARN L191 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 159 [2019-11-15 23:59:03,978 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-11-15 23:59:03,980 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:59:03,981 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:59:03,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:59:03,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:59:03,981 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:59:03,981 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:59:03,981 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:59:03,981 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:59:03,981 INFO L131 ssoRankerPreferences]: Filename of dumped script: transmitter.04.cil.c_Iteration20_Loop [2019-11-15 23:59:03,981 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:59:03,981 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:59:03,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:03,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,708 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:59:04,709 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:59:04,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:59:04,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:59:04,732 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:59:04,732 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret12=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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-11-15 23:59:04,746 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:59:04,746 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-11-15 23:59:04,752 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:59:04,752 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_transmit2_triggered_#res=0, ULTIMATE.start_activate_threads_~tmp___1~0=0} Honda state: {ULTIMATE.start_is_transmit2_triggered_#res=0, ULTIMATE.start_activate_threads_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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) [2019-11-15 23:59:04,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:59:04,764 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:59:04,769 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:59:04,769 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp___0~0=0, ULTIMATE.start_is_transmit1_triggered_#res=0} Honda state: {ULTIMATE.start_activate_threads_~tmp___0~0=0, ULTIMATE.start_is_transmit1_triggered_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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-11-15 23:59:04,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:59:04,786 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-11-15 23:59:04,791 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:59:04,791 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~t4_st~0=-5} Honda state: {~t4_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:59:04,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:59:04,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:59:04,812 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:59:04,812 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~t3_pc~0=-8} Honda state: {~t3_pc~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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-11-15 23:59:04,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:59:04,828 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-11-15 23:59:04,832 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:59:04,832 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~E_4~0=3} Honda state: {~E_4~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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-11-15 23:59:04,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:59:04,851 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-11-15 23:59:04,862 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:59:04,863 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_transmit2_triggered_~__retres1~2=0} Honda state: {ULTIMATE.start_is_transmit2_triggered_~__retres1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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-11-15 23:59:04,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:59:04,879 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-11-15 23:59:04,882 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:59:04,882 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret8=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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) [2019-11-15 23:59:04,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:59:04,897 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:59:04,901 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:59:04,902 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp_ndt_3~0=0} Honda state: {ULTIMATE.start_eval_~tmp_ndt_3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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) [2019-11-15 23:59:04,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:59:04,916 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/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-11-15 23:59:04,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:59:04,941 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 [2019-11-15 23:59:04,946 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:59:04,948 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:59:04,948 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:59:04,948 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:59:04,948 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:59:04,948 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:59:04,948 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:59:04,949 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:59:04,949 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:59:04,949 INFO L131 ssoRankerPreferences]: Filename of dumped script: transmitter.04.cil.c_Iteration20_Loop [2019-11-15 23:59:04,949 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:59:04,949 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:59:04,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:04,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:59:05,630 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:59:05,630 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:59:05,631 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-11-15 23:59:05,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:05,632 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:05,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:05,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:05,632 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:05,632 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:05,632 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:05,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:05,633 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-11-15 23:59:05,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:05,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:05,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:05,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:05,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:05,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:05,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:05,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:05,635 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-11-15 23:59:05,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:05,636 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:05,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:05,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:05,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:05,637 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:05,637 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:05,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:05,638 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-11-15 23:59:05,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:05,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:05,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:05,639 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:59:05,639 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:05,640 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:59:05,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:05,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:05,641 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-11-15 23:59:05,641 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:05,641 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:05,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:05,642 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:59:05,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:05,642 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:59:05,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:05,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:05,644 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-11-15 23:59:05,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:05,644 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:05,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:05,645 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:59:05,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:05,645 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:59:05,645 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:05,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:05,646 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-11-15 23:59:05,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:05,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:05,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:05,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:05,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:05,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:05,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:05,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:05,649 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-11-15 23:59:05,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:05,650 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:05,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:05,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:05,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:05,650 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:05,651 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:05,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:05,651 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-11-15 23:59:05,652 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:05,652 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:05,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:05,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:05,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:05,653 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:05,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:05,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:05,654 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-11-15 23:59:05,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:05,654 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:05,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:05,655 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:05,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:05,655 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:05,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:05,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:05,657 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-11-15 23:59:05,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:05,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:05,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:05,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:05,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:05,658 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:05,658 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:05,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:05,659 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-11-15 23:59:05,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:05,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:05,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:05,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:05,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:05,661 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:05,661 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:05,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:59:05,663 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-11-15 23:59:05,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:59:05,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:59:05,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:59:05,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:59:05,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:59:05,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:59:05,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:59:05,667 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:59:05,668 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:59:05,668 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 23:59:05,668 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:59:05,669 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:59:05,669 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:59:05,669 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~T1_E~0) = -1*~T1_E~0 + 1 Supporting invariants [] [2019-11-15 23:59:05,669 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:59:05,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:05,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:59:05,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:59:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:05,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:59:05,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:59:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 23:59:05,781 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-11-15 23:59:05,781 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6604 states and 8592 transitions. cyclomatic complexity: 2012 Second operand 5 states. [2019-11-15 23:59:05,881 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6604 states and 8592 transitions. cyclomatic complexity: 2012. Second operand 5 states. Result 13227 states and 17220 transitions. Complement of second has 4 states. [2019-11-15 23:59:05,882 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-11-15 23:59:05,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:59:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2019-11-15 23:59:05,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 507 transitions. Stem has 57 letters. Loop has 91 letters. [2019-11-15 23:59:05,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:59:05,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 507 transitions. Stem has 148 letters. Loop has 91 letters. [2019-11-15 23:59:05,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:59:05,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 507 transitions. Stem has 57 letters. Loop has 182 letters. [2019-11-15 23:59:05,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:59:05,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13227 states and 17220 transitions. [2019-11-15 23:59:05,936 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4084 [2019-11-15 23:59:05,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13227 states to 13227 states and 17220 transitions. [2019-11-15 23:59:05,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4597 [2019-11-15 23:59:05,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4639 [2019-11-15 23:59:05,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13227 states and 17220 transitions. [2019-11-15 23:59:05,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:59:05,990 INFO L688 BuchiCegarLoop]: Abstraction has 13227 states and 17220 transitions. [2019-11-15 23:59:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13227 states and 17220 transitions. [2019-11-15 23:59:06,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13227 to 13185. [2019-11-15 23:59:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13185 states. [2019-11-15 23:59:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13185 states to 13185 states and 17138 transitions. [2019-11-15 23:59:06,164 INFO L711 BuchiCegarLoop]: Abstraction has 13185 states and 17138 transitions. [2019-11-15 23:59:06,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:06,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:59:06,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:59:06,165 INFO L87 Difference]: Start difference. First operand 13185 states and 17138 transitions. Second operand 3 states. [2019-11-15 23:59:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:06,395 INFO L93 Difference]: Finished difference Result 13091 states and 16902 transitions. [2019-11-15 23:59:06,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:59:06,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13091 states and 16902 transitions. [2019-11-15 23:59:06,440 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4084 [2019-11-15 23:59:06,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13091 states to 13091 states and 16902 transitions. [2019-11-15 23:59:06,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4536 [2019-11-15 23:59:06,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4536 [2019-11-15 23:59:06,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13091 states and 16902 transitions. [2019-11-15 23:59:06,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:59:06,482 INFO L688 BuchiCegarLoop]: Abstraction has 13091 states and 16902 transitions. [2019-11-15 23:59:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13091 states and 16902 transitions. [2019-11-15 23:59:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13091 to 13043. [2019-11-15 23:59:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13043 states. [2019-11-15 23:59:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13043 states to 13043 states and 16854 transitions. [2019-11-15 23:59:06,617 INFO L711 BuchiCegarLoop]: Abstraction has 13043 states and 16854 transitions. [2019-11-15 23:59:06,617 INFO L591 BuchiCegarLoop]: Abstraction has 13043 states and 16854 transitions. [2019-11-15 23:59:06,617 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2019-11-15 23:59:06,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13043 states and 16854 transitions. [2019-11-15 23:59:06,648 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4084 [2019-11-15 23:59:06,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:59:06,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:59:06,649 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, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:59:06,649 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:06,649 INFO L791 eck$LassoCheckResult]: Stem: 133517#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 133170#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 133171#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 133594#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 133595#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 133451#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 133452#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 133509#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 133176#L351-1 assume !(0 == ~M_E~0); 133177#L492-1 assume !(0 == ~T1_E~0); 133691#L497-1 assume !(0 == ~T2_E~0); 133692#L502-1 assume !(0 == ~T3_E~0); 133747#L507-1 assume !(0 == ~T4_E~0); 133507#L512-1 assume !(0 == ~E_1~0); 133508#L517-1 assume !(0 == ~E_2~0); 133545#L522-1 assume !(0 == ~E_3~0); 133212#L527-1 assume !(0 == ~E_4~0); 133213#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 133274#L228 assume !(1 == ~m_pc~0); 133893#L228-2 is_master_triggered_~__retres1~0 := 0; 133854#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 133289#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 133290#L605 assume !(0 != activate_threads_~tmp~1); 133583#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 133593#L247 assume !(1 == ~t1_pc~0); 133618#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 133619#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 133441#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 133442#L613 assume !(0 != activate_threads_~tmp___0~0); 133914#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 133669#L266 assume !(1 == ~t2_pc~0); 133670#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 133672#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 133673#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 133146#L621 assume !(0 != activate_threads_~tmp___1~0); 133147#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 133158#L285 assume !(1 == ~t3_pc~0); 133144#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 133145#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 133163#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 133502#L629 assume !(0 != activate_threads_~tmp___2~0); 133674#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 133675#L304 assume !(1 == ~t4_pc~0); 133705#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 133706#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 133743#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 133263#L637 assume !(0 != activate_threads_~tmp___3~0); 133264#L637-2 assume !(1 == ~M_E~0); 133265#L545-1 assume !(1 == ~T1_E~0); 133501#L550-1 assume !(1 == ~T2_E~0); 133164#L555-1 assume !(1 == ~T3_E~0); 133165#L560-1 assume !(1 == ~T4_E~0); 133268#L565-1 assume !(1 == ~E_1~0); 133273#L570-1 assume !(1 == ~E_2~0); 133773#L575-1 assume !(1 == ~E_3~0); 133839#L580-1 assume !(1 == ~E_4~0); 133915#L766-1 assume !false; 134395#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 134388#L467 [2019-11-15 23:59:06,650 INFO L793 eck$LassoCheckResult]: Loop: 134388#L467 assume !false; 134389#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 134377#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 134378#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 134369#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 134365#L406 assume 0 != eval_~tmp~0; 134361#L406-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 134356#L414 assume !(0 != eval_~tmp_ndt_1~0); 134352#L411 assume !(0 == ~t1_st~0); 134346#L425 assume !(0 == ~t2_st~0); 134411#L439 assume !(0 == ~t3_st~0); 134410#L453 assume !(0 == ~t4_st~0); 134388#L467 [2019-11-15 23:59:06,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:06,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1603966133, now seen corresponding path program 1 times [2019-11-15 23:59:06,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:06,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558971726] [2019-11-15 23:59:06,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:06,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:06,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:06,670 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:06,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:06,670 INFO L82 PathProgramCache]: Analyzing trace with hash 590384517, now seen corresponding path program 1 times [2019-11-15 23:59:06,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:06,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144074055] [2019-11-15 23:59:06,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:06,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:06,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:06,678 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:06,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:06,679 INFO L82 PathProgramCache]: Analyzing trace with hash 162355663, now seen corresponding path program 1 times [2019-11-15 23:59:06,680 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:06,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312930292] [2019-11-15 23:59:06,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:06,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:06,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:06,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312930292] [2019-11-15 23:59:06,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:06,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:59:06,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122464437] [2019-11-15 23:59:06,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:06,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:59:06,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:59:06,771 INFO L87 Difference]: Start difference. First operand 13043 states and 16854 transitions. cyclomatic complexity: 3859 Second operand 3 states. [2019-11-15 23:59:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:06,859 INFO L93 Difference]: Finished difference Result 24101 states and 30714 transitions. [2019-11-15 23:59:06,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:59:06,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24101 states and 30714 transitions. [2019-11-15 23:59:06,939 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 6788 [2019-11-15 23:59:06,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24101 states to 24101 states and 30714 transitions. [2019-11-15 23:59:06,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8379 [2019-11-15 23:59:07,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8379 [2019-11-15 23:59:07,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24101 states and 30714 transitions. [2019-11-15 23:59:07,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:59:07,009 INFO L688 BuchiCegarLoop]: Abstraction has 24101 states and 30714 transitions. [2019-11-15 23:59:07,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24101 states and 30714 transitions. [2019-11-15 23:59:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24101 to 23093. [2019-11-15 23:59:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23093 states. [2019-11-15 23:59:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23093 states to 23093 states and 29544 transitions. [2019-11-15 23:59:07,210 INFO L711 BuchiCegarLoop]: Abstraction has 23093 states and 29544 transitions. [2019-11-15 23:59:07,210 INFO L591 BuchiCegarLoop]: Abstraction has 23093 states and 29544 transitions. [2019-11-15 23:59:07,210 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2019-11-15 23:59:07,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23093 states and 29544 transitions. [2019-11-15 23:59:07,263 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 6452 [2019-11-15 23:59:07,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:59:07,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:59:07,264 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, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:59:07,264 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:07,265 INFO L791 eck$LassoCheckResult]: Stem: 170677#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 170323#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 170324#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 170758#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 170759#L331-1 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 170948#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 172632#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 172631#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 172630#L351-1 assume !(0 == ~M_E~0); 172629#L492-1 assume !(0 == ~T1_E~0); 172628#L497-1 assume !(0 == ~T2_E~0); 172627#L502-1 assume !(0 == ~T3_E~0); 172626#L507-1 assume !(0 == ~T4_E~0); 172625#L512-1 assume !(0 == ~E_1~0); 172624#L517-1 assume !(0 == ~E_2~0); 172623#L522-1 assume !(0 == ~E_3~0); 172622#L527-1 assume !(0 == ~E_4~0); 172621#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 172620#L228 assume !(1 == ~m_pc~0); 172619#L228-2 is_master_triggered_~__retres1~0 := 0; 172618#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 172617#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 172616#L605 assume !(0 != activate_threads_~tmp~1); 172615#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 172614#L247 assume !(1 == ~t1_pc~0); 172613#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 172612#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 172611#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 172610#L613 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 171108#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 170837#L266 assume !(1 == ~t2_pc~0); 170838#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 172603#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 172601#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 170303#L621 assume !(0 != activate_threads_~tmp___1~0); 170304#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 170311#L285 assume !(1 == ~t3_pc~0); 170297#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 170298#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 170316#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 170662#L629 assume !(0 != activate_threads_~tmp___2~0); 170842#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 170843#L304 assume !(1 == ~t4_pc~0); 170871#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 170872#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 170909#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 170415#L637 assume !(0 != activate_threads_~tmp___3~0); 170416#L637-2 assume !(1 == ~M_E~0); 170417#L545-1 assume !(1 == ~T1_E~0); 170661#L550-1 assume !(1 == ~T2_E~0); 170317#L555-1 assume !(1 == ~T3_E~0); 170318#L560-1 assume !(1 == ~T4_E~0); 170421#L565-1 assume !(1 == ~E_1~0); 170426#L570-1 assume !(1 == ~E_2~0); 170952#L575-1 assume !(1 == ~E_3~0); 171022#L580-1 assume !(1 == ~E_4~0); 171109#L766-1 assume !false; 173568#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 190994#L467 [2019-11-15 23:59:07,265 INFO L793 eck$LassoCheckResult]: Loop: 190994#L467 assume !false; 192348#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 192345#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 192343#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 192341#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 192339#L406 assume 0 != eval_~tmp~0; 192337#L406-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 192334#L414 assume !(0 != eval_~tmp_ndt_1~0); 170433#L411 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 170384#L428 assume !(0 != eval_~tmp_ndt_2~0); 170385#L425 assume !(0 == ~t2_st~0); 190822#L439 assume !(0 == ~t3_st~0); 190820#L453 assume !(0 == ~t4_st~0); 190994#L467 [2019-11-15 23:59:07,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash -750579381, now seen corresponding path program 1 times [2019-11-15 23:59:07,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:07,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757314974] [2019-11-15 23:59:07,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:07,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:07,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:07,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757314974] [2019-11-15 23:59:07,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:07,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:59:07,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443292382] [2019-11-15 23:59:07,280 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:59:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash 976788691, now seen corresponding path program 1 times [2019-11-15 23:59:07,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:07,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033636459] [2019-11-15 23:59:07,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:07,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:07,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:07,287 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:07,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:07,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:59:07,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:59:07,372 INFO L87 Difference]: Start difference. First operand 23093 states and 29544 transitions. cyclomatic complexity: 6523 Second operand 3 states. [2019-11-15 23:59:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:07,409 INFO L93 Difference]: Finished difference Result 15181 states and 19529 transitions. [2019-11-15 23:59:07,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:59:07,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15181 states and 19529 transitions. [2019-11-15 23:59:07,459 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4710 [2019-11-15 23:59:07,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15181 states to 15181 states and 19529 transitions. [2019-11-15 23:59:07,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5312 [2019-11-15 23:59:07,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5312 [2019-11-15 23:59:07,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15181 states and 19529 transitions. [2019-11-15 23:59:07,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:59:07,509 INFO L688 BuchiCegarLoop]: Abstraction has 15181 states and 19529 transitions. [2019-11-15 23:59:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15181 states and 19529 transitions. [2019-11-15 23:59:07,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15181 to 15181. [2019-11-15 23:59:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15181 states. [2019-11-15 23:59:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15181 states to 15181 states and 19529 transitions. [2019-11-15 23:59:07,846 INFO L711 BuchiCegarLoop]: Abstraction has 15181 states and 19529 transitions. [2019-11-15 23:59:07,847 INFO L591 BuchiCegarLoop]: Abstraction has 15181 states and 19529 transitions. [2019-11-15 23:59:07,847 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2019-11-15 23:59:07,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15181 states and 19529 transitions. [2019-11-15 23:59:07,877 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 4710 [2019-11-15 23:59:07,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:59:07,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:59:07,879 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, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:59:07,879 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:07,879 INFO L791 eck$LassoCheckResult]: Stem: 208960#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 208607#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 208608#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 209040#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 209041#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 208890#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 208891#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 208955#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 208611#L351-1 assume !(0 == ~M_E~0); 208612#L492-1 assume !(0 == ~T1_E~0); 209142#L497-1 assume !(0 == ~T2_E~0); 209143#L502-1 assume !(0 == ~T3_E~0); 209200#L507-1 assume !(0 == ~T4_E~0); 208950#L512-1 assume !(0 == ~E_1~0); 208951#L517-1 assume !(0 == ~E_2~0); 208986#L522-1 assume !(0 == ~E_3~0); 208645#L527-1 assume !(0 == ~E_4~0); 208646#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 208709#L228 assume !(1 == ~m_pc~0); 209355#L228-2 is_master_triggered_~__retres1~0 := 0; 209315#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 208724#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 208725#L605 assume !(0 != activate_threads_~tmp~1); 209027#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 209034#L247 assume !(1 == ~t1_pc~0); 209063#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 209064#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 208881#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 208882#L613 assume !(0 != activate_threads_~tmp___0~0); 209376#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 209119#L266 assume !(1 == ~t2_pc~0); 209120#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 209122#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 209123#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 208582#L621 assume !(0 != activate_threads_~tmp___1~0); 208583#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 208591#L285 assume !(1 == ~t3_pc~0); 208576#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 208577#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 208596#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 208949#L629 assume !(0 != activate_threads_~tmp___2~0); 209124#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 209125#L304 assume !(1 == ~t4_pc~0); 209155#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 209156#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 209196#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 208698#L637 assume !(0 != activate_threads_~tmp___3~0); 208699#L637-2 assume !(1 == ~M_E~0); 208700#L545-1 assume !(1 == ~T1_E~0); 208944#L550-1 assume !(1 == ~T2_E~0); 208601#L555-1 assume !(1 == ~T3_E~0); 208602#L560-1 assume !(1 == ~T4_E~0); 208703#L565-1 assume !(1 == ~E_1~0); 208708#L570-1 assume !(1 == ~E_2~0); 209227#L575-1 assume !(1 == ~E_3~0); 209297#L580-1 assume !(1 == ~E_4~0); 209377#L766-1 assume !false; 210642#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 210641#L467 [2019-11-15 23:59:07,880 INFO L793 eck$LassoCheckResult]: Loop: 210641#L467 assume !false; 210640#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 210639#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 210638#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 210636#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 210634#L406 assume 0 != eval_~tmp~0; 210633#L406-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 210631#L414 assume !(0 != eval_~tmp_ndt_1~0); 210630#L411 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 210628#L428 assume !(0 != eval_~tmp_ndt_2~0); 210629#L425 assume !(0 == ~t2_st~0); 210651#L439 assume !(0 == ~t3_st~0); 210646#L453 assume !(0 == ~t4_st~0); 210641#L467 [2019-11-15 23:59:07,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:07,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1603966133, now seen corresponding path program 2 times [2019-11-15 23:59:07,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:07,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643598184] [2019-11-15 23:59:07,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:07,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:07,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:07,899 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:07,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:07,899 INFO L82 PathProgramCache]: Analyzing trace with hash 976788691, now seen corresponding path program 2 times [2019-11-15 23:59:07,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:07,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424622407] [2019-11-15 23:59:07,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:07,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:07,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:07,909 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:07,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:07,910 INFO L82 PathProgramCache]: Analyzing trace with hash 592796105, now seen corresponding path program 1 times [2019-11-15 23:59:07,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:07,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691750352] [2019-11-15 23:59:07,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:07,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:07,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:07,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691750352] [2019-11-15 23:59:07,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:07,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:59:07,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091474664] [2019-11-15 23:59:08,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:08,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:59:08,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:59:08,021 INFO L87 Difference]: Start difference. First operand 15181 states and 19529 transitions. cyclomatic complexity: 4396 Second operand 3 states. [2019-11-15 23:59:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:08,078 INFO L93 Difference]: Finished difference Result 25501 states and 32615 transitions. [2019-11-15 23:59:08,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:59:08,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25501 states and 32615 transitions. [2019-11-15 23:59:08,155 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 7610 [2019-11-15 23:59:08,217 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25501 states to 25501 states and 32615 transitions. [2019-11-15 23:59:08,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8744 [2019-11-15 23:59:08,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8744 [2019-11-15 23:59:08,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25501 states and 32615 transitions. [2019-11-15 23:59:08,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:59:08,223 INFO L688 BuchiCegarLoop]: Abstraction has 25501 states and 32615 transitions. [2019-11-15 23:59:08,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25501 states and 32615 transitions. [2019-11-15 23:59:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25501 to 25501. [2019-11-15 23:59:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25501 states. [2019-11-15 23:59:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25501 states to 25501 states and 32615 transitions. [2019-11-15 23:59:08,439 INFO L711 BuchiCegarLoop]: Abstraction has 25501 states and 32615 transitions. [2019-11-15 23:59:08,439 INFO L591 BuchiCegarLoop]: Abstraction has 25501 states and 32615 transitions. [2019-11-15 23:59:08,439 INFO L424 BuchiCegarLoop]: ======== Iteration 24============ [2019-11-15 23:59:08,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25501 states and 32615 transitions. [2019-11-15 23:59:08,496 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 7610 [2019-11-15 23:59:08,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:59:08,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:59:08,497 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, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:59:08,498 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:08,498 INFO L791 eck$LassoCheckResult]: Stem: 249653#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 249292#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 249293#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 249728#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 249729#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 249582#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 249583#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 249646#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 249298#L351-1 assume !(0 == ~M_E~0); 249299#L492-1 assume !(0 == ~T1_E~0); 249836#L497-1 assume !(0 == ~T2_E~0); 249837#L502-1 assume !(0 == ~T3_E~0); 249900#L507-1 assume !(0 == ~T4_E~0); 249644#L512-1 assume !(0 == ~E_1~0); 249645#L517-1 assume !(0 == ~E_2~0); 249681#L522-1 assume !(0 == ~E_3~0); 249336#L527-1 assume !(0 == ~E_4~0); 249337#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 249398#L228 assume !(1 == ~m_pc~0); 250054#L228-2 is_master_triggered_~__retres1~0 := 0; 250008#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 249414#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 249415#L605 assume !(0 != activate_threads_~tmp~1); 249719#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 249724#L247 assume !(1 == ~t1_pc~0); 249754#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 249755#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 249570#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 249571#L613 assume !(0 != activate_threads_~tmp___0~0); 250073#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 249814#L266 assume !(1 == ~t2_pc~0); 249815#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 249817#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 249818#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 249268#L621 assume !(0 != activate_threads_~tmp___1~0); 249269#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 249280#L285 assume !(1 == ~t3_pc~0); 249266#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 249267#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 249281#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 249639#L629 assume !(0 != activate_threads_~tmp___2~0); 249819#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 249820#L304 assume !(1 == ~t4_pc~0); 249856#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 249857#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 249896#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 249382#L637 assume !(0 != activate_threads_~tmp___3~0); 249383#L637-2 assume !(1 == ~M_E~0); 249389#L545-1 assume !(1 == ~T1_E~0); 249638#L550-1 assume !(1 == ~T2_E~0); 249286#L555-1 assume !(1 == ~T3_E~0); 249287#L560-1 assume !(1 == ~T4_E~0); 249392#L565-1 assume !(1 == ~E_1~0); 249397#L570-1 assume !(1 == ~E_2~0); 249923#L575-1 assume !(1 == ~E_3~0); 249989#L580-1 assume !(1 == ~E_4~0); 250074#L766-1 assume !false; 252245#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 262696#L467 [2019-11-15 23:59:08,498 INFO L793 eck$LassoCheckResult]: Loop: 262696#L467 assume !false; 267634#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 267632#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 267630#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 267628#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 267626#L406 assume 0 != eval_~tmp~0; 267624#L406-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 267621#L414 assume !(0 != eval_~tmp_ndt_1~0); 267619#L411 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 267615#L428 assume !(0 != eval_~tmp_ndt_2~0); 267616#L425 assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0;eval_~tmp_ndt_3~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 267649#L442 assume !(0 != eval_~tmp_ndt_3~0); 267648#L439 assume !(0 == ~t3_st~0); 267641#L453 assume !(0 == ~t4_st~0); 262696#L467 [2019-11-15 23:59:08,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:08,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1603966133, now seen corresponding path program 3 times [2019-11-15 23:59:08,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:08,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467667649] [2019-11-15 23:59:08,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:08,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:08,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:08,516 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:08,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:08,517 INFO L82 PathProgramCache]: Analyzing trace with hash 210997043, now seen corresponding path program 1 times [2019-11-15 23:59:08,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:08,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24858867] [2019-11-15 23:59:08,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:08,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:08,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:08,524 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:08,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:08,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1192128765, now seen corresponding path program 1 times [2019-11-15 23:59:08,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:08,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106480620] [2019-11-15 23:59:08,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:08,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:08,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:08,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106480620] [2019-11-15 23:59:08,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:08,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:59:08,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338438181] [2019-11-15 23:59:08,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:08,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:59:08,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:59:08,645 INFO L87 Difference]: Start difference. First operand 25501 states and 32615 transitions. cyclomatic complexity: 7162 Second operand 3 states. [2019-11-15 23:59:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:08,742 INFO L93 Difference]: Finished difference Result 32833 states and 41885 transitions. [2019-11-15 23:59:08,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:59:08,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32833 states and 41885 transitions. [2019-11-15 23:59:08,823 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 9665 [2019-11-15 23:59:08,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32833 states to 32833 states and 41885 transitions. [2019-11-15 23:59:08,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11310 [2019-11-15 23:59:08,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11310 [2019-11-15 23:59:08,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32833 states and 41885 transitions. [2019-11-15 23:59:08,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:59:08,904 INFO L688 BuchiCegarLoop]: Abstraction has 32833 states and 41885 transitions. [2019-11-15 23:59:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32833 states and 41885 transitions. [2019-11-15 23:59:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32833 to 31429. [2019-11-15 23:59:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31429 states. [2019-11-15 23:59:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31429 states to 31429 states and 40157 transitions. [2019-11-15 23:59:09,156 INFO L711 BuchiCegarLoop]: Abstraction has 31429 states and 40157 transitions. [2019-11-15 23:59:09,156 INFO L591 BuchiCegarLoop]: Abstraction has 31429 states and 40157 transitions. [2019-11-15 23:59:09,156 INFO L424 BuchiCegarLoop]: ======== Iteration 25============ [2019-11-15 23:59:09,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31429 states and 40157 transitions. [2019-11-15 23:59:09,218 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 9197 [2019-11-15 23:59:09,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:59:09,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:59:09,219 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, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:59:09,219 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:09,220 INFO L791 eck$LassoCheckResult]: Stem: 308005#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 307635#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 307636#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 308080#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 308081#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 307931#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 307932#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 307996#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 307641#L351-1 assume !(0 == ~M_E~0); 307642#L492-1 assume !(0 == ~T1_E~0); 308200#L497-1 assume !(0 == ~T2_E~0); 308201#L502-1 assume !(0 == ~T3_E~0); 308263#L507-1 assume !(0 == ~T4_E~0); 307994#L512-1 assume !(0 == ~E_1~0); 307995#L517-1 assume !(0 == ~E_2~0); 308031#L522-1 assume !(0 == ~E_3~0); 307683#L527-1 assume !(0 == ~E_4~0); 307684#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 307747#L228 assume !(1 == ~m_pc~0); 308430#L228-2 is_master_triggered_~__retres1~0 := 0; 308386#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 307764#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 307765#L605 assume !(0 != activate_threads_~tmp~1); 308071#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 308076#L247 assume !(1 == ~t1_pc~0); 308110#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 308111#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 307919#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 307920#L613 assume !(0 != activate_threads_~tmp___0~0); 308449#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 308178#L266 assume !(1 == ~t2_pc~0); 308179#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 308181#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 308182#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 307611#L621 assume !(0 != activate_threads_~tmp___1~0); 307612#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 307623#L285 assume !(1 == ~t3_pc~0); 307609#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 307610#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 307624#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 307989#L629 assume !(0 != activate_threads_~tmp___2~0); 308183#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 308184#L304 assume !(1 == ~t4_pc~0); 308218#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 308219#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 308258#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 307731#L637 assume !(0 != activate_threads_~tmp___3~0); 307732#L637-2 assume !(1 == ~M_E~0); 307737#L545-1 assume !(1 == ~T1_E~0); 307988#L550-1 assume !(1 == ~T2_E~0); 307629#L555-1 assume !(1 == ~T3_E~0); 307630#L560-1 assume !(1 == ~T4_E~0); 307741#L565-1 assume !(1 == ~E_1~0); 307746#L570-1 assume !(1 == ~E_2~0); 308295#L575-1 assume !(1 == ~E_3~0); 308367#L580-1 assume !(1 == ~E_4~0); 308450#L766-1 assume !false; 311550#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 322687#L467 [2019-11-15 23:59:09,220 INFO L793 eck$LassoCheckResult]: Loop: 322687#L467 assume !false; 322686#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 322685#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 322683#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 322681#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 322679#L406 assume 0 != eval_~tmp~0; 322677#L406-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 322674#L414 assume !(0 != eval_~tmp_ndt_1~0); 322672#L411 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 322669#L428 assume !(0 != eval_~tmp_ndt_2~0); 322670#L425 assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0;eval_~tmp_ndt_3~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 322705#L442 assume !(0 != eval_~tmp_ndt_3~0); 322703#L439 assume 0 == ~t3_st~0;havoc eval_~tmp_ndt_4~0;eval_~tmp_ndt_4~0 := eval_#t~nondet4;havoc eval_#t~nondet4; 322700#L456 assume !(0 != eval_~tmp_ndt_4~0); 322691#L453 assume !(0 == ~t4_st~0); 322687#L467 [2019-11-15 23:59:09,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:09,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1603966133, now seen corresponding path program 4 times [2019-11-15 23:59:09,221 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:09,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964734539] [2019-11-15 23:59:09,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:09,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:09,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:09,240 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:09,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:09,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2049172699, now seen corresponding path program 1 times [2019-11-15 23:59:09,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:09,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377133923] [2019-11-15 23:59:09,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:09,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:09,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:09,249 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:09,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1698860389, now seen corresponding path program 1 times [2019-11-15 23:59:09,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:09,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963061541] [2019-11-15 23:59:09,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:09,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:09,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:09,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963061541] [2019-11-15 23:59:09,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:09,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:59:09,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192772511] [2019-11-15 23:59:09,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:09,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:59:09,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:59:09,607 INFO L87 Difference]: Start difference. First operand 31429 states and 40157 transitions. cyclomatic complexity: 8776 Second operand 3 states. [2019-11-15 23:59:09,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:09,737 INFO L93 Difference]: Finished difference Result 55933 states and 70901 transitions. [2019-11-15 23:59:09,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:59:09,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55933 states and 70901 transitions. [2019-11-15 23:59:09,875 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 16140 [2019-11-15 23:59:09,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55933 states to 55933 states and 70901 transitions. [2019-11-15 23:59:09,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19353 [2019-11-15 23:59:09,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19353 [2019-11-15 23:59:09,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55933 states and 70901 transitions. [2019-11-15 23:59:09,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:59:09,981 INFO L688 BuchiCegarLoop]: Abstraction has 55933 states and 70901 transitions. [2019-11-15 23:59:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55933 states and 70901 transitions. [2019-11-15 23:59:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55933 to 55933. [2019-11-15 23:59:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55933 states. [2019-11-15 23:59:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55933 states to 55933 states and 70901 transitions. [2019-11-15 23:59:10,363 INFO L711 BuchiCegarLoop]: Abstraction has 55933 states and 70901 transitions. [2019-11-15 23:59:10,363 INFO L591 BuchiCegarLoop]: Abstraction has 55933 states and 70901 transitions. [2019-11-15 23:59:10,363 INFO L424 BuchiCegarLoop]: ======== Iteration 26============ [2019-11-15 23:59:10,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55933 states and 70901 transitions. [2019-11-15 23:59:10,457 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 16140 [2019-11-15 23:59:10,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:59:10,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:59:10,458 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, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:59:10,458 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:10,458 INFO L791 eck$LassoCheckResult]: Stem: 395374#ULTIMATE.startENTRY ~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~t3_pc~0 := 0;~t4_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~t3_st~0 := 0;~t4_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~t3_i~0 := 0;~t4_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~T3_E~0 := 2;~T4_E~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~E_3~0 := 2;~E_4~0 := 2; 395006#L-1 havoc main_#res;havoc main_~__retres1~6;havoc main_~__retres1~6;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1;~t3_i~0 := 1;~t4_i~0 := 1; 395007#L729 havoc start_simulation_#t~ret12, start_simulation_#t~ret13, 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; 395463#L324 assume 1 == ~m_i~0;~m_st~0 := 0; 395464#L331-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 395304#L336-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 395305#L341-1 assume 1 == ~t3_i~0;~t3_st~0 := 0; 395366#L346-1 assume 1 == ~t4_i~0;~t4_st~0 := 0; 395012#L351-1 assume !(0 == ~M_E~0); 395013#L492-1 assume !(0 == ~T1_E~0); 395584#L497-1 assume !(0 == ~T2_E~0); 395585#L502-1 assume !(0 == ~T3_E~0); 395654#L507-1 assume !(0 == ~T4_E~0); 395364#L512-1 assume !(0 == ~E_1~0); 395365#L517-1 assume !(0 == ~E_2~0); 395403#L522-1 assume !(0 == ~E_3~0); 395052#L527-1 assume !(0 == ~E_4~0); 395053#L532-1 havoc activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_#t~ret8, activate_threads_#t~ret9, activate_threads_#t~ret10, activate_threads_~tmp~1, activate_threads_~tmp___0~0, activate_threads_~tmp___1~0, activate_threads_~tmp___2~0, activate_threads_~tmp___3~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc activate_threads_~tmp___1~0;havoc activate_threads_~tmp___2~0;havoc activate_threads_~tmp___3~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 395117#L228 assume !(1 == ~m_pc~0); 395810#L228-2 is_master_triggered_~__retres1~0 := 0; 395761#L239 is_master_triggered_#res := is_master_triggered_~__retres1~0; 395134#L240 activate_threads_#t~ret6 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 395135#L605 assume !(0 != activate_threads_~tmp~1); 395452#L605-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 395461#L247 assume !(1 == ~t1_pc~0); 395493#L247-2 is_transmit1_triggered_~__retres1~1 := 0; 395494#L258 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 395294#L259 activate_threads_#t~ret7 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 395295#L613 assume !(0 != activate_threads_~tmp___0~0); 395834#L613-2 havoc is_transmit2_triggered_#res;havoc is_transmit2_triggered_~__retres1~2;havoc is_transmit2_triggered_~__retres1~2; 395562#L266 assume !(1 == ~t2_pc~0); 395563#L266-2 is_transmit2_triggered_~__retres1~2 := 0; 395565#L277 is_transmit2_triggered_#res := is_transmit2_triggered_~__retres1~2; 395566#L278 activate_threads_#t~ret8 := is_transmit2_triggered_#res;activate_threads_~tmp___1~0 := activate_threads_#t~ret8;havoc activate_threads_#t~ret8; 394982#L621 assume !(0 != activate_threads_~tmp___1~0); 394983#L621-2 havoc is_transmit3_triggered_#res;havoc is_transmit3_triggered_~__retres1~3;havoc is_transmit3_triggered_~__retres1~3; 394994#L285 assume !(1 == ~t3_pc~0); 394980#L285-2 is_transmit3_triggered_~__retres1~3 := 0; 394981#L296 is_transmit3_triggered_#res := is_transmit3_triggered_~__retres1~3; 394999#L297 activate_threads_#t~ret9 := is_transmit3_triggered_#res;activate_threads_~tmp___2~0 := activate_threads_#t~ret9;havoc activate_threads_#t~ret9; 395359#L629 assume !(0 != activate_threads_~tmp___2~0); 395567#L629-2 havoc is_transmit4_triggered_#res;havoc is_transmit4_triggered_~__retres1~4;havoc is_transmit4_triggered_~__retres1~4; 395568#L304 assume !(1 == ~t4_pc~0); 395605#L304-2 is_transmit4_triggered_~__retres1~4 := 0; 395606#L315 is_transmit4_triggered_#res := is_transmit4_triggered_~__retres1~4; 395650#L316 activate_threads_#t~ret10 := is_transmit4_triggered_#res;activate_threads_~tmp___3~0 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 395105#L637 assume !(0 != activate_threads_~tmp___3~0); 395106#L637-2 assume !(1 == ~M_E~0); 395107#L545-1 assume !(1 == ~T1_E~0); 395358#L550-1 assume !(1 == ~T2_E~0); 395000#L555-1 assume !(1 == ~T3_E~0); 395001#L560-1 assume !(1 == ~T4_E~0); 395111#L565-1 assume !(1 == ~E_1~0); 395116#L570-1 assume !(1 == ~E_2~0); 395671#L575-1 assume !(1 == ~E_3~0); 395741#L580-1 assume !(1 == ~E_4~0); 395835#L766-1 assume !false; 404144#L767 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_#t~nondet3, eval_~tmp_ndt_3~0, eval_#t~nondet4, eval_~tmp_ndt_4~0, eval_#t~nondet5, eval_~tmp_ndt_5~0, eval_~tmp~0;havoc eval_~tmp~0; 422224#L467 [2019-11-15 23:59:10,458 INFO L793 eck$LassoCheckResult]: Loop: 422224#L467 assume !false; 423168#L402 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~5;havoc exists_runnable_thread_~__retres1~5; 423166#L364 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~5 := 1; 423164#L391 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~5; 423162#L392 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 423160#L406 assume 0 != eval_~tmp~0; 423157#L406-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 423154#L414 assume !(0 != eval_~tmp_ndt_1~0); 423151#L411 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 423149#L428 assume !(0 != eval_~tmp_ndt_2~0); 423146#L425 assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0;eval_~tmp_ndt_3~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 423143#L442 assume !(0 != eval_~tmp_ndt_3~0); 423140#L439 assume 0 == ~t3_st~0;havoc eval_~tmp_ndt_4~0;eval_~tmp_ndt_4~0 := eval_#t~nondet4;havoc eval_#t~nondet4; 423138#L456 assume !(0 != eval_~tmp_ndt_4~0); 423137#L453 assume 0 == ~t4_st~0;havoc eval_~tmp_ndt_5~0;eval_~tmp_ndt_5~0 := eval_#t~nondet5;havoc eval_#t~nondet5; 423119#L470 assume !(0 != eval_~tmp_ndt_5~0); 422224#L467 [2019-11-15 23:59:10,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:10,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1603966133, now seen corresponding path program 5 times [2019-11-15 23:59:10,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:10,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945632152] [2019-11-15 23:59:10,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:10,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:10,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:10,475 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:10,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:10,475 INFO L82 PathProgramCache]: Analyzing trace with hash 900155617, now seen corresponding path program 1 times [2019-11-15 23:59:10,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:10,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126879305] [2019-11-15 23:59:10,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:10,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:10,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:10,482 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:10,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:10,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1125064661, now seen corresponding path program 1 times [2019-11-15 23:59:10,483 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:10,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503820813] [2019-11-15 23:59:10,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:10,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:10,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:10,504 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:11,281 WARN L191 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 106 [2019-11-15 23:59:11,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:59:11 BoogieIcfgContainer [2019-11-15 23:59:11,405 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:59:11,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:59:11,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:59:11,406 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:59:11,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:58:54" (3/4) ... [2019-11-15 23:59:11,409 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 23:59:11,485 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4df3c92e-efa1-4406-97e4-4cb66ba92e53/bin/uautomizer/witness.graphml [2019-11-15 23:59:11,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:59:11,486 INFO L168 Benchmark]: Toolchain (without parser) took 19152.49 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 818.4 MB). Free memory was 946.1 MB in the beginning and 1.4 GB in the end (delta: -502.0 MB). Peak memory consumption was 316.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:11,487 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:59:11,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:11,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:11,488 INFO L168 Benchmark]: Boogie Preprocessor took 78.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:59:11,488 INFO L168 Benchmark]: RCFGBuilder took 1174.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.2 MB). Peak memory consumption was 88.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:11,489 INFO L168 Benchmark]: BuchiAutomizer took 17343.28 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 692.1 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -432.1 MB). Peak memory consumption was 859.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:11,489 INFO L168 Benchmark]: Witness Printer took 79.55 ms. Allocated memory is still 1.8 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:11,491 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 398.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1174.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 88.2 MB). Peak memory consumption was 88.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17343.28 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 692.1 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -432.1 MB). Peak memory consumption was 859.1 MB. Max. memory is 11.5 GB. * Witness Printer took 79.55 ms. Allocated memory is still 1.8 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 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 27 terminating modules (25 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * E_3 + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * T1_E + 1 and consists of 3 locations. 25 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 55933 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.2s and 26 iterations. TraceHistogramMax:2. Analysis of lassos took 9.4s. Construction of modules took 1.2s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 15. Minimization of nondet autom 12. Automata minimization 2.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 13678 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 1.5s Buchi closure took 0.0s. Biggest automaton had 55933 states and ocurred in iteration 25. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6/6 HoareTripleCheckerStatistics: 16259 SDtfs, 17184 SDslu, 21688 SDs, 0 SdLazy, 785 SolverSat, 295 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont1 unkn0 SFLI7 SFLT0 conc4 concLT1 SILN1 SILU0 SILI11 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital182 mio100 ax100 hnf100 lsp6 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp57 tf109 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 401]: 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 {__retres1=0, t3_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e7e6dac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@61653706=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@181964af=0, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@496fc3ad=0, __retres1=0, kernel_st=1, t2_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e86334f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@795f72b0=0, t4_i=1, E_3=2, t4_pc=0, \result=0, E_1=2, tmp_ndt_2=0, \result=0, __retres1=0, \result=0, tmp_ndt_4=0, m_st=0, tmp___2=0, tmp___0=0, t3_pc=0, tmp=0, \result=0, __retres1=0, m_pc=0, \result=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@261b4669=0, \result=0, T2_E=2, tmp___0=0, t1_pc=0, E_2=2, E_4=2, __retres1=1, T1_E=2, tmp_ndt_1=0, M_E=2, tmp=0, tmp_ndt_3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@734755b8=0, __retres1=0, t2_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59be6034=0, T4_E=2, t3_i=1, t4_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@109d1d0a=0, m_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5de1d2b1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21a9301c=0, t1_st=0, tmp_ndt_5=0, t2_pc=0, tmp___3=0, tmp___1=0, T3_E=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7712cc18=0, t1_i=1, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 401]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int t2_pc = 0; [L18] int t3_pc = 0; [L19] int t4_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int t3_st ; [L24] int t4_st ; [L25] int m_i ; [L26] int t1_i ; [L27] int t2_i ; [L28] int t3_i ; [L29] int t4_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int T2_E = 2; [L33] int T3_E = 2; [L34] int T4_E = 2; [L35] int E_1 = 2; [L36] int E_2 = 2; [L37] int E_3 = 2; [L38] int E_4 = 2; [L811] int __retres1 ; [L723] m_i = 1 [L724] t1_i = 1 [L725] t2_i = 1 [L726] t3_i = 1 [L727] t4_i = 1 [L752] int kernel_st ; [L753] int tmp ; [L754] int tmp___0 ; [L758] kernel_st = 0 [L331] COND TRUE m_i == 1 [L332] m_st = 0 [L336] COND TRUE t1_i == 1 [L337] t1_st = 0 [L341] COND TRUE t2_i == 1 [L342] t2_st = 0 [L346] COND TRUE t3_i == 1 [L347] t3_st = 0 [L351] COND TRUE t4_i == 1 [L352] t4_st = 0 [L492] COND FALSE !(M_E == 0) [L497] COND FALSE !(T1_E == 0) [L502] COND FALSE !(T2_E == 0) [L507] COND FALSE !(T3_E == 0) [L512] COND FALSE !(T4_E == 0) [L517] COND FALSE !(E_1 == 0) [L522] COND FALSE !(E_2 == 0) [L527] COND FALSE !(E_3 == 0) [L532] COND FALSE !(E_4 == 0) [L595] int tmp ; [L596] int tmp___0 ; [L597] int tmp___1 ; [L598] int tmp___2 ; [L599] int tmp___3 ; [L225] int __retres1 ; [L228] COND FALSE !(m_pc == 1) [L238] __retres1 = 0 [L240] return (__retres1); [L603] tmp = is_master_triggered() [L605] COND FALSE !(\read(tmp)) [L244] int __retres1 ; [L247] COND FALSE !(t1_pc == 1) [L257] __retres1 = 0 [L259] return (__retres1); [L611] tmp___0 = is_transmit1_triggered() [L613] COND FALSE !(\read(tmp___0)) [L263] int __retres1 ; [L266] COND FALSE !(t2_pc == 1) [L276] __retres1 = 0 [L278] return (__retres1); [L619] tmp___1 = is_transmit2_triggered() [L621] COND FALSE !(\read(tmp___1)) [L282] int __retres1 ; [L285] COND FALSE !(t3_pc == 1) [L295] __retres1 = 0 [L297] return (__retres1); [L627] tmp___2 = is_transmit3_triggered() [L629] COND FALSE !(\read(tmp___2)) [L301] int __retres1 ; [L304] COND FALSE !(t4_pc == 1) [L314] __retres1 = 0 [L316] return (__retres1); [L635] tmp___3 = is_transmit4_triggered() [L637] COND FALSE !(\read(tmp___3)) [L545] COND FALSE !(M_E == 1) [L550] COND FALSE !(T1_E == 1) [L555] COND FALSE !(T2_E == 1) [L560] COND FALSE !(T3_E == 1) [L565] COND FALSE !(T4_E == 1) [L570] COND FALSE !(E_1 == 1) [L575] COND FALSE !(E_2 == 1) [L580] COND FALSE !(E_3 == 1) [L585] COND FALSE !(E_4 == 1) [L766] COND TRUE 1 [L769] kernel_st = 1 [L397] int tmp ; Loop: [L401] COND TRUE 1 [L361] int __retres1 ; [L364] COND TRUE m_st == 0 [L365] __retres1 = 1 [L392] return (__retres1); [L404] tmp = exists_runnable_thread() [L406] COND TRUE \read(tmp) [L411] COND TRUE m_st == 0 [L412] int tmp_ndt_1; [L413] tmp_ndt_1 = __VERIFIER_nondet_int() [L414] COND FALSE !(\read(tmp_ndt_1)) [L425] COND TRUE t1_st == 0 [L426] int tmp_ndt_2; [L427] tmp_ndt_2 = __VERIFIER_nondet_int() [L428] COND FALSE !(\read(tmp_ndt_2)) [L439] COND TRUE t2_st == 0 [L440] int tmp_ndt_3; [L441] tmp_ndt_3 = __VERIFIER_nondet_int() [L442] COND FALSE !(\read(tmp_ndt_3)) [L453] COND TRUE t3_st == 0 [L454] int tmp_ndt_4; [L455] tmp_ndt_4 = __VERIFIER_nondet_int() [L456] COND FALSE !(\read(tmp_ndt_4)) [L467] COND TRUE t4_st == 0 [L468] int tmp_ndt_5; [L469] tmp_ndt_5 = __VERIFIER_nondet_int() [L470] COND FALSE !(\read(tmp_ndt_5)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...