./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 02:41:55,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 02:41:55,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 02:41:55,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 02:41:55,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 02:41:55,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 02:41:55,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 02:41:55,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 02:41:55,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 02:41:55,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 02:41:55,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 02:41:55,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 02:41:55,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 02:41:55,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 02:41:55,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 02:41:55,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 02:41:55,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 02:41:55,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 02:41:55,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 02:41:55,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 02:41:55,545 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 02:41:55,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 02:41:55,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 02:41:55,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 02:41:55,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 02:41:55,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 02:41:55,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 02:41:55,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 02:41:55,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 02:41:55,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 02:41:55,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 02:41:55,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 02:41:55,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 02:41:55,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 02:41:55,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 02:41:55,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 02:41:55,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 02:41:55,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 02:41:55,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 02:41:55,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 02:41:55,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 02:41:55,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 02:41:55,566 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 02:41:55,593 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 02:41:55,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 02:41:55,593 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 02:41:55,594 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 02:41:55,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 02:41:55,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 02:41:55,595 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 02:41:55,595 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 02:41:55,595 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 02:41:55,596 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 02:41:55,596 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 02:41:55,596 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 02:41:55,597 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 02:41:55,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 02:41:55,597 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 02:41:55,597 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 02:41:55,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 02:41:55,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 02:41:55,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 02:41:55,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 02:41:55,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 02:41:55,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 02:41:55,598 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 02:41:55,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 02:41:55,599 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 02:41:55,599 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 02:41:55,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 02:41:55,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 02:41:55,600 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 02:41:55,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 02:41:55,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 02:41:55,602 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 02:41:55,602 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd [2022-07-22 02:41:55,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 02:41:55,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 02:41:55,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 02:41:55,914 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 02:41:55,914 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 02:41:55,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2022-07-22 02:41:55,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19878cbb/4c3ba190ff4a4ac490c5197c2990c332/FLAGb4d8b0a39 [2022-07-22 02:41:56,434 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 02:41:56,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2022-07-22 02:41:56,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19878cbb/4c3ba190ff4a4ac490c5197c2990c332/FLAGb4d8b0a39 [2022-07-22 02:41:56,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f19878cbb/4c3ba190ff4a4ac490c5197c2990c332 [2022-07-22 02:41:56,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 02:41:56,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 02:41:56,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 02:41:56,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 02:41:56,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 02:41:56,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:41:56" (1/1) ... [2022-07-22 02:41:56,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113c4318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:56, skipping insertion in model container [2022-07-22 02:41:56,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:41:56" (1/1) ... [2022-07-22 02:41:56,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 02:41:56,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 02:41:56,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2022-07-22 02:41:56,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:41:56,742 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 02:41:56,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2022-07-22 02:41:56,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:41:56,812 INFO L208 MainTranslator]: Completed translation [2022-07-22 02:41:56,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:56 WrapperNode [2022-07-22 02:41:56,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 02:41:56,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 02:41:56,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 02:41:56,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 02:41:56,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:56" (1/1) ... [2022-07-22 02:41:56,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:56" (1/1) ... [2022-07-22 02:41:56,862 INFO L137 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 32, calls inlined = 49, statements flattened = 594 [2022-07-22 02:41:56,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 02:41:56,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 02:41:56,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 02:41:56,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 02:41:56,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:56" (1/1) ... [2022-07-22 02:41:56,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:56" (1/1) ... [2022-07-22 02:41:56,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:56" (1/1) ... [2022-07-22 02:41:56,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:56" (1/1) ... [2022-07-22 02:41:56,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:56" (1/1) ... [2022-07-22 02:41:56,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:56" (1/1) ... [2022-07-22 02:41:56,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:56" (1/1) ... [2022-07-22 02:41:56,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 02:41:56,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 02:41:56,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 02:41:56,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 02:41:56,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:56" (1/1) ... [2022-07-22 02:41:56,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:41:56,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:41:56,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 02:41:56,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 02:41:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 02:41:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 02:41:56,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 02:41:56,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 02:41:57,066 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 02:41:57,067 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 02:41:57,516 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 02:41:57,522 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 02:41:57,524 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-22 02:41:57,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:41:57 BoogieIcfgContainer [2022-07-22 02:41:57,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 02:41:57,527 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 02:41:57,527 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 02:41:57,529 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 02:41:57,529 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:41:57,529 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 02:41:56" (1/3) ... [2022-07-22 02:41:57,530 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f4cf87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:41:57, skipping insertion in model container [2022-07-22 02:41:57,530 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:41:57,530 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:56" (2/3) ... [2022-07-22 02:41:57,531 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f4cf87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:41:57, skipping insertion in model container [2022-07-22 02:41:57,531 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:41:57,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:41:57" (3/3) ... [2022-07-22 02:41:57,532 INFO L354 chiAutomizerObserver]: Analyzing ICFG token_ring.02.cil-1.c [2022-07-22 02:41:57,580 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 02:41:57,580 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 02:41:57,580 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 02:41:57,581 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 02:41:57,581 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 02:41:57,581 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 02:41:57,581 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 02:41:57,581 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 02:41:57,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 231 states, 230 states have (on average 1.5347826086956522) internal successors, (353), 230 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:57,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 184 [2022-07-22 02:41:57,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:57,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:57,612 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:57,612 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:57,612 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 02:41:57,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 231 states, 230 states have (on average 1.5347826086956522) internal successors, (353), 230 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:57,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 184 [2022-07-22 02:41:57,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:57,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:57,633 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:57,633 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:57,638 INFO L752 eck$LassoCheckResult]: Stem: 219#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 160#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 188#L516true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 185#L224true assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 76#L231true assume !(1 == ~m_i~0);~m_st~0 := 2; 3#L231-2true assume 1 == ~t1_i~0;~t1_st~0 := 0; 128#L236-1true assume !(1 == ~t2_i~0);~t2_st~0 := 2; 125#L241-1true assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 28#L344true assume !(0 == ~M_E~0); 181#L344-2true assume !(0 == ~T1_E~0); 155#L349-1true assume !(0 == ~T2_E~0); 37#L354-1true assume 0 == ~E_M~0;~E_M~0 := 1; 192#L359-1true assume !(0 == ~E_1~0); 35#L364-1true assume !(0 == ~E_2~0); 163#L369-1true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 91#L166true assume 1 == ~m_pc~0; 150#L167true assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; 166#L177true is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 27#L178true activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 209#L425true assume !(0 != activate_threads_~tmp~1#1); 225#L425-2true assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 100#L185true assume !(1 == ~t1_pc~0); 40#L185-2true is_transmit1_triggered_~__retres1~1#1 := 0; 60#L196true is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 69#L197true activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 65#L433true assume !(0 != activate_threads_~tmp___0~0#1); 164#L433-2true assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 110#L204true assume 1 == ~t2_pc~0; 70#L205true assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; 129#L215true is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 207#L216true activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 18#L441true assume !(0 != activate_threads_~tmp___1~0#1); 94#L441-2true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 115#L382true assume !(1 == ~M_E~0); 12#L382-2true assume 1 == ~T1_E~0;~T1_E~0 := 2; 82#L387-1true assume !(1 == ~T2_E~0); 189#L392-1true assume !(1 == ~E_M~0); 105#L397-1true assume !(1 == ~E_1~0); 134#L402-1true assume !(1 == ~E_2~0); 95#L407-1true assume { :end_inline_reset_delta_events } true; 177#L553-2true [2022-07-22 02:41:57,643 INFO L754 eck$LassoCheckResult]: Loop: 177#L553-2true assume !false; 230#L554true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 231#L319true assume !true; 31#L334true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 220#L224-1true assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 195#L344-3true assume !(0 == ~M_E~0); 2#L344-5true assume 0 == ~T1_E~0;~T1_E~0 := 1; 77#L349-3true assume 0 == ~T2_E~0;~T2_E~0 := 1; 30#L354-3true assume 0 == ~E_M~0;~E_M~0 := 1; 102#L359-3true assume 0 == ~E_1~0;~E_1~0 := 1; 75#L364-3true assume 0 == ~E_2~0;~E_2~0 := 1; 73#L369-3true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 58#L166-12true assume !(1 == ~m_pc~0); 171#L166-14true is_master_triggered_~__retres1~0#1 := 0; 43#L177-4true is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 81#L178-4true activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 55#L425-12true assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 118#L425-14true assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 203#L185-12true assume 1 == ~t1_pc~0; 147#L186-4true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1#1 := 1; 145#L196-4true is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 199#L197-4true activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 196#L433-12true assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 135#L433-14true assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 198#L204-12true assume !(1 == ~t2_pc~0); 48#L204-14true is_transmit2_triggered_~__retres1~2#1 := 0; 103#L215-4true is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 41#L216-4true activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 92#L441-12true assume 0 != activate_threads_~tmp___1~0#1;~t2_st~0 := 0; 68#L441-14true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 29#L382-3true assume 1 == ~M_E~0;~M_E~0 := 2; 78#L382-5true assume 1 == ~T1_E~0;~T1_E~0 := 2; 114#L387-3true assume 1 == ~T2_E~0;~T2_E~0 := 2; 142#L392-3true assume 1 == ~E_M~0;~E_M~0 := 2; 8#L397-3true assume 1 == ~E_1~0;~E_1~0 := 2; 121#L402-3true assume 1 == ~E_2~0;~E_2~0 := 2; 14#L407-3true assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 7#L254-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 19#L271-1true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 132#L272-1true start_simulation_#t~ret13#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 107#L572true assume !(0 == start_simulation_~tmp~3#1); 149#L572-2true assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret12#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 26#L254-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 79#L271-2true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 17#L272-2true stop_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret12#1;havoc stop_simulation_#t~ret12#1; 197#L527true assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 86#L534true stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 190#L535true start_simulation_#t~ret14#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret14#1;havoc start_simulation_#t~ret14#1; 183#L585true assume !(0 != start_simulation_~tmp___0~1#1); 177#L553-2true [2022-07-22 02:41:57,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash 332551043, now seen corresponding path program 1 times [2022-07-22 02:41:57,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:57,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161948616] [2022-07-22 02:41:57,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:57,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:57,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:57,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:57,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161948616] [2022-07-22 02:41:57,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161948616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:57,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:57,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:41:57,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447584990] [2022-07-22 02:41:57,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:57,808 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:41:57,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:57,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1618732660, now seen corresponding path program 1 times [2022-07-22 02:41:57,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:57,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211823138] [2022-07-22 02:41:57,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:57,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:57,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:57,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211823138] [2022-07-22 02:41:57,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211823138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:57,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:57,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:41:57,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809118745] [2022-07-22 02:41:57,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:57,850 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:41:57,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:41:57,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:41:57,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:41:57,876 INFO L87 Difference]: Start difference. First operand has 231 states, 230 states have (on average 1.5347826086956522) internal successors, (353), 230 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:41:57,917 INFO L93 Difference]: Finished difference Result 230 states and 340 transitions. [2022-07-22 02:41:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:41:57,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 340 transitions. [2022-07-22 02:41:57,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 182 [2022-07-22 02:41:57,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 225 states and 335 transitions. [2022-07-22 02:41:57,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2022-07-22 02:41:57,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 225 [2022-07-22 02:41:57,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 335 transitions. [2022-07-22 02:41:57,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:41:57,938 INFO L369 hiAutomatonCegarLoop]: Abstraction has 225 states and 335 transitions. [2022-07-22 02:41:57,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 335 transitions. [2022-07-22 02:41:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2022-07-22 02:41:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 225 states have (on average 1.488888888888889) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 335 transitions. [2022-07-22 02:41:57,978 INFO L392 hiAutomatonCegarLoop]: Abstraction has 225 states and 335 transitions. [2022-07-22 02:41:57,979 INFO L374 stractBuchiCegarLoop]: Abstraction has 225 states and 335 transitions. [2022-07-22 02:41:57,979 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 02:41:57,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225 states and 335 transitions. [2022-07-22 02:41:57,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 182 [2022-07-22 02:41:57,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:57,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:57,984 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:57,984 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:57,984 INFO L752 eck$LassoCheckResult]: Stem: 694#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 673#L516 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 683#L224 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 600#L231 assume 1 == ~m_i~0;~m_st~0 := 0; 472#L231-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 473#L236-1 assume !(1 == ~t2_i~0);~t2_st~0 := 2; 648#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 520#L344 assume !(0 == ~M_E~0); 521#L344-2 assume !(0 == ~T1_E~0); 669#L349-1 assume !(0 == ~T2_E~0); 539#L354-1 assume 0 == ~E_M~0;~E_M~0 := 1; 540#L359-1 assume !(0 == ~E_1~0); 534#L364-1 assume !(0 == ~E_2~0); 535#L369-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 613#L166 assume 1 == ~m_pc~0; 614#L167 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; 662#L177 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 518#L178 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 519#L425 assume !(0 != activate_threads_~tmp~1#1); 692#L425-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 623#L185 assume !(1 == ~t1_pc~0); 545#L185-2 is_transmit1_triggered_~__retres1~1#1 := 0; 546#L196 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 583#L197 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 588#L433 assume !(0 != activate_threads_~tmp___0~0#1); 589#L433-2 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 634#L204 assume 1 == ~t2_pc~0; 592#L205 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; 593#L215 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 650#L216 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 501#L441 assume !(0 != activate_threads_~tmp___1~0#1); 502#L441-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 617#L382 assume !(1 == ~M_E~0); 491#L382-2 assume 1 == ~T1_E~0;~T1_E~0 := 2; 492#L387-1 assume !(1 == ~T2_E~0); 603#L392-1 assume !(1 == ~E_M~0); 627#L397-1 assume !(1 == ~E_1~0); 628#L402-1 assume !(1 == ~E_2~0); 618#L407-1 assume { :end_inline_reset_delta_events } true; 619#L553-2 [2022-07-22 02:41:57,985 INFO L754 eck$LassoCheckResult]: Loop: 619#L553-2 assume !false; 679#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 674#L319 assume !false; 651#L282 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 553#L254 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 554#L271 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 543#L272 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 544#L286 assume !(0 != eval_~tmp~0#1); 526#L334 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 527#L224-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 688#L344-3 assume !(0 == ~M_E~0); 470#L344-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 471#L349-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 524#L354-3 assume 0 == ~E_M~0;~E_M~0 := 1; 525#L359-3 assume 0 == ~E_1~0;~E_1~0 := 1; 599#L364-3 assume 0 == ~E_2~0;~E_2~0 := 1; 597#L369-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 579#L166-12 assume 1 == ~m_pc~0; 580#L167-4 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; 549#L177-4 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 550#L178-4 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 573#L425-12 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 574#L425-14 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 643#L185-12 assume !(1 == ~t1_pc~0); 531#L185-14 is_transmit1_triggered_~__retres1~1#1 := 0; 532#L196-4 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 660#L197-4 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 689#L433-12 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 653#L433-14 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 654#L204-12 assume 1 == ~t2_pc~0; 675#L205-4 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; 558#L215-4 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 547#L216-4 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 548#L441-12 assume 0 != activate_threads_~tmp___1~0#1;~t2_st~0 := 0; 591#L441-14 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 522#L382-3 assume 1 == ~M_E~0;~M_E~0 := 2; 523#L382-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 601#L387-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 637#L392-3 assume 1 == ~E_M~0;~E_M~0 := 2; 484#L397-3 assume 1 == ~E_1~0;~E_1~0 := 2; 485#L402-3 assume 1 == ~E_2~0;~E_2~0 := 2; 495#L407-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 481#L254-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 482#L271-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 503#L272-1 start_simulation_#t~ret13#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 631#L572 assume !(0 == start_simulation_~tmp~3#1); 542#L572-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret12#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 515#L254-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 516#L271-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 499#L272-2 stop_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret12#1;havoc stop_simulation_#t~ret12#1; 500#L527 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 609#L534 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 610#L535 start_simulation_#t~ret14#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret14#1;havoc start_simulation_#t~ret14#1; 682#L585 assume !(0 != start_simulation_~tmp___0~1#1); 619#L553-2 [2022-07-22 02:41:57,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash 726917829, now seen corresponding path program 1 times [2022-07-22 02:41:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:57,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466141217] [2022-07-22 02:41:57,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:57,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:58,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:58,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466141217] [2022-07-22 02:41:58,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466141217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:58,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:58,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:41:58,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329653225] [2022-07-22 02:41:58,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:58,032 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:41:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:58,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1606950136, now seen corresponding path program 1 times [2022-07-22 02:41:58,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:58,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843430182] [2022-07-22 02:41:58,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:58,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:58,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:58,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843430182] [2022-07-22 02:41:58,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843430182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:58,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:58,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:41:58,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098209118] [2022-07-22 02:41:58,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:58,115 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:41:58,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:41:58,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:41:58,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:41:58,116 INFO L87 Difference]: Start difference. First operand 225 states and 335 transitions. cyclomatic complexity: 111 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:41:58,130 INFO L93 Difference]: Finished difference Result 225 states and 334 transitions. [2022-07-22 02:41:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:41:58,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 334 transitions. [2022-07-22 02:41:58,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 182 [2022-07-22 02:41:58,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 225 states and 334 transitions. [2022-07-22 02:41:58,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2022-07-22 02:41:58,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 225 [2022-07-22 02:41:58,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 334 transitions. [2022-07-22 02:41:58,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:41:58,141 INFO L369 hiAutomatonCegarLoop]: Abstraction has 225 states and 334 transitions. [2022-07-22 02:41:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 334 transitions. [2022-07-22 02:41:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2022-07-22 02:41:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 225 states have (on average 1.4844444444444445) internal successors, (334), 224 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 334 transitions. [2022-07-22 02:41:58,150 INFO L392 hiAutomatonCegarLoop]: Abstraction has 225 states and 334 transitions. [2022-07-22 02:41:58,150 INFO L374 stractBuchiCegarLoop]: Abstraction has 225 states and 334 transitions. [2022-07-22 02:41:58,150 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 02:41:58,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225 states and 334 transitions. [2022-07-22 02:41:58,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 182 [2022-07-22 02:41:58,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:58,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:58,152 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:58,152 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:58,153 INFO L752 eck$LassoCheckResult]: Stem: 1153#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 1131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 1132#L516 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 1142#L224 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1059#L231 assume 1 == ~m_i~0;~m_st~0 := 0; 931#L231-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 932#L236-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 1107#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 979#L344 assume !(0 == ~M_E~0); 980#L344-2 assume !(0 == ~T1_E~0); 1128#L349-1 assume !(0 == ~T2_E~0); 998#L354-1 assume 0 == ~E_M~0;~E_M~0 := 1; 999#L359-1 assume !(0 == ~E_1~0); 993#L364-1 assume !(0 == ~E_2~0); 994#L369-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 1072#L166 assume 1 == ~m_pc~0; 1073#L167 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; 1121#L177 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 977#L178 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 978#L425 assume !(0 != activate_threads_~tmp~1#1); 1151#L425-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 1082#L185 assume !(1 == ~t1_pc~0); 1004#L185-2 is_transmit1_triggered_~__retres1~1#1 := 0; 1005#L196 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 1042#L197 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 1047#L433 assume !(0 != activate_threads_~tmp___0~0#1); 1048#L433-2 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 1093#L204 assume 1 == ~t2_pc~0; 1051#L205 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; 1052#L215 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 1109#L216 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 960#L441 assume !(0 != activate_threads_~tmp___1~0#1); 961#L441-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1076#L382 assume !(1 == ~M_E~0); 950#L382-2 assume 1 == ~T1_E~0;~T1_E~0 := 2; 951#L387-1 assume !(1 == ~T2_E~0); 1062#L392-1 assume !(1 == ~E_M~0); 1086#L397-1 assume !(1 == ~E_1~0); 1087#L402-1 assume !(1 == ~E_2~0); 1077#L407-1 assume { :end_inline_reset_delta_events } true; 1078#L553-2 [2022-07-22 02:41:58,153 INFO L754 eck$LassoCheckResult]: Loop: 1078#L553-2 assume !false; 1138#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 1133#L319 assume !false; 1110#L282 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 1012#L254 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 1013#L271 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 1002#L272 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 1003#L286 assume !(0 != eval_~tmp~0#1); 985#L334 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 986#L224-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 1147#L344-3 assume !(0 == ~M_E~0); 929#L344-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 930#L349-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 983#L354-3 assume 0 == ~E_M~0;~E_M~0 := 1; 984#L359-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1058#L364-3 assume 0 == ~E_2~0;~E_2~0 := 1; 1056#L369-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 1038#L166-12 assume !(1 == ~m_pc~0); 1040#L166-14 is_master_triggered_~__retres1~0#1 := 0; 1008#L177-4 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 1009#L178-4 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 1032#L425-12 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 1033#L425-14 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 1102#L185-12 assume 1 == ~t1_pc~0; 1120#L186-4 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1#1 := 1; 991#L196-4 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 1119#L197-4 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 1148#L433-12 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 1112#L433-14 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 1113#L204-12 assume !(1 == ~t2_pc~0); 1016#L204-14 is_transmit2_triggered_~__retres1~2#1 := 0; 1017#L215-4 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 1006#L216-4 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 1007#L441-12 assume 0 != activate_threads_~tmp___1~0#1;~t2_st~0 := 0; 1050#L441-14 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 981#L382-3 assume 1 == ~M_E~0;~M_E~0 := 2; 982#L382-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1060#L387-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 1096#L392-3 assume 1 == ~E_M~0;~E_M~0 := 2; 943#L397-3 assume 1 == ~E_1~0;~E_1~0 := 2; 944#L402-3 assume 1 == ~E_2~0;~E_2~0 := 2; 954#L407-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 940#L254-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 941#L271-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 962#L272-1 start_simulation_#t~ret13#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 1090#L572 assume !(0 == start_simulation_~tmp~3#1); 1001#L572-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret12#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 974#L254-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 975#L271-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 958#L272-2 stop_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret12#1;havoc stop_simulation_#t~ret12#1; 959#L527 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 1068#L534 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 1069#L535 start_simulation_#t~ret14#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret14#1;havoc start_simulation_#t~ret14#1; 1141#L585 assume !(0 != start_simulation_~tmp___0~1#1); 1078#L553-2 [2022-07-22 02:41:58,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:58,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1324066169, now seen corresponding path program 1 times [2022-07-22 02:41:58,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:58,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784039997] [2022-07-22 02:41:58,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:58,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:58,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:58,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784039997] [2022-07-22 02:41:58,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784039997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:58,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:58,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:41:58,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151116313] [2022-07-22 02:41:58,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:58,203 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:41:58,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1848890247, now seen corresponding path program 1 times [2022-07-22 02:41:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:58,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078386342] [2022-07-22 02:41:58,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:58,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:58,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:58,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078386342] [2022-07-22 02:41:58,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078386342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:58,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:58,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:41:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195850649] [2022-07-22 02:41:58,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:58,247 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:41:58,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:41:58,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 02:41:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 02:41:58,248 INFO L87 Difference]: Start difference. First operand 225 states and 334 transitions. cyclomatic complexity: 110 Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:41:58,327 INFO L93 Difference]: Finished difference Result 362 states and 534 transitions. [2022-07-22 02:41:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 02:41:58,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 362 states and 534 transitions. [2022-07-22 02:41:58,330 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 312 [2022-07-22 02:41:58,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 362 states to 362 states and 534 transitions. [2022-07-22 02:41:58,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 362 [2022-07-22 02:41:58,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 362 [2022-07-22 02:41:58,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 362 states and 534 transitions. [2022-07-22 02:41:58,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:41:58,337 INFO L369 hiAutomatonCegarLoop]: Abstraction has 362 states and 534 transitions. [2022-07-22 02:41:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states and 534 transitions. [2022-07-22 02:41:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2022-07-22 02:41:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 361 states have (on average 1.4764542936288088) internal successors, (533), 360 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 533 transitions. [2022-07-22 02:41:58,347 INFO L392 hiAutomatonCegarLoop]: Abstraction has 361 states and 533 transitions. [2022-07-22 02:41:58,347 INFO L374 stractBuchiCegarLoop]: Abstraction has 361 states and 533 transitions. [2022-07-22 02:41:58,347 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 02:41:58,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 361 states and 533 transitions. [2022-07-22 02:41:58,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 312 [2022-07-22 02:41:58,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:58,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:58,349 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:58,349 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:58,350 INFO L752 eck$LassoCheckResult]: Stem: 1776#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 1748#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 1749#L516 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 1761#L224 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1659#L231 assume 1 == ~m_i~0;~m_st~0 := 0; 1530#L231-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1531#L236-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 1716#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1578#L344 assume !(0 == ~M_E~0); 1579#L344-2 assume !(0 == ~T1_E~0); 1743#L349-1 assume !(0 == ~T2_E~0); 1598#L354-1 assume !(0 == ~E_M~0); 1599#L359-1 assume !(0 == ~E_1~0); 1593#L364-1 assume !(0 == ~E_2~0); 1594#L369-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 1675#L166 assume 1 == ~m_pc~0; 1676#L167 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; 1736#L177 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 1576#L178 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 1577#L425 assume !(0 != activate_threads_~tmp~1#1); 1774#L425-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 1685#L185 assume !(1 == ~t1_pc~0); 1604#L185-2 is_transmit1_triggered_~__retres1~1#1 := 0; 1605#L196 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 1642#L197 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 1647#L433 assume !(0 != activate_threads_~tmp___0~0#1); 1648#L433-2 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 1697#L204 assume 1 == ~t2_pc~0; 1651#L205 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; 1652#L215 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 1718#L216 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 1559#L441 assume !(0 != activate_threads_~tmp___1~0#1); 1560#L441-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1679#L382 assume 1 == ~M_E~0;~M_E~0 := 2; 1701#L382-2 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1826#L387-1 assume !(1 == ~T2_E~0); 1765#L392-1 assume !(1 == ~E_M~0); 1689#L397-1 assume !(1 == ~E_1~0); 1690#L402-1 assume !(1 == ~E_2~0); 1722#L407-1 assume { :end_inline_reset_delta_events } true; 1791#L553-2 [2022-07-22 02:41:58,350 INFO L754 eck$LassoCheckResult]: Loop: 1791#L553-2 assume !false; 1779#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 1750#L319 assume !false; 1719#L282 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 1720#L254 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 1746#L271 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 1747#L272 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 1663#L286 assume !(0 != eval_~tmp~0#1); 1665#L334 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 1777#L224-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 1778#L344-3 assume !(0 == ~M_E~0); 1528#L344-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1529#L349-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 1583#L354-3 assume !(0 == ~E_M~0); 1584#L359-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1658#L364-3 assume 0 == ~E_2~0;~E_2~0 := 1; 1656#L369-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 1638#L166-12 assume 1 == ~m_pc~0; 1639#L167-4 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0#1 := 1; 1608#L177-4 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 1609#L178-4 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 1632#L425-12 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 1633#L425-14 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 1707#L185-12 assume !(1 == ~t1_pc~0); 1590#L185-14 is_transmit1_triggered_~__retres1~1#1 := 0; 1591#L196-4 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 1873#L197-4 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 1872#L433-12 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 1871#L433-14 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 1870#L204-12 assume 1 == ~t2_pc~0; 1868#L205-4 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; 1867#L215-4 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 1866#L216-4 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 1865#L441-12 assume 0 != activate_threads_~tmp___1~0#1;~t2_st~0 := 0; 1864#L441-14 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1863#L382-3 assume 1 == ~M_E~0;~M_E~0 := 2; 1581#L382-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1862#L387-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 1861#L392-3 assume 1 == ~E_M~0;~E_M~0 := 2; 1731#L397-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1860#L402-3 assume 1 == ~E_2~0;~E_2~0 := 2; 1859#L407-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 1856#L254-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 1855#L271-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 1854#L272-1 start_simulation_#t~ret13#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 1853#L572 assume !(0 == start_simulation_~tmp~3#1); 1601#L572-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret12#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 1573#L254-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 1574#L271-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 1557#L272-2 stop_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret12#1;havoc stop_simulation_#t~ret12#1; 1558#L527 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 1671#L534 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 1672#L535 start_simulation_#t~ret14#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret14#1;havoc start_simulation_#t~ret14#1; 1766#L585 assume !(0 != start_simulation_~tmp___0~1#1); 1791#L553-2 [2022-07-22 02:41:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:58,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1712870137, now seen corresponding path program 1 times [2022-07-22 02:41:58,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:58,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021740685] [2022-07-22 02:41:58,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:58,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:58,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021740685] [2022-07-22 02:41:58,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021740685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:58,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:58,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:41:58,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997919847] [2022-07-22 02:41:58,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:58,380 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:41:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:58,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2030596858, now seen corresponding path program 1 times [2022-07-22 02:41:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:58,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74011103] [2022-07-22 02:41:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:58,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:58,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:58,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74011103] [2022-07-22 02:41:58,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74011103] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:58,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:58,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:41:58,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602105146] [2022-07-22 02:41:58,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:58,405 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:41:58,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:41:58,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:41:58,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:41:58,406 INFO L87 Difference]: Start difference. First operand 361 states and 533 transitions. cyclomatic complexity: 174 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:41:58,438 INFO L93 Difference]: Finished difference Result 658 states and 955 transitions. [2022-07-22 02:41:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:41:58,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 955 transitions. [2022-07-22 02:41:58,443 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 608 [2022-07-22 02:41:58,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 955 transitions. [2022-07-22 02:41:58,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2022-07-22 02:41:58,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2022-07-22 02:41:58,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 955 transitions. [2022-07-22 02:41:58,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:41:58,447 INFO L369 hiAutomatonCegarLoop]: Abstraction has 658 states and 955 transitions. [2022-07-22 02:41:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 955 transitions. [2022-07-22 02:41:58,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 618. [2022-07-22 02:41:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 618 states have (on average 1.4579288025889967) internal successors, (901), 617 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 901 transitions. [2022-07-22 02:41:58,459 INFO L392 hiAutomatonCegarLoop]: Abstraction has 618 states and 901 transitions. [2022-07-22 02:41:58,459 INFO L374 stractBuchiCegarLoop]: Abstraction has 618 states and 901 transitions. [2022-07-22 02:41:58,459 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 02:41:58,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 618 states and 901 transitions. [2022-07-22 02:41:58,461 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 568 [2022-07-22 02:41:58,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:58,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:58,462 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:58,462 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:58,463 INFO L752 eck$LassoCheckResult]: Stem: 2842#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 2791#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 2792#L516 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 2814#L224 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 2696#L231 assume 1 == ~m_i~0;~m_st~0 := 0; 2558#L231-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2559#L236-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 2758#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2609#L344 assume !(0 == ~M_E~0); 2610#L344-2 assume !(0 == ~T1_E~0); 2786#L349-1 assume !(0 == ~T2_E~0); 2629#L354-1 assume !(0 == ~E_M~0); 2630#L359-1 assume !(0 == ~E_1~0); 2624#L364-1 assume !(0 == ~E_2~0); 2625#L369-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 2718#L166 assume !(1 == ~m_pc~0); 2719#L166-2 is_master_triggered_~__retres1~0#1 := 0; 2795#L177 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 2607#L178 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 2608#L425 assume !(0 != activate_threads_~tmp~1#1); 2831#L425-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 2728#L185 assume !(1 == ~t1_pc~0); 2635#L185-2 is_transmit1_triggered_~__retres1~1#1 := 0; 2636#L196 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 2674#L197 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 2678#L433 assume !(0 != activate_threads_~tmp___0~0#1); 2679#L433-2 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 2741#L204 assume 1 == ~t2_pc~0; 2685#L205 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; 2686#L215 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 2760#L216 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 2589#L441 assume !(0 != activate_threads_~tmp___1~0#1); 2590#L441-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2722#L382 assume 1 == ~M_E~0;~M_E~0 := 2; 2577#L382-2 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2578#L387-1 assume !(1 == ~T2_E~0); 2955#L392-1 assume !(1 == ~E_M~0); 2817#L397-1 assume !(1 == ~E_1~0); 2767#L402-1 assume !(1 == ~E_2~0); 2725#L407-1 assume { :end_inline_reset_delta_events } true; 2726#L553-2 [2022-07-22 02:41:58,463 INFO L754 eck$LassoCheckResult]: Loop: 2726#L553-2 assume !false; 2806#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 2793#L319 assume !false; 2761#L282 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 2645#L254 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 2646#L271 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 2633#L272 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 2634#L286 assume !(0 != eval_~tmp~0#1); 2701#L334 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 2960#L224-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 2920#L344-3 assume !(0 == ~M_E~0); 2921#L344-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 3128#L349-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 3127#L354-3 assume !(0 == ~E_M~0); 3126#L359-3 assume 0 == ~E_1~0;~E_1~0 := 1; 3125#L364-3 assume 0 == ~E_2~0;~E_2~0 := 1; 3124#L369-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 3123#L166-12 assume !(1 == ~m_pc~0); 3122#L166-14 is_master_triggered_~__retres1~0#1 := 0; 2639#L177-4 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 2640#L178-4 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 2664#L425-12 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 2665#L425-14 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 2752#L185-12 assume 1 == ~t1_pc~0; 2780#L186-4 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1#1 := 1; 2622#L196-4 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 3002#L197-4 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 3003#L433-12 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 2896#L433-14 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 2897#L204-12 assume 1 == ~t2_pc~0; 2890#L205-4 assume 1 == ~E_2~0;is_transmit2_triggered_~__retres1~2#1 := 1; 2891#L215-4 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 2886#L216-4 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 2887#L441-12 assume 0 != activate_threads_~tmp___1~0#1;~t2_st~0 := 0; 2681#L441-14 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2682#L382-3 assume 1 == ~M_E~0;~M_E~0 := 2; 2612#L382-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2744#L387-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 2745#L392-3 assume 1 == ~E_M~0;~E_M~0 := 2; 2570#L397-3 assume 1 == ~E_1~0;~E_1~0 := 2; 2571#L402-3 assume 1 == ~E_2~0;~E_2~0 := 2; 3008#L407-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 2567#L254-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 2568#L271-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 2591#L272-1 start_simulation_#t~ret13#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 2737#L572 assume !(0 == start_simulation_~tmp~3#1); 2632#L572-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret12#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 2604#L254-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 2605#L271-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 2587#L272-2 stop_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret12#1;havoc stop_simulation_#t~ret12#1; 2588#L527 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 2707#L534 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 2708#L535 start_simulation_#t~ret14#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret14#1;havoc start_simulation_#t~ret14#1; 2812#L585 assume !(0 != start_simulation_~tmp___0~1#1); 2726#L553-2 [2022-07-22 02:41:58,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:58,463 INFO L85 PathProgramCache]: Analyzing trace with hash 524493128, now seen corresponding path program 1 times [2022-07-22 02:41:58,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:58,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356919434] [2022-07-22 02:41:58,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:58,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:58,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:58,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356919434] [2022-07-22 02:41:58,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356919434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:58,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:58,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:41:58,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664263501] [2022-07-22 02:41:58,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:58,506 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:41:58,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:58,506 INFO L85 PathProgramCache]: Analyzing trace with hash 632360506, now seen corresponding path program 1 times [2022-07-22 02:41:58,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:58,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074704669] [2022-07-22 02:41:58,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:58,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:58,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074704669] [2022-07-22 02:41:58,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074704669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:58,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:58,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:41:58,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907081037] [2022-07-22 02:41:58,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:58,529 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:41:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:41:58,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 02:41:58,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 02:41:58,530 INFO L87 Difference]: Start difference. First operand 618 states and 901 transitions. cyclomatic complexity: 287 Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:41:58,595 INFO L93 Difference]: Finished difference Result 1401 states and 2004 transitions. [2022-07-22 02:41:58,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 02:41:58,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1401 states and 2004 transitions. [2022-07-22 02:41:58,602 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1296 [2022-07-22 02:41:58,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1401 states to 1401 states and 2004 transitions. [2022-07-22 02:41:58,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1401 [2022-07-22 02:41:58,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1401 [2022-07-22 02:41:58,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1401 states and 2004 transitions. [2022-07-22 02:41:58,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:41:58,609 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1401 states and 2004 transitions. [2022-07-22 02:41:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states and 2004 transitions. [2022-07-22 02:41:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1118. [2022-07-22 02:41:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1118 states have (on average 1.4445438282647585) internal successors, (1615), 1117 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1615 transitions. [2022-07-22 02:41:58,631 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1118 states and 1615 transitions. [2022-07-22 02:41:58,631 INFO L374 stractBuchiCegarLoop]: Abstraction has 1118 states and 1615 transitions. [2022-07-22 02:41:58,631 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 02:41:58,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1118 states and 1615 transitions. [2022-07-22 02:41:58,634 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1067 [2022-07-22 02:41:58,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:58,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:58,635 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:58,635 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:58,635 INFO L752 eck$LassoCheckResult]: Stem: 4851#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 4814#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 4815#L516 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 4834#L224 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 4721#L231 assume 1 == ~m_i~0;~m_st~0 := 0; 4589#L231-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 4590#L236-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 4785#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 4640#L344 assume !(0 == ~M_E~0); 4641#L344-2 assume !(0 == ~T1_E~0); 4809#L349-1 assume !(0 == ~T2_E~0); 4659#L354-1 assume !(0 == ~E_M~0); 4660#L359-1 assume !(0 == ~E_1~0); 4654#L364-1 assume !(0 == ~E_2~0); 4655#L369-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 4738#L166 assume !(1 == ~m_pc~0); 4739#L166-2 is_master_triggered_~__retres1~0#1 := 0; 4821#L177 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 4638#L178 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 4639#L425 assume !(0 != activate_threads_~tmp~1#1); 4846#L425-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 4749#L185 assume !(1 == ~t1_pc~0); 4665#L185-2 is_transmit1_triggered_~__retres1~1#1 := 0; 4666#L196 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 4705#L197 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 4711#L433 assume !(0 != activate_threads_~tmp___0~0#1); 4712#L433-2 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 4766#L204 assume !(1 == ~t2_pc~0); 4747#L204-2 is_transmit2_triggered_~__retres1~2#1 := 0; 4748#L215 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 4787#L216 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 4620#L441 assume !(0 != activate_threads_~tmp___1~0#1); 4621#L441-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4741#L382 assume 1 == ~M_E~0;~M_E~0 := 2; 4608#L382-2 assume 1 == ~T1_E~0;~T1_E~0 := 2; 4609#L387-1 assume !(1 == ~T2_E~0); 4836#L392-1 assume !(1 == ~E_M~0); 4837#L397-1 assume !(1 == ~E_1~0); 4792#L402-1 assume !(1 == ~E_2~0); 4793#L407-1 assume { :end_inline_reset_delta_events } true; 5629#L553-2 [2022-07-22 02:41:58,635 INFO L754 eck$LassoCheckResult]: Loop: 5629#L553-2 assume !false; 5628#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 4840#L319 assume !false; 5627#L282 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 5623#L254 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 5619#L271 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 5609#L272 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 5606#L286 assume !(0 != eval_~tmp~0#1); 5607#L334 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 5653#L224-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 5652#L344-3 assume !(0 == ~M_E~0); 4587#L344-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 4588#L349-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 4644#L354-3 assume !(0 == ~E_M~0); 4645#L359-3 assume 0 == ~E_1~0;~E_1~0 := 1; 4719#L364-3 assume 0 == ~E_2~0;~E_2~0 := 1; 4718#L369-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 4701#L166-12 assume !(1 == ~m_pc~0); 4702#L166-14 is_master_triggered_~__retres1~0#1 := 0; 4671#L177-4 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 4672#L178-4 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 4695#L425-12 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 4696#L425-14 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 4776#L185-12 assume 1 == ~t1_pc~0; 4801#L186-4 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1#1 := 1; 4652#L196-4 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 4800#L197-4 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 4843#L433-12 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 4790#L433-14 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 4791#L204-12 assume !(1 == ~t2_pc~0); 4680#L204-14 is_transmit2_triggered_~__retres1~2#1 := 0; 4681#L215-4 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 4667#L216-4 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 4668#L441-12 assume 0 != activate_threads_~tmp___1~0#1;~t2_st~0 := 0; 4713#L441-14 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4642#L382-3 assume 1 == ~M_E~0;~M_E~0 := 2; 4643#L382-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 4720#L387-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 4769#L392-3 assume 1 == ~E_M~0;~E_M~0 := 2; 4601#L397-3 assume 1 == ~E_1~0;~E_1~0 := 2; 4602#L402-3 assume 1 == ~E_2~0;~E_2~0 := 2; 4779#L407-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 5649#L254-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 5648#L271-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 5647#L272-1 start_simulation_#t~ret13#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 5646#L572 assume !(0 == start_simulation_~tmp~3#1); 4662#L572-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret12#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 5643#L254-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 5640#L271-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 5638#L272-2 stop_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret12#1;havoc stop_simulation_#t~ret12#1; 5636#L527 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 5634#L534 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 5633#L535 start_simulation_#t~ret14#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret14#1;havoc start_simulation_#t~ret14#1; 5630#L585 assume !(0 != start_simulation_~tmp___0~1#1); 5629#L553-2 [2022-07-22 02:41:58,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:58,636 INFO L85 PathProgramCache]: Analyzing trace with hash -754831607, now seen corresponding path program 1 times [2022-07-22 02:41:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:58,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946468430] [2022-07-22 02:41:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:58,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:58,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946468430] [2022-07-22 02:41:58,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946468430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:58,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:58,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:41:58,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555581578] [2022-07-22 02:41:58,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:58,657 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:41:58,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:58,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1425243525, now seen corresponding path program 1 times [2022-07-22 02:41:58,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:58,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086806164] [2022-07-22 02:41:58,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:58,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:58,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:58,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086806164] [2022-07-22 02:41:58,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086806164] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:58,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:58,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:41:58,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830419355] [2022-07-22 02:41:58,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:58,691 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:41:58,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:41:58,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:41:58,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:41:58,693 INFO L87 Difference]: Start difference. First operand 1118 states and 1615 transitions. cyclomatic complexity: 501 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:41:58,712 INFO L93 Difference]: Finished difference Result 1641 states and 2364 transitions. [2022-07-22 02:41:58,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:41:58,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1641 states and 2364 transitions. [2022-07-22 02:41:58,720 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1591 [2022-07-22 02:41:58,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1641 states to 1641 states and 2364 transitions. [2022-07-22 02:41:58,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1641 [2022-07-22 02:41:58,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1641 [2022-07-22 02:41:58,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1641 states and 2364 transitions. [2022-07-22 02:41:58,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:41:58,729 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1641 states and 2364 transitions. [2022-07-22 02:41:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states and 2364 transitions. [2022-07-22 02:41:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1181. [2022-07-22 02:41:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 1181 states have (on average 1.4428450465707028) internal successors, (1704), 1180 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1704 transitions. [2022-07-22 02:41:58,765 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1181 states and 1704 transitions. [2022-07-22 02:41:58,765 INFO L374 stractBuchiCegarLoop]: Abstraction has 1181 states and 1704 transitions. [2022-07-22 02:41:58,765 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 02:41:58,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1181 states and 1704 transitions. [2022-07-22 02:41:58,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2022-07-22 02:41:58,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:58,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:58,770 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:58,770 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:58,770 INFO L752 eck$LassoCheckResult]: Stem: 7629#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 7588#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 7589#L516 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 7608#L224 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 7492#L231 assume 1 == ~m_i~0;~m_st~0 := 0; 7357#L231-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 7358#L236-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 7556#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 7408#L344 assume !(0 == ~M_E~0); 7409#L344-2 assume !(0 == ~T1_E~0); 7583#L349-1 assume !(0 == ~T2_E~0); 7428#L354-1 assume !(0 == ~E_M~0); 7429#L359-1 assume !(0 == ~E_1~0); 7423#L364-1 assume !(0 == ~E_2~0); 7424#L369-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 7513#L166 assume !(1 == ~m_pc~0); 7514#L166-2 is_master_triggered_~__retres1~0#1 := 0; 7592#L177 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 7406#L178 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 7407#L425 assume !(0 != activate_threads_~tmp~1#1); 7624#L425-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 7525#L185 assume !(1 == ~t1_pc~0); 7434#L185-2 is_transmit1_triggered_~__retres1~1#1 := 0; 7435#L196 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 7474#L197 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 7481#L433 assume !(0 != activate_threads_~tmp___0~0#1); 7482#L433-2 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 7542#L204 assume !(1 == ~t2_pc~0); 7523#L204-2 is_transmit2_triggered_~__retres1~2#1 := 0; 7524#L215 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 7558#L216 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 7388#L441 assume !(0 != activate_threads_~tmp___1~0#1); 7389#L441-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 7517#L382 assume !(1 == ~M_E~0); 7376#L382-2 assume 1 == ~T1_E~0;~T1_E~0 := 2; 7377#L387-1 assume !(1 == ~T2_E~0); 7496#L392-1 assume !(1 == ~E_M~0); 7531#L397-1 assume !(1 == ~E_1~0); 7532#L402-1 assume !(1 == ~E_2~0); 7518#L407-1 assume { :end_inline_reset_delta_events } true; 7519#L553-2 [2022-07-22 02:41:58,770 INFO L754 eck$LassoCheckResult]: Loop: 7519#L553-2 assume !false; 8483#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 7596#L319 assume !false; 7559#L282 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 7444#L254 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 7445#L271 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 8372#L272 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 7497#L286 assume !(0 != eval_~tmp~0#1); 7498#L334 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 8535#L224-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 7615#L344-3 assume !(0 == ~M_E~0); 7355#L344-5 assume 0 == ~T1_E~0;~T1_E~0 := 1; 7356#L349-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 7412#L354-3 assume !(0 == ~E_M~0); 7413#L359-3 assume 0 == ~E_1~0;~E_1~0 := 1; 7491#L364-3 assume 0 == ~E_2~0;~E_2~0 := 1; 7488#L369-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 7471#L166-12 assume !(1 == ~m_pc~0); 7472#L166-14 is_master_triggered_~__retres1~0#1 := 0; 7440#L177-4 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 7441#L178-4 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 7465#L425-12 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 7466#L425-14 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 7551#L185-12 assume !(1 == ~t1_pc~0); 8503#L185-14 is_transmit1_triggered_~__retres1~1#1 := 0; 8502#L196-4 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 8498#L197-4 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 8496#L433-12 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 8494#L433-14 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 8492#L204-12 assume !(1 == ~t2_pc~0); 8401#L204-14 is_transmit2_triggered_~__retres1~2#1 := 0; 8482#L215-4 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 7436#L216-4 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 7437#L441-12 assume 0 != activate_threads_~tmp___1~0#1;~t2_st~0 := 0; 7484#L441-14 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 7410#L382-3 assume !(1 == ~M_E~0); 7411#L382-5 assume 1 == ~T1_E~0;~T1_E~0 := 2; 8392#L387-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 8384#L392-3 assume 1 == ~E_M~0;~E_M~0 := 2; 8371#L397-3 assume 1 == ~E_1~0;~E_1~0 := 2; 8367#L402-3 assume 1 == ~E_2~0;~E_2~0 := 2; 8364#L407-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 8356#L254-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 8353#L271-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 8349#L272-1 start_simulation_#t~ret13#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 7536#L572 assume !(0 == start_simulation_~tmp~3#1); 7538#L572-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret12#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 8500#L254-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 8497#L271-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 8495#L272-2 stop_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret12#1;havoc stop_simulation_#t~ret12#1; 8493#L527 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 8490#L534 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 8487#L535 start_simulation_#t~ret14#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret14#1;havoc start_simulation_#t~ret14#1; 8485#L585 assume !(0 != start_simulation_~tmp___0~1#1); 7519#L553-2 [2022-07-22 02:41:58,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:58,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1020175755, now seen corresponding path program 1 times [2022-07-22 02:41:58,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:58,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085561928] [2022-07-22 02:41:58,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:58,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:58,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:58,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085561928] [2022-07-22 02:41:58,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085561928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:58,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:58,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:41:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099952263] [2022-07-22 02:41:58,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:58,787 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:41:58,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash -590690946, now seen corresponding path program 1 times [2022-07-22 02:41:58,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:58,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833059253] [2022-07-22 02:41:58,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:58,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:58,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:58,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833059253] [2022-07-22 02:41:58,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833059253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:58,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:58,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:41:58,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100644863] [2022-07-22 02:41:58,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:58,806 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:41:58,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:41:58,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:41:58,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:41:58,807 INFO L87 Difference]: Start difference. First operand 1181 states and 1704 transitions. cyclomatic complexity: 525 Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:41:58,819 INFO L93 Difference]: Finished difference Result 1181 states and 1678 transitions. [2022-07-22 02:41:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:41:58,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1181 states and 1678 transitions. [2022-07-22 02:41:58,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2022-07-22 02:41:58,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1181 states to 1181 states and 1678 transitions. [2022-07-22 02:41:58,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1181 [2022-07-22 02:41:58,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1181 [2022-07-22 02:41:58,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1181 states and 1678 transitions. [2022-07-22 02:41:58,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:41:58,832 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1181 states and 1678 transitions. [2022-07-22 02:41:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states and 1678 transitions. [2022-07-22 02:41:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2022-07-22 02:41:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 1181 states have (on average 1.4208298052497883) internal successors, (1678), 1180 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1678 transitions. [2022-07-22 02:41:58,844 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1181 states and 1678 transitions. [2022-07-22 02:41:58,844 INFO L374 stractBuchiCegarLoop]: Abstraction has 1181 states and 1678 transitions. [2022-07-22 02:41:58,844 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 02:41:58,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1181 states and 1678 transitions. [2022-07-22 02:41:58,848 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2022-07-22 02:41:58,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:58,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:58,849 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:58,849 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:58,852 INFO L752 eck$LassoCheckResult]: Stem: 9993#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 9950#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 9951#L516 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 9972#L224 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 9862#L231 assume 1 == ~m_i~0;~m_st~0 := 0; 9728#L231-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 9729#L236-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 9920#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 9778#L344 assume !(0 == ~M_E~0); 9779#L344-2 assume !(0 == ~T1_E~0); 9945#L349-1 assume !(0 == ~T2_E~0); 9797#L354-1 assume !(0 == ~E_M~0); 9798#L359-1 assume !(0 == ~E_1~0); 9792#L364-1 assume !(0 == ~E_2~0); 9793#L369-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 9880#L166 assume !(1 == ~m_pc~0); 9881#L166-2 is_master_triggered_~__retres1~0#1 := 0; 9956#L177 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 9776#L178 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 9777#L425 assume !(0 != activate_threads_~tmp~1#1); 9990#L425-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 9893#L185 assume !(1 == ~t1_pc~0); 9803#L185-2 is_transmit1_triggered_~__retres1~1#1 := 0; 9804#L196 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 9844#L197 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 9850#L433 assume !(0 != activate_threads_~tmp___0~0#1); 9851#L433-2 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 9906#L204 assume !(1 == ~t2_pc~0); 9891#L204-2 is_transmit2_triggered_~__retres1~2#1 := 0; 9892#L215 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 9922#L216 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 9758#L441 assume !(0 != activate_threads_~tmp___1~0#1); 9759#L441-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 9885#L382 assume !(1 == ~M_E~0); 9747#L382-2 assume !(1 == ~T1_E~0); 9748#L387-1 assume !(1 == ~T2_E~0); 9865#L392-1 assume !(1 == ~E_M~0); 9897#L397-1 assume !(1 == ~E_1~0); 9898#L402-1 assume !(1 == ~E_2~0); 9886#L407-1 assume { :end_inline_reset_delta_events } true; 9887#L553-2 [2022-07-22 02:41:58,853 INFO L754 eck$LassoCheckResult]: Loop: 9887#L553-2 assume !false; 10757#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 9960#L319 assume !false; 10756#L282 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 10754#L254 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 10752#L271 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 9801#L272 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 9802#L286 assume !(0 != eval_~tmp~0#1); 9784#L334 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 9785#L224-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 9978#L344-3 assume !(0 == ~M_E~0); 9726#L344-5 assume !(0 == ~T1_E~0); 9727#L349-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 9782#L354-3 assume !(0 == ~E_M~0); 9783#L359-3 assume 0 == ~E_1~0;~E_1~0 := 1; 9860#L364-3 assume 0 == ~E_2~0;~E_2~0 := 1; 9861#L369-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 10886#L166-12 assume !(1 == ~m_pc~0); 9962#L166-14 is_master_triggered_~__retres1~0#1 := 0; 9809#L177-4 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 9810#L178-4 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 9835#L425-12 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 9836#L425-14 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 9915#L185-12 assume !(1 == ~t1_pc~0); 10861#L185-14 is_transmit1_triggered_~__retres1~1#1 := 0; 9935#L196-4 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 9936#L197-4 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 9983#L433-12 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 9926#L433-14 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 9927#L204-12 assume !(1 == ~t2_pc~0); 9982#L204-14 is_transmit2_triggered_~__retres1~2#1 := 0; 10799#L215-4 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 10798#L216-4 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 9882#L441-12 assume 0 != activate_threads_~tmp___1~0#1;~t2_st~0 := 0; 9853#L441-14 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 9780#L382-3 assume !(1 == ~M_E~0); 9781#L382-5 assume !(1 == ~T1_E~0); 9863#L387-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 9909#L392-3 assume 1 == ~E_M~0;~E_M~0 := 2; 9740#L397-3 assume 1 == ~E_1~0;~E_1~0 := 2; 9741#L402-3 assume 1 == ~E_2~0;~E_2~0 := 2; 9751#L407-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 9737#L254-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 9738#L271-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 9760#L272-1 start_simulation_#t~ret13#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 9924#L572 assume !(0 == start_simulation_~tmp~3#1); 10015#L572-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret12#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 9773#L254-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 9774#L271-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 9756#L272-2 stop_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret12#1;havoc stop_simulation_#t~ret12#1; 9757#L527 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 9981#L534 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 10869#L535 start_simulation_#t~ret14#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret14#1;havoc start_simulation_#t~ret14#1; 10797#L585 assume !(0 != start_simulation_~tmp___0~1#1); 9887#L553-2 [2022-07-22 02:41:58,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:58,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1077434057, now seen corresponding path program 1 times [2022-07-22 02:41:58,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:58,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985530595] [2022-07-22 02:41:58,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:58,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:58,883 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:41:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:58,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:41:58,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:58,903 INFO L85 PathProgramCache]: Analyzing trace with hash 812738366, now seen corresponding path program 1 times [2022-07-22 02:41:58,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:58,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317809313] [2022-07-22 02:41:58,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:58,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:58,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:58,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317809313] [2022-07-22 02:41:58,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317809313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:58,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:58,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:41:58,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343055485] [2022-07-22 02:41:58,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:58,930 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:41:58,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:41:58,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 02:41:58,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 02:41:58,931 INFO L87 Difference]: Start difference. First operand 1181 states and 1678 transitions. cyclomatic complexity: 499 Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:41:58,993 INFO L93 Difference]: Finished difference Result 2033 states and 2838 transitions. [2022-07-22 02:41:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 02:41:58,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2033 states and 2838 transitions. [2022-07-22 02:41:59,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1984 [2022-07-22 02:41:59,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2033 states to 2033 states and 2838 transitions. [2022-07-22 02:41:59,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2033 [2022-07-22 02:41:59,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2033 [2022-07-22 02:41:59,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2033 states and 2838 transitions. [2022-07-22 02:41:59,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:41:59,015 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2033 states and 2838 transitions. [2022-07-22 02:41:59,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states and 2838 transitions. [2022-07-22 02:41:59,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1205. [2022-07-22 02:41:59,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1205 states have (on average 1.412448132780083) internal successors, (1702), 1204 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1702 transitions. [2022-07-22 02:41:59,050 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1205 states and 1702 transitions. [2022-07-22 02:41:59,050 INFO L374 stractBuchiCegarLoop]: Abstraction has 1205 states and 1702 transitions. [2022-07-22 02:41:59,050 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 02:41:59,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1205 states and 1702 transitions. [2022-07-22 02:41:59,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1160 [2022-07-22 02:41:59,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:59,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:59,054 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:59,054 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:59,054 INFO L752 eck$LassoCheckResult]: Stem: 13228#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 13189#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 13190#L516 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 13207#L224 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 13090#L231 assume 1 == ~m_i~0;~m_st~0 := 0; 12958#L231-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 12959#L236-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 13155#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 13009#L344 assume !(0 == ~M_E~0); 13010#L344-2 assume !(0 == ~T1_E~0); 13182#L349-1 assume !(0 == ~T2_E~0); 13028#L354-1 assume !(0 == ~E_M~0); 13029#L359-1 assume !(0 == ~E_1~0); 13023#L364-1 assume !(0 == ~E_2~0); 13024#L369-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 13108#L166 assume !(1 == ~m_pc~0); 13109#L166-2 is_master_triggered_~__retres1~0#1 := 0; 13193#L177 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 13007#L178 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 13008#L425 assume !(0 != activate_threads_~tmp~1#1); 13223#L425-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 13120#L185 assume !(1 == ~t1_pc~0); 13034#L185-2 is_transmit1_triggered_~__retres1~1#1 := 0; 13035#L196 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 13072#L197 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 13078#L433 assume !(0 != activate_threads_~tmp___0~0#1); 13079#L433-2 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 13136#L204 assume !(1 == ~t2_pc~0); 13118#L204-2 is_transmit2_triggered_~__retres1~2#1 := 0; 13119#L215 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 13157#L216 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 12989#L441 assume !(0 != activate_threads_~tmp___1~0#1); 12990#L441-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 13112#L382 assume !(1 == ~M_E~0); 12977#L382-2 assume !(1 == ~T1_E~0); 12978#L387-1 assume !(1 == ~T2_E~0); 13093#L392-1 assume !(1 == ~E_M~0); 13128#L397-1 assume !(1 == ~E_1~0); 13129#L402-1 assume !(1 == ~E_2~0); 13115#L407-1 assume { :end_inline_reset_delta_events } true; 13116#L553-2 [2022-07-22 02:41:59,054 INFO L754 eck$LassoCheckResult]: Loop: 13116#L553-2 assume !false; 13202#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 13234#L319 assume !false; 13235#L282 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 13781#L254 assume !(0 == ~m_st~0); 13782#L258 assume !(0 == ~t1_st~0); 13783#L262 assume !(0 == ~t2_st~0);exists_runnable_thread_~__retres1~3#1 := 0; 13784#L271 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 13772#L272 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 13773#L286 assume !(0 != eval_~tmp~0#1); 13764#L334 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 13765#L224-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 13211#L344-3 assume !(0 == ~M_E~0); 13212#L344-5 assume !(0 == ~T1_E~0); 14018#L349-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 14017#L354-3 assume !(0 == ~E_M~0); 13123#L359-3 assume 0 == ~E_1~0;~E_1~0 := 1; 13124#L364-3 assume 0 == ~E_2~0;~E_2~0 := 1; 13084#L369-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 13068#L166-12 assume !(1 == ~m_pc~0); 13069#L166-14 is_master_triggered_~__retres1~0#1 := 0; 13038#L177-4 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 13039#L178-4 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 14015#L425-12 assume 0 != activate_threads_~tmp~1#1;~m_st~0 := 0; 14014#L425-14 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 13218#L185-12 assume !(1 == ~t1_pc~0); 13219#L185-14 is_transmit1_triggered_~__retres1~1#1 := 0; 13172#L196-4 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 13173#L197-4 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 14013#L433-12 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 13161#L433-14 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 13162#L204-12 assume !(1 == ~t2_pc~0); 13046#L204-14 is_transmit2_triggered_~__retres1~2#1 := 0; 13047#L215-4 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 13036#L216-4 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 13037#L441-12 assume 0 != activate_threads_~tmp___1~0#1;~t2_st~0 := 0; 13080#L441-14 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 13011#L382-3 assume !(1 == ~M_E~0); 13012#L382-5 assume !(1 == ~T1_E~0); 13139#L387-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 13140#L392-3 assume 1 == ~E_M~0;~E_M~0 := 2; 12970#L397-3 assume 1 == ~E_1~0;~E_1~0 := 2; 12971#L402-3 assume 1 == ~E_2~0;~E_2~0 := 2; 12981#L407-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 12982#L254-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 14122#L271-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 14084#L272-1 start_simulation_#t~ret13#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 13132#L572 assume !(0 == start_simulation_~tmp~3#1); 13134#L572-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret12#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 13004#L254-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 13005#L271-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 12987#L272-2 stop_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret12#1;havoc stop_simulation_#t~ret12#1; 12988#L527 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 13099#L534 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 13100#L535 start_simulation_#t~ret14#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret14#1;havoc start_simulation_#t~ret14#1; 13206#L585 assume !(0 != start_simulation_~tmp___0~1#1); 13116#L553-2 [2022-07-22 02:41:59,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:59,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1077434057, now seen corresponding path program 2 times [2022-07-22 02:41:59,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:59,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261221708] [2022-07-22 02:41:59,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:59,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,060 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:41:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:41:59,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:59,067 INFO L85 PathProgramCache]: Analyzing trace with hash -60432105, now seen corresponding path program 1 times [2022-07-22 02:41:59,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:59,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889650091] [2022-07-22 02:41:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:59,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:59,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:59,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889650091] [2022-07-22 02:41:59,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889650091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:59,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:59,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:41:59,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211530435] [2022-07-22 02:41:59,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:59,108 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:41:59,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:41:59,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 02:41:59,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 02:41:59,108 INFO L87 Difference]: Start difference. First operand 1205 states and 1702 transitions. cyclomatic complexity: 499 Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:59,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:41:59,210 INFO L93 Difference]: Finished difference Result 2347 states and 3283 transitions. [2022-07-22 02:41:59,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 02:41:59,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2347 states and 3283 transitions. [2022-07-22 02:41:59,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2302 [2022-07-22 02:41:59,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2347 states to 2347 states and 3283 transitions. [2022-07-22 02:41:59,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2347 [2022-07-22 02:41:59,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2347 [2022-07-22 02:41:59,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2347 states and 3283 transitions. [2022-07-22 02:41:59,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:41:59,232 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2347 states and 3283 transitions. [2022-07-22 02:41:59,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states and 3283 transitions. [2022-07-22 02:41:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 1253. [2022-07-22 02:41:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1253 states have (on average 1.386272944932163) internal successors, (1737), 1252 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1737 transitions. [2022-07-22 02:41:59,251 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1253 states and 1737 transitions. [2022-07-22 02:41:59,251 INFO L374 stractBuchiCegarLoop]: Abstraction has 1253 states and 1737 transitions. [2022-07-22 02:41:59,251 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 02:41:59,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1253 states and 1737 transitions. [2022-07-22 02:41:59,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1208 [2022-07-22 02:41:59,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:59,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:59,256 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:59,256 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:59,256 INFO L752 eck$LassoCheckResult]: Stem: 16803#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 16745#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 16746#L516 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 16772#L224 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 16654#L231 assume 1 == ~m_i~0;~m_st~0 := 0; 16523#L231-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 16524#L236-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 16715#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 16573#L344 assume !(0 == ~M_E~0); 16574#L344-2 assume !(0 == ~T1_E~0); 16741#L349-1 assume !(0 == ~T2_E~0); 16593#L354-1 assume !(0 == ~E_M~0); 16594#L359-1 assume !(0 == ~E_1~0); 16588#L364-1 assume !(0 == ~E_2~0); 16589#L369-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 16673#L166 assume !(1 == ~m_pc~0); 16674#L166-2 is_master_triggered_~__retres1~0#1 := 0; 16751#L177 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 16571#L178 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 16572#L425 assume !(0 != activate_threads_~tmp~1#1); 16794#L425-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 16684#L185 assume !(1 == ~t1_pc~0); 16599#L185-2 is_transmit1_triggered_~__retres1~1#1 := 0; 16600#L196 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 16637#L197 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 16643#L433 assume !(0 != activate_threads_~tmp___0~0#1); 16644#L433-2 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 16697#L204 assume !(1 == ~t2_pc~0); 16682#L204-2 is_transmit2_triggered_~__retres1~2#1 := 0; 16683#L215 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 16717#L216 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 16553#L441 assume !(0 != activate_threads_~tmp___1~0#1); 16554#L441-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 16676#L382 assume !(1 == ~M_E~0); 16542#L382-2 assume !(1 == ~T1_E~0); 16543#L387-1 assume !(1 == ~T2_E~0); 16659#L392-1 assume !(1 == ~E_M~0); 16688#L397-1 assume !(1 == ~E_1~0); 16689#L402-1 assume !(1 == ~E_2~0); 16677#L407-1 assume { :end_inline_reset_delta_events } true; 16678#L553-2 [2022-07-22 02:41:59,256 INFO L754 eck$LassoCheckResult]: Loop: 16678#L553-2 assume !false; 17311#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 17202#L319 assume !false; 17310#L282 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 17308#L254 assume !(0 == ~m_st~0); 17309#L258 assume !(0 == ~t1_st~0); 17306#L262 assume !(0 == ~t2_st~0);exists_runnable_thread_~__retres1~3#1 := 0; 17307#L271 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 17302#L272 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 17303#L286 assume !(0 != eval_~tmp~0#1); 17364#L334 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 17363#L224-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 17362#L344-3 assume !(0 == ~M_E~0); 17361#L344-5 assume !(0 == ~T1_E~0); 17360#L349-3 assume 0 == ~T2_E~0;~T2_E~0 := 1; 17359#L354-3 assume !(0 == ~E_M~0); 17358#L359-3 assume 0 == ~E_1~0;~E_1~0 := 1; 17357#L364-3 assume 0 == ~E_2~0;~E_2~0 := 1; 16649#L369-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 16634#L166-12 assume !(1 == ~m_pc~0); 16635#L166-14 is_master_triggered_~__retres1~0#1 := 0; 17222#L177-4 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 17220#L178-4 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 17218#L425-12 assume !(0 != activate_threads_~tmp~1#1); 17216#L425-14 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 17103#L185-12 assume !(1 == ~t1_pc~0); 17098#L185-14 is_transmit1_triggered_~__retres1~1#1 := 0; 17069#L196-4 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 17070#L197-4 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 17031#L433-12 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 17032#L433-14 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 17011#L204-12 assume !(1 == ~t2_pc~0); 17009#L204-14 is_transmit2_triggered_~__retres1~2#1 := 0; 17007#L215-4 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 17005#L216-4 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 17003#L441-12 assume 0 != activate_threads_~tmp___1~0#1;~t2_st~0 := 0; 17001#L441-14 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 16999#L382-3 assume !(1 == ~M_E~0); 16998#L382-5 assume !(1 == ~T1_E~0); 16992#L387-3 assume 1 == ~T2_E~0;~T2_E~0 := 2; 16993#L392-3 assume 1 == ~E_M~0;~E_M~0 := 2; 16986#L397-3 assume 1 == ~E_1~0;~E_1~0 := 2; 16987#L402-3 assume 1 == ~E_2~0;~E_2~0 := 2; 16980#L407-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 16981#L254-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 16880#L271-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 16881#L272-1 start_simulation_#t~ret13#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret13#1;havoc start_simulation_#t~ret13#1; 16828#L572 assume !(0 == start_simulation_~tmp~3#1); 16830#L572-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret12#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 17319#L254-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 17317#L271-2 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 17316#L272-2 stop_simulation_#t~ret12#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret12#1;havoc stop_simulation_#t~ret12#1; 17315#L527 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 17314#L534 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 17313#L535 start_simulation_#t~ret14#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret14#1;havoc start_simulation_#t~ret14#1; 17312#L585 assume !(0 != start_simulation_~tmp___0~1#1); 16678#L553-2 [2022-07-22 02:41:59,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:59,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1077434057, now seen corresponding path program 3 times [2022-07-22 02:41:59,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:59,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514905191] [2022-07-22 02:41:59,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:59,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,262 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:41:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:41:59,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:59,269 INFO L85 PathProgramCache]: Analyzing trace with hash -132818663, now seen corresponding path program 1 times [2022-07-22 02:41:59,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:59,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035010607] [2022-07-22 02:41:59,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:59,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:59,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:59,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035010607] [2022-07-22 02:41:59,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035010607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:59,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:59,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:41:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35037631] [2022-07-22 02:41:59,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:59,284 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:41:59,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:41:59,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:41:59,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:41:59,285 INFO L87 Difference]: Start difference. First operand 1253 states and 1737 transitions. cyclomatic complexity: 486 Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:59,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:41:59,310 INFO L93 Difference]: Finished difference Result 1866 states and 2547 transitions. [2022-07-22 02:41:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:41:59,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1866 states and 2547 transitions. [2022-07-22 02:41:59,325 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1821 [2022-07-22 02:41:59,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1866 states to 1866 states and 2547 transitions. [2022-07-22 02:41:59,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1866 [2022-07-22 02:41:59,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1866 [2022-07-22 02:41:59,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1866 states and 2547 transitions. [2022-07-22 02:41:59,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:41:59,333 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1866 states and 2547 transitions. [2022-07-22 02:41:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states and 2547 transitions. [2022-07-22 02:41:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1804. [2022-07-22 02:41:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1804 states have (on average 1.3664079822616408) internal successors, (2465), 1803 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2465 transitions. [2022-07-22 02:41:59,351 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1804 states and 2465 transitions. [2022-07-22 02:41:59,351 INFO L374 stractBuchiCegarLoop]: Abstraction has 1804 states and 2465 transitions. [2022-07-22 02:41:59,351 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 02:41:59,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1804 states and 2465 transitions. [2022-07-22 02:41:59,355 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1759 [2022-07-22 02:41:59,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:59,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:59,355 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:59,355 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:41:59,355 INFO L752 eck$LassoCheckResult]: Stem: 19934#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 19879#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 19880#L516 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 19906#L224 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 19781#L231 assume 1 == ~m_i~0;~m_st~0 := 0; 19648#L231-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 19649#L236-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 19844#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 19697#L344 assume !(0 == ~M_E~0); 19698#L344-2 assume !(0 == ~T1_E~0); 19873#L349-1 assume !(0 == ~T2_E~0); 19717#L354-1 assume !(0 == ~E_M~0); 19718#L359-1 assume !(0 == ~E_1~0); 19712#L364-1 assume !(0 == ~E_2~0); 19713#L369-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 19802#L166 assume !(1 == ~m_pc~0); 19803#L166-2 is_master_triggered_~__retres1~0#1 := 0; 19886#L177 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 19695#L178 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 19696#L425 assume !(0 != activate_threads_~tmp~1#1); 19923#L425-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 19814#L185 assume !(1 == ~t1_pc~0); 19723#L185-2 is_transmit1_triggered_~__retres1~1#1 := 0; 19724#L196 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 19762#L197 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 19769#L433 assume !(0 != activate_threads_~tmp___0~0#1); 19770#L433-2 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 19827#L204 assume !(1 == ~t2_pc~0); 19812#L204-2 is_transmit2_triggered_~__retres1~2#1 := 0; 19813#L215 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 19846#L216 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 19680#L441 assume !(0 != activate_threads_~tmp___1~0#1); 19681#L441-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 19805#L382 assume !(1 == ~M_E~0); 19668#L382-2 assume !(1 == ~T1_E~0); 19669#L387-1 assume !(1 == ~T2_E~0); 19786#L392-1 assume !(1 == ~E_M~0); 19818#L397-1 assume !(1 == ~E_1~0); 19819#L402-1 assume !(1 == ~E_2~0); 19806#L407-1 assume { :end_inline_reset_delta_events } true; 19807#L553-2 assume !false; 20522#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 20480#L319 [2022-07-22 02:41:59,356 INFO L754 eck$LassoCheckResult]: Loop: 20480#L319 assume !false; 20518#L282 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 20514#L254 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 20509#L271 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 20505#L272 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 20499#L286 assume 0 != eval_~tmp~0#1; 20493#L286-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;eval_~tmp_ndt_1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 20489#L294 assume !(0 != eval_~tmp_ndt_1~0#1); 20485#L291 assume !(0 == ~t1_st~0); 20481#L305 assume !(0 == ~t2_st~0); 20480#L319 [2022-07-22 02:41:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:59,356 INFO L85 PathProgramCache]: Analyzing trace with hash 327016235, now seen corresponding path program 1 times [2022-07-22 02:41:59,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:59,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031852696] [2022-07-22 02:41:59,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:59,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,361 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:41:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:41:59,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:59,369 INFO L85 PathProgramCache]: Analyzing trace with hash 698755222, now seen corresponding path program 1 times [2022-07-22 02:41:59,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:59,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609878066] [2022-07-22 02:41:59,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:59,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:41:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:41:59,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:59,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1780390720, now seen corresponding path program 1 times [2022-07-22 02:41:59,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:59,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660920004] [2022-07-22 02:41:59,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:59,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:59,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660920004] [2022-07-22 02:41:59,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660920004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:59,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:59,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:41:59,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416535770] [2022-07-22 02:41:59,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:59,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:41:59,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:41:59,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:41:59,466 INFO L87 Difference]: Start difference. First operand 1804 states and 2465 transitions. cyclomatic complexity: 664 Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:41:59,514 INFO L93 Difference]: Finished difference Result 3072 states and 4139 transitions. [2022-07-22 02:41:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:41:59,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3072 states and 4139 transitions. [2022-07-22 02:41:59,540 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2988 [2022-07-22 02:41:59,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3072 states to 3072 states and 4139 transitions. [2022-07-22 02:41:59,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3072 [2022-07-22 02:41:59,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3072 [2022-07-22 02:41:59,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3072 states and 4139 transitions. [2022-07-22 02:41:59,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:41:59,568 INFO L369 hiAutomatonCegarLoop]: Abstraction has 3072 states and 4139 transitions. [2022-07-22 02:41:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states and 4139 transitions. [2022-07-22 02:41:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2925. [2022-07-22 02:41:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2925 states, 2925 states have (on average 1.3552136752136752) internal successors, (3964), 2924 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 3964 transitions. [2022-07-22 02:41:59,645 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2925 states and 3964 transitions. [2022-07-22 02:41:59,645 INFO L374 stractBuchiCegarLoop]: Abstraction has 2925 states and 3964 transitions. [2022-07-22 02:41:59,645 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 02:41:59,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2925 states and 3964 transitions. [2022-07-22 02:41:59,651 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2841 [2022-07-22 02:41:59,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:59,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:59,651 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:59,651 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:41:59,652 INFO L752 eck$LassoCheckResult]: Stem: 24825#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 24770#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 24771#L516 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 24794#L224 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 24667#L231 assume 1 == ~m_i~0;~m_st~0 := 0; 24532#L231-2 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 24533#L236-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 24737#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 24584#L344 assume !(0 == ~M_E~0); 24585#L344-2 assume !(0 == ~T1_E~0); 24765#L349-1 assume !(0 == ~T2_E~0); 24603#L354-1 assume !(0 == ~E_M~0); 24604#L359-1 assume !(0 == ~E_1~0); 24598#L364-1 assume !(0 == ~E_2~0); 24599#L369-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 24688#L166 assume !(1 == ~m_pc~0); 24689#L166-2 is_master_triggered_~__retres1~0#1 := 0; 24776#L177 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 24582#L178 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 24583#L425 assume !(0 != activate_threads_~tmp~1#1); 24815#L425-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 24830#L185 assume !(1 == ~t1_pc~0); 26482#L185-2 is_transmit1_triggered_~__retres1~1#1 := 0; 26481#L196 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 24660#L197 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 24655#L433 assume 0 != activate_threads_~tmp___0~0#1;~t1_st~0 := 0; 24656#L433-2 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 24716#L204 assume !(1 == ~t2_pc~0); 24717#L204-2 is_transmit2_triggered_~__retres1~2#1 := 0; 24739#L215 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 24740#L216 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 24563#L441 assume !(0 != activate_threads_~tmp___1~0#1); 24564#L441-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 24724#L382 assume !(1 == ~M_E~0); 24725#L382-2 assume !(1 == ~T1_E~0); 24672#L387-1 assume !(1 == ~T2_E~0); 24673#L392-1 assume !(1 == ~E_M~0); 24704#L397-1 assume !(1 == ~E_1~0); 24705#L402-1 assume !(1 == ~E_2~0); 26450#L407-1 assume { :end_inline_reset_delta_events } true; 26448#L553-2 assume !false; 26428#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 26420#L319 [2022-07-22 02:41:59,652 INFO L754 eck$LassoCheckResult]: Loop: 26420#L319 assume !false; 26417#L282 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 26413#L254 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 26408#L271 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 26405#L272 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 26403#L286 assume 0 != eval_~tmp~0#1; 26398#L286-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;eval_~tmp_ndt_1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 26394#L294 assume !(0 != eval_~tmp_ndt_1~0#1); 26395#L291 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0#1;eval_~tmp_ndt_2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 26443#L308 assume !(0 != eval_~tmp_ndt_2~0#1); 26427#L305 assume !(0 == ~t2_st~0); 26420#L319 [2022-07-22 02:41:59,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:59,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1720071637, now seen corresponding path program 1 times [2022-07-22 02:41:59,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:59,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348536901] [2022-07-22 02:41:59,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:59,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:59,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:59,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348536901] [2022-07-22 02:41:59,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348536901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:59,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:59,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:41:59,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947948167] [2022-07-22 02:41:59,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:59,666 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:41:59,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:59,667 INFO L85 PathProgramCache]: Analyzing trace with hash 186468612, now seen corresponding path program 1 times [2022-07-22 02:41:59,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:59,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919419346] [2022-07-22 02:41:59,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:41:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:41:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:41:59,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:41:59,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:41:59,750 INFO L87 Difference]: Start difference. First operand 2925 states and 3964 transitions. cyclomatic complexity: 1042 Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:59,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:41:59,764 INFO L93 Difference]: Finished difference Result 2888 states and 3915 transitions. [2022-07-22 02:41:59,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:41:59,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2888 states and 3915 transitions. [2022-07-22 02:41:59,773 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2841 [2022-07-22 02:41:59,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2888 states to 2888 states and 3915 transitions. [2022-07-22 02:41:59,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2888 [2022-07-22 02:41:59,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2888 [2022-07-22 02:41:59,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2888 states and 3915 transitions. [2022-07-22 02:41:59,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:41:59,784 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2888 states and 3915 transitions. [2022-07-22 02:41:59,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states and 3915 transitions. [2022-07-22 02:41:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2888. [2022-07-22 02:41:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2888 states have (on average 1.3556094182825484) internal successors, (3915), 2887 states have internal predecessors, (3915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3915 transitions. [2022-07-22 02:41:59,820 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2888 states and 3915 transitions. [2022-07-22 02:41:59,820 INFO L374 stractBuchiCegarLoop]: Abstraction has 2888 states and 3915 transitions. [2022-07-22 02:41:59,820 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 02:41:59,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2888 states and 3915 transitions. [2022-07-22 02:41:59,825 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2841 [2022-07-22 02:41:59,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:41:59,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:41:59,826 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:41:59,826 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:41:59,826 INFO L752 eck$LassoCheckResult]: Stem: 30637#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 30581#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 30582#L516 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 30606#L224 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 30485#L231 assume 1 == ~m_i~0;~m_st~0 := 0; 30351#L231-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 30352#L236-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 30547#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 30399#L344 assume !(0 == ~M_E~0); 30400#L344-2 assume !(0 == ~T1_E~0); 30575#L349-1 assume !(0 == ~T2_E~0); 30418#L354-1 assume !(0 == ~E_M~0); 30419#L359-1 assume !(0 == ~E_1~0); 30413#L364-1 assume !(0 == ~E_2~0); 30414#L369-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 30503#L166 assume !(1 == ~m_pc~0); 30504#L166-2 is_master_triggered_~__retres1~0#1 := 0; 30585#L177 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 30397#L178 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 30398#L425 assume !(0 != activate_threads_~tmp~1#1); 30625#L425-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 30515#L185 assume !(1 == ~t1_pc~0); 30424#L185-2 is_transmit1_triggered_~__retres1~1#1 := 0; 30425#L196 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 30464#L197 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 30469#L433 assume !(0 != activate_threads_~tmp___0~0#1); 30470#L433-2 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 30528#L204 assume !(1 == ~t2_pc~0); 30513#L204-2 is_transmit2_triggered_~__retres1~2#1 := 0; 30514#L215 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 30549#L216 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 30379#L441 assume !(0 != activate_threads_~tmp___1~0#1); 30380#L441-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 30506#L382 assume !(1 == ~M_E~0); 30369#L382-2 assume !(1 == ~T1_E~0); 30370#L387-1 assume !(1 == ~T2_E~0); 30489#L392-1 assume !(1 == ~E_M~0); 30521#L397-1 assume !(1 == ~E_1~0); 30522#L402-1 assume !(1 == ~E_2~0); 30509#L407-1 assume { :end_inline_reset_delta_events } true; 30510#L553-2 assume !false; 31580#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 31578#L319 [2022-07-22 02:41:59,826 INFO L754 eck$LassoCheckResult]: Loop: 31578#L319 assume !false; 31577#L282 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 31575#L254 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 31573#L271 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 31571#L272 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 31569#L286 assume 0 != eval_~tmp~0#1; 31566#L286-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;eval_~tmp_ndt_1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 31563#L294 assume !(0 != eval_~tmp_ndt_1~0#1); 31560#L291 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0#1;eval_~tmp_ndt_2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 31511#L308 assume !(0 != eval_~tmp_ndt_2~0#1); 31559#L305 assume !(0 == ~t2_st~0); 31578#L319 [2022-07-22 02:41:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:59,826 INFO L85 PathProgramCache]: Analyzing trace with hash 327016235, now seen corresponding path program 2 times [2022-07-22 02:41:59,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:59,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279995103] [2022-07-22 02:41:59,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:59,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:41:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:41:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash 186468612, now seen corresponding path program 2 times [2022-07-22 02:41:59,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:59,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241649369] [2022-07-22 02:41:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:59,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,857 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:41:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:41:59,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:41:59,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:41:59,860 INFO L85 PathProgramCache]: Analyzing trace with hash -642569318, now seen corresponding path program 1 times [2022-07-22 02:41:59,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:41:59,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755125002] [2022-07-22 02:41:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:41:59,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:41:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:41:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 02:41:59,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:41:59,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755125002] [2022-07-22 02:41:59,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755125002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:41:59,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:41:59,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:41:59,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496417813] [2022-07-22 02:41:59,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:41:59,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:41:59,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:41:59,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:41:59,928 INFO L87 Difference]: Start difference. First operand 2888 states and 3915 transitions. cyclomatic complexity: 1030 Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:41:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:41:59,957 INFO L93 Difference]: Finished difference Result 4907 states and 6588 transitions. [2022-07-22 02:41:59,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:41:59,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4907 states and 6588 transitions. [2022-07-22 02:41:59,972 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4856 [2022-07-22 02:41:59,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4907 states to 4907 states and 6588 transitions. [2022-07-22 02:41:59,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4907 [2022-07-22 02:41:59,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4907 [2022-07-22 02:41:59,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4907 states and 6588 transitions. [2022-07-22 02:41:59,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:41:59,995 INFO L369 hiAutomatonCegarLoop]: Abstraction has 4907 states and 6588 transitions. [2022-07-22 02:41:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4907 states and 6588 transitions. [2022-07-22 02:42:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4907 to 4851. [2022-07-22 02:42:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4851 states, 4851 states have (on average 1.3465264893836322) internal successors, (6532), 4850 states have internal predecessors, (6532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 02:42:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 6532 transitions. [2022-07-22 02:42:00,098 INFO L392 hiAutomatonCegarLoop]: Abstraction has 4851 states and 6532 transitions. [2022-07-22 02:42:00,098 INFO L374 stractBuchiCegarLoop]: Abstraction has 4851 states and 6532 transitions. [2022-07-22 02:42:00,098 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-22 02:42:00,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4851 states and 6532 transitions. [2022-07-22 02:42:00,109 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4800 [2022-07-22 02:42:00,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:42:00,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:42:00,110 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-22 02:42:00,110 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:42:00,110 INFO L752 eck$LassoCheckResult]: Stem: 38450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(22, 2);call #Ultimate.allocInit(12, 3);~m_pc~0 := 0;~t1_pc~0 := 0;~t2_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~t2_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~t2_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~T2_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~E_2~0 := 2;~token~0 := 0;~local~0 := 0; 38394#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~4#1;havoc main_~__retres1~4#1;assume { :begin_inline_init_model } true;~m_i~0 := 1;~t1_i~0 := 1;~t2_i~0 := 1; 38395#L516 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret13#1, start_simulation_#t~ret14#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1, start_simulation_~tmp___0~1#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;havoc start_simulation_~tmp___0~1#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 38424#L224 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 38285#L231 assume 1 == ~m_i~0;~m_st~0 := 0; 38154#L231-2 assume 1 == ~t1_i~0;~t1_st~0 := 0; 38155#L236-1 assume 1 == ~t2_i~0;~t2_st~0 := 0; 38360#L241-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 38203#L344 assume !(0 == ~M_E~0); 38204#L344-2 assume !(0 == ~T1_E~0); 38389#L349-1 assume !(0 == ~T2_E~0); 38223#L354-1 assume !(0 == ~E_M~0); 38224#L359-1 assume !(0 == ~E_1~0); 38218#L364-1 assume !(0 == ~E_2~0); 38219#L369-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret9#1, activate_threads_#t~ret10#1, activate_threads_#t~ret11#1, activate_threads_~tmp~1#1, activate_threads_~tmp___0~0#1, activate_threads_~tmp___1~0#1;havoc activate_threads_~tmp~1#1;havoc activate_threads_~tmp___0~0#1;havoc activate_threads_~tmp___1~0#1;assume { :begin_inline_is_master_triggered } true;havoc is_master_triggered_#res#1;havoc is_master_triggered_~__retres1~0#1;havoc is_master_triggered_~__retres1~0#1; 38309#L166 assume !(1 == ~m_pc~0); 38310#L166-2 is_master_triggered_~__retres1~0#1 := 0; 38401#L177 is_master_triggered_#res#1 := is_master_triggered_~__retres1~0#1; 38201#L178 activate_threads_#t~ret9#1 := is_master_triggered_#res#1;assume { :end_inline_is_master_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret9#1;havoc activate_threads_#t~ret9#1; 38202#L425 assume !(0 != activate_threads_~tmp~1#1); 38445#L425-2 assume { :begin_inline_is_transmit1_triggered } true;havoc is_transmit1_triggered_#res#1;havoc is_transmit1_triggered_~__retres1~1#1;havoc is_transmit1_triggered_~__retres1~1#1; 38322#L185 assume !(1 == ~t1_pc~0); 38229#L185-2 is_transmit1_triggered_~__retres1~1#1 := 0; 38230#L196 is_transmit1_triggered_#res#1 := is_transmit1_triggered_~__retres1~1#1; 38267#L197 activate_threads_#t~ret10#1 := is_transmit1_triggered_#res#1;assume { :end_inline_is_transmit1_triggered } true;activate_threads_~tmp___0~0#1 := activate_threads_#t~ret10#1;havoc activate_threads_#t~ret10#1; 38273#L433 assume !(0 != activate_threads_~tmp___0~0#1); 38274#L433-2 assume { :begin_inline_is_transmit2_triggered } true;havoc is_transmit2_triggered_#res#1;havoc is_transmit2_triggered_~__retres1~2#1;havoc is_transmit2_triggered_~__retres1~2#1; 38338#L204 assume !(1 == ~t2_pc~0); 38320#L204-2 is_transmit2_triggered_~__retres1~2#1 := 0; 38321#L215 is_transmit2_triggered_#res#1 := is_transmit2_triggered_~__retres1~2#1; 38362#L216 activate_threads_#t~ret11#1 := is_transmit2_triggered_#res#1;assume { :end_inline_is_transmit2_triggered } true;activate_threads_~tmp___1~0#1 := activate_threads_#t~ret11#1;havoc activate_threads_#t~ret11#1; 38183#L441 assume !(0 != activate_threads_~tmp___1~0#1); 38184#L441-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 38314#L382 assume !(1 == ~M_E~0); 38172#L382-2 assume !(1 == ~T1_E~0); 38173#L387-1 assume !(1 == ~T2_E~0); 38292#L392-1 assume !(1 == ~E_M~0); 38328#L397-1 assume !(1 == ~E_1~0); 38329#L402-1 assume !(1 == ~E_2~0); 38315#L407-1 assume { :end_inline_reset_delta_events } true; 38316#L553-2 assume !false; 40603#L554 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret5#1, eval_#t~nondet6#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_3~0#1, eval_~tmp~0#1;havoc eval_~tmp~0#1; 40601#L319 [2022-07-22 02:42:00,110 INFO L754 eck$LassoCheckResult]: Loop: 40601#L319 assume !false; 40598#L282 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~3#1;havoc exists_runnable_thread_~__retres1~3#1; 40594#L254 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~3#1 := 1; 40592#L271 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~3#1; 40590#L272 eval_#t~ret5#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp~0#1 := eval_#t~ret5#1;havoc eval_#t~ret5#1; 40572#L286 assume 0 != eval_~tmp~0#1; 40567#L286-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0#1;eval_~tmp_ndt_1~0#1 := eval_#t~nondet6#1;havoc eval_#t~nondet6#1; 40564#L294 assume !(0 != eval_~tmp_ndt_1~0#1); 40558#L291 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0#1;eval_~tmp_ndt_2~0#1 := eval_#t~nondet7#1;havoc eval_#t~nondet7#1; 40536#L308 assume !(0 != eval_~tmp_ndt_2~0#1); 40556#L305 assume 0 == ~t2_st~0;havoc eval_~tmp_ndt_3~0#1;eval_~tmp_ndt_3~0#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 40602#L322 assume !(0 != eval_~tmp_ndt_3~0#1); 40601#L319 [2022-07-22 02:42:00,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:42:00,110 INFO L85 PathProgramCache]: Analyzing trace with hash 327016235, now seen corresponding path program 3 times [2022-07-22 02:42:00,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:42:00,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6418150] [2022-07-22 02:42:00,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:42:00,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:42:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:42:00,115 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:42:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:42:00,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:42:00,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:42:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1485556888, now seen corresponding path program 1 times [2022-07-22 02:42:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:42:00,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561062171] [2022-07-22 02:42:00,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:42:00,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:42:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:42:00,124 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:42:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:42:00,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:42:00,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:42:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1555184834, now seen corresponding path program 1 times [2022-07-22 02:42:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:42:00,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044377098] [2022-07-22 02:42:00,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:42:00,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:42:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:42:00,141 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:42:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:42:00,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:42:00,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 02:42:00 BoogieIcfgContainer [2022-07-22 02:42:00,882 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 02:42:00,882 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 02:42:00,882 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 02:42:00,882 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 02:42:00,883 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:41:57" (3/4) ... [2022-07-22 02:42:00,885 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-22 02:42:00,915 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 02:42:00,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 02:42:00,915 INFO L158 Benchmark]: Toolchain (without parser) took 4442.79ms. Allocated memory was 60.8MB in the beginning and 257.9MB in the end (delta: 197.1MB). Free memory was 44.6MB in the beginning and 104.2MB in the end (delta: -59.5MB). Peak memory consumption was 137.9MB. Max. memory is 16.1GB. [2022-07-22 02:42:00,916 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 30.0MB in the beginning and 30.0MB in the end (delta: 32.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:42:00,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.28ms. Allocated memory is still 60.8MB. Free memory was 44.5MB in the beginning and 41.0MB in the end (delta: 3.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 02:42:00,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.06ms. Allocated memory is still 60.8MB. Free memory was 41.0MB in the beginning and 37.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:42:00,917 INFO L158 Benchmark]: Boogie Preprocessor took 52.53ms. Allocated memory is still 60.8MB. Free memory was 37.9MB in the beginning and 35.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:42:00,917 INFO L158 Benchmark]: RCFGBuilder took 607.11ms. Allocated memory is still 60.8MB. Free memory was 35.4MB in the beginning and 39.0MB in the end (delta: -3.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-07-22 02:42:00,917 INFO L158 Benchmark]: BuchiAutomizer took 3355.09ms. Allocated memory was 60.8MB in the beginning and 257.9MB in the end (delta: 197.1MB). Free memory was 39.0MB in the beginning and 107.3MB in the end (delta: -68.3MB). Peak memory consumption was 127.3MB. Max. memory is 16.1GB. [2022-07-22 02:42:00,917 INFO L158 Benchmark]: Witness Printer took 32.73ms. Allocated memory is still 257.9MB. Free memory was 107.3MB in the beginning and 104.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 02:42:00,919 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 30.0MB in the beginning and 30.0MB in the end (delta: 32.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.28ms. Allocated memory is still 60.8MB. Free memory was 44.5MB in the beginning and 41.0MB in the end (delta: 3.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.06ms. Allocated memory is still 60.8MB. Free memory was 41.0MB in the beginning and 37.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.53ms. Allocated memory is still 60.8MB. Free memory was 37.9MB in the beginning and 35.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 607.11ms. Allocated memory is still 60.8MB. Free memory was 35.4MB in the beginning and 39.0MB in the end (delta: -3.6MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 3355.09ms. Allocated memory was 60.8MB in the beginning and 257.9MB in the end (delta: 197.1MB). Free memory was 39.0MB in the beginning and 107.3MB in the end (delta: -68.3MB). Peak memory consumption was 127.3MB. Max. memory is 16.1GB. * Witness Printer took 32.73ms. Allocated memory is still 257.9MB. Free memory was 107.3MB in the beginning and 104.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (13 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.13 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 4851 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 2971 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5176 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5176 mSDsluCounter, 8821 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4401 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 329 IncrementalHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 4420 mSDtfsCounter, 329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc2 concLT0 SILN1 SILU0 SILI7 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 281]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {tmp_ndt_3=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1234b6e=0, token=0, NULL=1, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52e8a86c=0, t2_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60f79d2b=0, tmp_ndt_2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e6f3bbf=0, E_1=2, __retres1=1, tmp_ndt_1=0, tmp=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5023c68=0, \result=0, m_st=0, NULL=0, __retres1=0, tmp___0=0, m_pc=0, \result=0, \result=1, \result=0, \result=0, __retres1=0, tmp___1=0, T2_E=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6067b731=0, tmp=0, t1_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@658dbdeb=0, E_2=2, tmp___0=0, T1_E=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11f2a7f=0, __retres1=0, M_E=2, t2_i=1, m_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31818ff4=0, t1_st=0, __retres1=0, local=0, t2_pc=0, E_M=2, kernel_st=1, t1_i=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 281]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int t2_st ; [L30] int m_i ; [L31] int t1_i ; [L32] int t2_i ; [L33] int M_E = 2; [L34] int T1_E = 2; [L35] int T2_E = 2; [L36] int E_M = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L43] int token ; [L45] int local ; [L598] int __retres1 ; [L602] CALL init_model() [L512] m_i = 1 [L513] t1_i = 1 [L514] t2_i = 1 [L602] RET init_model() [L603] CALL start_simulation() [L539] int kernel_st ; [L540] int tmp ; [L541] int tmp___0 ; [L545] kernel_st = 0 [L546] FCALL update_channels() [L547] CALL init_threads() [L231] COND TRUE m_i == 1 [L232] m_st = 0 [L236] COND TRUE t1_i == 1 [L237] t1_st = 0 [L241] COND TRUE t2_i == 1 [L242] t2_st = 0 [L547] RET init_threads() [L548] CALL fire_delta_events() [L344] COND FALSE !(M_E == 0) [L349] COND FALSE !(T1_E == 0) [L354] COND FALSE !(T2_E == 0) [L359] COND FALSE !(E_M == 0) [L364] COND FALSE !(E_1 == 0) [L369] COND FALSE !(E_2 == 0) [L548] RET fire_delta_events() [L549] CALL activate_threads() [L417] int tmp ; [L418] int tmp___0 ; [L419] int tmp___1 ; [L423] CALL, EXPR is_master_triggered() [L163] int __retres1 ; [L166] COND FALSE !(m_pc == 1) [L176] __retres1 = 0 [L178] return (__retres1); [L423] RET, EXPR is_master_triggered() [L423] tmp = is_master_triggered() [L425] COND FALSE !(\read(tmp)) [L431] CALL, EXPR is_transmit1_triggered() [L182] int __retres1 ; [L185] COND FALSE !(t1_pc == 1) [L195] __retres1 = 0 [L197] return (__retres1); [L431] RET, EXPR is_transmit1_triggered() [L431] tmp___0 = is_transmit1_triggered() [L433] COND FALSE !(\read(tmp___0)) [L439] CALL, EXPR is_transmit2_triggered() [L201] int __retres1 ; [L204] COND FALSE !(t2_pc == 1) [L214] __retres1 = 0 [L216] return (__retres1); [L439] RET, EXPR is_transmit2_triggered() [L439] tmp___1 = is_transmit2_triggered() [L441] COND FALSE !(\read(tmp___1)) [L549] RET activate_threads() [L550] CALL reset_delta_events() [L382] COND FALSE !(M_E == 1) [L387] COND FALSE !(T1_E == 1) [L392] COND FALSE !(T2_E == 1) [L397] COND FALSE !(E_M == 1) [L402] COND FALSE !(E_1 == 1) [L407] COND FALSE !(E_2 == 1) [L550] RET reset_delta_events() [L553] COND TRUE 1 [L556] kernel_st = 1 [L557] CALL eval() [L277] int tmp ; Loop: [L281] COND TRUE 1 [L284] CALL, EXPR exists_runnable_thread() [L251] int __retres1 ; [L254] COND TRUE m_st == 0 [L255] __retres1 = 1 [L272] return (__retres1); [L284] RET, EXPR exists_runnable_thread() [L284] tmp = exists_runnable_thread() [L286] COND TRUE \read(tmp) [L291] COND TRUE m_st == 0 [L292] int tmp_ndt_1; [L293] tmp_ndt_1 = __VERIFIER_nondet_int() [L294] COND FALSE !(\read(tmp_ndt_1)) [L305] COND TRUE t1_st == 0 [L306] int tmp_ndt_2; [L307] tmp_ndt_2 = __VERIFIER_nondet_int() [L308] COND FALSE !(\read(tmp_ndt_2)) [L319] COND TRUE t2_st == 0 [L320] int tmp_ndt_3; [L321] tmp_ndt_3 = __VERIFIER_nondet_int() [L322] COND FALSE !(\read(tmp_ndt_3)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-22 02:42:00,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)