./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-ext/14_spin2003.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b8dbc81d 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/14_spin2003.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-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(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f5ed9d077a05ec08544f0d3c902eb6b5aa6ad768c4ec69a1caaef2b54748a07e --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 09:29:13,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 09:29:13,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 09:29:13,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 09:29:13,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 09:29:13,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 09:29:13,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 09:29:13,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 09:29:13,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 09:29:13,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 09:29:13,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 09:29:13,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 09:29:13,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 09:29:13,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 09:29:13,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 09:29:13,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 09:29:13,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 09:29:13,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 09:29:13,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 09:29:13,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 09:29:13,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 09:29:13,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 09:29:13,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 09:29:13,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 09:29:13,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 09:29:13,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 09:29:13,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 09:29:13,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 09:29:13,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 09:29:13,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 09:29:13,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 09:29:13,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 09:29:13,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 09:29:13,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 09:29:13,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 09:29:13,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 09:29:13,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 09:29:13,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 09:29:13,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 09:29:13,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 09:29:13,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 09:29:13,199 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-08-29 09:29:13,231 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 09:29:13,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 09:29:13,233 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 09:29:13,233 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 09:29:13,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 09:29:13,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 09:29:13,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 09:29:13,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 09:29:13,235 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 09:29:13,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 09:29:13,236 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 09:29:13,236 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 09:29:13,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 09:29:13,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 09:29:13,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 09:29:13,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-29 09:29:13,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 09:29:13,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-29 09:29:13,238 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-08-29 09:29:13,238 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 09:29:13,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-29 09:29:13,238 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 09:29:13,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-29 09:29:13,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 09:29:13,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 09:29:13,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 09:29:13,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 09:29:13,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 09:29:13,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 09:29:13,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-29 09:29:13,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 09:29:13,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 09:29:13,240 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 09:29:13,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-29 09:29:13,241 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 09:29:13,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 09:29:13,241 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 09:29:13,241 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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(G ! data-race) ) 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 -> f5ed9d077a05ec08544f0d3c902eb6b5aa6ad768c4ec69a1caaef2b54748a07e Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-29 09:29:13,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 09:29:13,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 09:29:13,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 09:29:13,546 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 09:29:13,546 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 09:29:13,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/14_spin2003.i [2023-08-29 09:29:14,824 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 09:29:15,086 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 09:29:15,090 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003.i [2023-08-29 09:29:15,103 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28c2b407/35f7e5123de74057a3c8995235b4d5cc/FLAGc1fc914f8 [2023-08-29 09:29:15,117 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28c2b407/35f7e5123de74057a3c8995235b4d5cc [2023-08-29 09:29:15,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 09:29:15,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 09:29:15,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 09:29:15,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 09:29:15,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 09:29:15,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:29:15" (1/1) ... [2023-08-29 09:29:15,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33171306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15, skipping insertion in model container [2023-08-29 09:29:15,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 09:29:15" (1/1) ... [2023-08-29 09:29:15,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 09:29:15,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 09:29:15,459 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003.i[30203,30216] [2023-08-29 09:29:15,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 09:29:15,477 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 09:29:15,522 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003.i[30203,30216] [2023-08-29 09:29:15,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 09:29:15,564 INFO L208 MainTranslator]: Completed translation [2023-08-29 09:29:15,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15 WrapperNode [2023-08-29 09:29:15,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 09:29:15,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 09:29:15,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 09:29:15,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 09:29:15,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15" (1/1) ... [2023-08-29 09:29:15,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15" (1/1) ... [2023-08-29 09:29:15,632 INFO L138 Inliner]: procedures = 169, calls = 14, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 69 [2023-08-29 09:29:15,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 09:29:15,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 09:29:15,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 09:29:15,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 09:29:15,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15" (1/1) ... [2023-08-29 09:29:15,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15" (1/1) ... [2023-08-29 09:29:15,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15" (1/1) ... [2023-08-29 09:29:15,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15" (1/1) ... [2023-08-29 09:29:15,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15" (1/1) ... [2023-08-29 09:29:15,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15" (1/1) ... [2023-08-29 09:29:15,662 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15" (1/1) ... [2023-08-29 09:29:15,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15" (1/1) ... [2023-08-29 09:29:15,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 09:29:15,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 09:29:15,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 09:29:15,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 09:29:15,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15" (1/1) ... [2023-08-29 09:29:15,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 09:29:15,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 09:29:15,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 09:29:15,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 09:29:15,726 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-29 09:29:15,726 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-29 09:29:15,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 09:29:15,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 09:29:15,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 09:29:15,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 09:29:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 09:29:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 09:29:15,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 09:29:15,728 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 09:29:15,859 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 09:29:15,861 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 09:29:16,020 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 09:29:16,077 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 09:29:16,083 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-29 09:29:16,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:29:16 BoogieIcfgContainer [2023-08-29 09:29:16,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 09:29:16,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 09:29:16,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 09:29:16,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 09:29:16,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 09:29:15" (1/3) ... [2023-08-29 09:29:16,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28312320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:29:16, skipping insertion in model container [2023-08-29 09:29:16,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 09:29:15" (2/3) ... [2023-08-29 09:29:16,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28312320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 09:29:16, skipping insertion in model container [2023-08-29 09:29:16,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 09:29:16" (3/3) ... [2023-08-29 09:29:16,093 INFO L112 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2023-08-29 09:29:16,100 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-29 09:29:16,109 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 09:29:16,109 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-29 09:29:16,109 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 09:29:16,154 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 09:29:16,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 113 flow [2023-08-29 09:29:16,243 INFO L130 PetriNetUnfolder]: 3/64 cut-off events. [2023-08-29 09:29:16,248 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 09:29:16,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 64 events. 3/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 40. Up to 4 conditions per place. [2023-08-29 09:29:16,254 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 54 transitions, 113 flow [2023-08-29 09:29:16,259 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 54 transitions, 113 flow [2023-08-29 09:29:16,262 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 09:29:16,281 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 54 transitions, 113 flow [2023-08-29 09:29:16,290 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 54 transitions, 113 flow [2023-08-29 09:29:16,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 113 flow [2023-08-29 09:29:16,314 INFO L130 PetriNetUnfolder]: 3/64 cut-off events. [2023-08-29 09:29:16,315 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 09:29:16,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 64 events. 3/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 40. Up to 4 conditions per place. [2023-08-29 09:29:16,318 INFO L119 LiptonReduction]: Number of co-enabled transitions 728 [2023-08-29 09:29:17,740 INFO L134 LiptonReduction]: Checked pairs total: 750 [2023-08-29 09:29:17,740 INFO L136 LiptonReduction]: Total number of compositions: 59 [2023-08-29 09:29:17,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 09:29:17,759 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@37bb78e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 09:29:17,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-29 09:29:17,762 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2023-08-29 09:29:17,762 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 09:29:17,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:17,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 09:29:17,763 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-08-29 09:29:17,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash 9281721, now seen corresponding path program 1 times [2023-08-29 09:29:17,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:17,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292356355] [2023-08-29 09:29:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:17,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:29:17,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:17,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292356355] [2023-08-29 09:29:17,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292356355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:17,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:17,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 09:29:17,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053039647] [2023-08-29 09:29:17,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:17,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 09:29:17,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:17,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 09:29:17,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 09:29:17,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 113 [2023-08-29 09:29:17,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 14 transitions, 33 flow. Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 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) [2023-08-29 09:29:17,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:17,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 113 [2023-08-29 09:29:17,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:18,002 INFO L130 PetriNetUnfolder]: 2/11 cut-off events. [2023-08-29 09:29:18,003 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 09:29:18,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 11 events. 2/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 2 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 14. Up to 11 conditions per place. [2023-08-29 09:29:18,004 INFO L137 encePairwiseOnDemand]: 105/113 looper letters, 5 selfloop transitions, 0 changer transitions 0/6 dead transitions. [2023-08-29 09:29:18,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 6 transitions, 27 flow [2023-08-29 09:29:18,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 09:29:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 09:29:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 99 transitions. [2023-08-29 09:29:18,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43805309734513276 [2023-08-29 09:29:18,017 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 99 transitions. [2023-08-29 09:29:18,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 99 transitions. [2023-08-29 09:29:18,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:18,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 99 transitions. [2023-08-29 09:29:18,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 49.5) internal successors, (99), 2 states have internal predecessors, (99), 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) [2023-08-29 09:29:18,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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) [2023-08-29 09:29:18,031 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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) [2023-08-29 09:29:18,032 INFO L175 Difference]: Start difference. First operand has 17 places, 14 transitions, 33 flow. Second operand 2 states and 99 transitions. [2023-08-29 09:29:18,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 6 transitions, 27 flow [2023-08-29 09:29:18,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 6 transitions, 27 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 09:29:18,036 INFO L231 Difference]: Finished difference. Result has 10 places, 6 transitions, 17 flow [2023-08-29 09:29:18,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=9, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=17, PETRI_PLACES=10, PETRI_TRANSITIONS=6} [2023-08-29 09:29:18,042 INFO L281 CegarLoopForPetriNet]: 17 programPoint places, -7 predicate places. [2023-08-29 09:29:18,042 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 6 transitions, 17 flow [2023-08-29 09:29:18,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 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) [2023-08-29 09:29:18,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:18,043 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-29 09:29:18,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 09:29:18,044 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-08-29 09:29:18,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:18,052 INFO L85 PathProgramCache]: Analyzing trace with hash 329809430, now seen corresponding path program 1 times [2023-08-29 09:29:18,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:18,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303222222] [2023-08-29 09:29:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 09:29:18,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 09:29:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 09:29:18,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 09:29:18,128 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 09:29:18,130 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2023-08-29 09:29:18,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2023-08-29 09:29:18,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2023-08-29 09:29:18,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2023-08-29 09:29:18,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2023-08-29 09:29:18,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2023-08-29 09:29:18,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2023-08-29 09:29:18,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2023-08-29 09:29:18,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2023-08-29 09:29:18,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2023-08-29 09:29:18,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2023-08-29 09:29:18,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2023-08-29 09:29:18,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2023-08-29 09:29:18,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2023-08-29 09:29:18,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2023-08-29 09:29:18,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 09:29:18,146 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-29 09:29:18,149 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 09:29:18,149 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-29 09:29:18,173 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 09:29:18,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 83 transitions, 178 flow [2023-08-29 09:29:18,206 INFO L130 PetriNetUnfolder]: 5/105 cut-off events. [2023-08-29 09:29:18,207 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 09:29:18,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 5/105 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 196 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 68. Up to 6 conditions per place. [2023-08-29 09:29:18,209 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 83 transitions, 178 flow [2023-08-29 09:29:18,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 83 transitions, 178 flow [2023-08-29 09:29:18,210 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 09:29:18,210 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 83 transitions, 178 flow [2023-08-29 09:29:18,210 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 83 transitions, 178 flow [2023-08-29 09:29:18,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 83 transitions, 178 flow [2023-08-29 09:29:18,226 INFO L130 PetriNetUnfolder]: 5/105 cut-off events. [2023-08-29 09:29:18,227 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-29 09:29:18,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 5/105 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 196 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 68. Up to 6 conditions per place. [2023-08-29 09:29:18,229 INFO L119 LiptonReduction]: Number of co-enabled transitions 3080 [2023-08-29 09:29:19,049 INFO L134 LiptonReduction]: Checked pairs total: 8772 [2023-08-29 09:29:19,050 INFO L136 LiptonReduction]: Total number of compositions: 46 [2023-08-29 09:29:19,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 09:29:19,052 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@37bb78e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 09:29:19,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-08-29 09:29:19,054 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2023-08-29 09:29:19,054 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 09:29:19,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:19,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 09:29:19,055 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-08-29 09:29:19,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:19,055 INFO L85 PathProgramCache]: Analyzing trace with hash 14427559, now seen corresponding path program 1 times [2023-08-29 09:29:19,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:19,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163046310] [2023-08-29 09:29:19,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:19,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:29:19,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:19,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163046310] [2023-08-29 09:29:19,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163046310] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:19,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:19,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 09:29:19,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754927840] [2023-08-29 09:29:19,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:19,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 09:29:19,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:19,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 09:29:19,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 09:29:19,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 129 [2023-08-29 09:29:19,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 104 flow. Second operand has 2 states, 2 states have (on average 65.0) internal successors, (130), 2 states have internal predecessors, (130), 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) [2023-08-29 09:29:19,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:19,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 129 [2023-08-29 09:29:19,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:19,142 INFO L130 PetriNetUnfolder]: 132/397 cut-off events. [2023-08-29 09:29:19,142 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2023-08-29 09:29:19,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 397 events. 132/397 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2236 event pairs, 132 based on Foata normal form. 14/380 useless extension candidates. Maximal degree in co-relation 87. Up to 247 conditions per place. [2023-08-29 09:29:19,146 INFO L137 encePairwiseOnDemand]: 118/129 looper letters, 16 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2023-08-29 09:29:19,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 114 flow [2023-08-29 09:29:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 09:29:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 09:29:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 153 transitions. [2023-08-29 09:29:19,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5930232558139535 [2023-08-29 09:29:19,148 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 153 transitions. [2023-08-29 09:29:19,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 153 transitions. [2023-08-29 09:29:19,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:19,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 153 transitions. [2023-08-29 09:29:19,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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) [2023-08-29 09:29:19,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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) [2023-08-29 09:29:19,151 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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) [2023-08-29 09:29:19,151 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 104 flow. Second operand 2 states and 153 transitions. [2023-08-29 09:29:19,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 114 flow [2023-08-29 09:29:19,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 112 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-29 09:29:19,153 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 80 flow [2023-08-29 09:29:19,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-08-29 09:29:19,154 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2023-08-29 09:29:19,154 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 80 flow [2023-08-29 09:29:19,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.0) internal successors, (130), 2 states have internal predecessors, (130), 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) [2023-08-29 09:29:19,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:19,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:29:19,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 09:29:19,155 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-08-29 09:29:19,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:19,155 INFO L85 PathProgramCache]: Analyzing trace with hash 315102725, now seen corresponding path program 1 times [2023-08-29 09:29:19,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:19,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226699438] [2023-08-29 09:29:19,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:19,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:29:19,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:19,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226699438] [2023-08-29 09:29:19,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226699438] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:19,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:19,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:29:19,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242603848] [2023-08-29 09:29:19,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:19,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:29:19,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:19,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:29:19,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:29:19,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 129 [2023-08-29 09:29:19,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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) [2023-08-29 09:29:19,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:19,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 129 [2023-08-29 09:29:19,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:19,367 INFO L130 PetriNetUnfolder]: 257/578 cut-off events. [2023-08-29 09:29:19,367 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2023-08-29 09:29:19,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 578 events. 257/578 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3324 event pairs, 211 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 1074. Up to 418 conditions per place. [2023-08-29 09:29:19,376 INFO L137 encePairwiseOnDemand]: 123/129 looper letters, 28 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-08-29 09:29:19,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 175 flow [2023-08-29 09:29:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:29:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:29:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2023-08-29 09:29:19,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49870801033591733 [2023-08-29 09:29:19,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 193 transitions. [2023-08-29 09:29:19,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 193 transitions. [2023-08-29 09:29:19,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:19,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 193 transitions. [2023-08-29 09:29:19,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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) [2023-08-29 09:29:19,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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) [2023-08-29 09:29:19,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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) [2023-08-29 09:29:19,392 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 80 flow. Second operand 3 states and 193 transitions. [2023-08-29 09:29:19,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 175 flow [2023-08-29 09:29:19,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 175 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 09:29:19,394 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 113 flow [2023-08-29 09:29:19,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-08-29 09:29:19,397 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2023-08-29 09:29:19,397 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 113 flow [2023-08-29 09:29:19,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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) [2023-08-29 09:29:19,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:19,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:29:19,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 09:29:19,398 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-08-29 09:29:19,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:19,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1571814264, now seen corresponding path program 1 times [2023-08-29 09:29:19,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:19,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769938186] [2023-08-29 09:29:19,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:19,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:29:19,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:19,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769938186] [2023-08-29 09:29:19,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769938186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:19,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:19,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:29:19,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937975556] [2023-08-29 09:29:19,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:19,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:29:19,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:19,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:29:19,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:29:19,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 129 [2023-08-29 09:29:19,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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) [2023-08-29 09:29:19,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:19,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 129 [2023-08-29 09:29:19,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:19,591 INFO L130 PetriNetUnfolder]: 329/711 cut-off events. [2023-08-29 09:29:19,592 INFO L131 PetriNetUnfolder]: For 111/117 co-relation queries the response was YES. [2023-08-29 09:29:19,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 711 events. 329/711 cut-off events. For 111/117 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4067 event pairs, 219 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 1495. Up to 480 conditions per place. [2023-08-29 09:29:19,597 INFO L137 encePairwiseOnDemand]: 122/129 looper letters, 33 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2023-08-29 09:29:19,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 228 flow [2023-08-29 09:29:19,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:29:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:29:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2023-08-29 09:29:19,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5038759689922481 [2023-08-29 09:29:19,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 195 transitions. [2023-08-29 09:29:19,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 195 transitions. [2023-08-29 09:29:19,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:19,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 195 transitions. [2023-08-29 09:29:19,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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) [2023-08-29 09:29:19,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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) [2023-08-29 09:29:19,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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) [2023-08-29 09:29:19,602 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 113 flow. Second operand 3 states and 195 transitions. [2023-08-29 09:29:19,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 228 flow [2023-08-29 09:29:19,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 223 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 09:29:19,606 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 160 flow [2023-08-29 09:29:19,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-08-29 09:29:19,608 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2023-08-29 09:29:19,608 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 160 flow [2023-08-29 09:29:19,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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) [2023-08-29 09:29:19,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:19,610 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-29 09:29:19,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 09:29:19,610 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-08-29 09:29:19,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:19,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1251644294, now seen corresponding path program 1 times [2023-08-29 09:29:19,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:19,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008964484] [2023-08-29 09:29:19,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 09:29:19,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 09:29:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 09:29:19,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 09:29:19,653 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 09:29:19,654 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2023-08-29 09:29:19,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2023-08-29 09:29:19,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2023-08-29 09:29:19,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2023-08-29 09:29:19,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2023-08-29 09:29:19,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2023-08-29 09:29:19,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2023-08-29 09:29:19,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2023-08-29 09:29:19,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2023-08-29 09:29:19,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2023-08-29 09:29:19,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2023-08-29 09:29:19,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2023-08-29 09:29:19,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2023-08-29 09:29:19,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2023-08-29 09:29:19,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2023-08-29 09:29:19,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2023-08-29 09:29:19,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2023-08-29 09:29:19,665 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2023-08-29 09:29:19,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2023-08-29 09:29:19,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2023-08-29 09:29:19,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2023-08-29 09:29:19,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2023-08-29 09:29:19,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 09:29:19,666 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-29 09:29:19,667 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 09:29:19,667 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-29 09:29:19,697 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 09:29:19,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 112 transitions, 245 flow [2023-08-29 09:29:19,719 INFO L130 PetriNetUnfolder]: 7/146 cut-off events. [2023-08-29 09:29:19,719 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 09:29:19,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 146 events. 7/146 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 347 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 109. Up to 8 conditions per place. [2023-08-29 09:29:19,720 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 112 transitions, 245 flow [2023-08-29 09:29:19,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 112 transitions, 245 flow [2023-08-29 09:29:19,722 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 09:29:19,722 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 112 transitions, 245 flow [2023-08-29 09:29:19,724 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 112 transitions, 245 flow [2023-08-29 09:29:19,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 112 transitions, 245 flow [2023-08-29 09:29:19,742 INFO L130 PetriNetUnfolder]: 7/146 cut-off events. [2023-08-29 09:29:19,742 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-08-29 09:29:19,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 146 events. 7/146 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 347 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 109. Up to 8 conditions per place. [2023-08-29 09:29:19,747 INFO L119 LiptonReduction]: Number of co-enabled transitions 7056 [2023-08-29 09:29:20,722 INFO L134 LiptonReduction]: Checked pairs total: 26617 [2023-08-29 09:29:20,722 INFO L136 LiptonReduction]: Total number of compositions: 61 [2023-08-29 09:29:20,723 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 09:29:20,724 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@37bb78e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 09:29:20,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-08-29 09:29:20,725 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2023-08-29 09:29:20,725 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 09:29:20,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:20,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 09:29:20,726 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-08-29 09:29:20,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:20,726 INFO L85 PathProgramCache]: Analyzing trace with hash 20640615, now seen corresponding path program 1 times [2023-08-29 09:29:20,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:20,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73093576] [2023-08-29 09:29:20,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:20,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:29:20,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:20,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73093576] [2023-08-29 09:29:20,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73093576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:20,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:20,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 09:29:20,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941438091] [2023-08-29 09:29:20,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:20,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 09:29:20,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:20,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 09:29:20,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 09:29:20,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 173 [2023-08-29 09:29:20,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 151 flow. Second operand has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 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) [2023-08-29 09:29:20,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:20,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 173 [2023-08-29 09:29:20,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:21,056 INFO L130 PetriNetUnfolder]: 1819/3817 cut-off events. [2023-08-29 09:29:21,056 INFO L131 PetriNetUnfolder]: For 385/385 co-relation queries the response was YES. [2023-08-29 09:29:21,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6842 conditions, 3817 events. 1819/3817 cut-off events. For 385/385 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 29364 event pairs, 1819 based on Foata normal form. 0/3443 useless extension candidates. Maximal degree in co-relation 753. Up to 2718 conditions per place. [2023-08-29 09:29:21,114 INFO L137 encePairwiseOnDemand]: 158/173 looper letters, 24 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2023-08-29 09:29:21,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 50 transitions, 169 flow [2023-08-29 09:29:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 09:29:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 09:29:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 205 transitions. [2023-08-29 09:29:21,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5924855491329479 [2023-08-29 09:29:21,116 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 205 transitions. [2023-08-29 09:29:21,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 205 transitions. [2023-08-29 09:29:21,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:21,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 205 transitions. [2023-08-29 09:29:21,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 102.5) internal successors, (205), 2 states have internal predecessors, (205), 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) [2023-08-29 09:29:21,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 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) [2023-08-29 09:29:21,119 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 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) [2023-08-29 09:29:21,119 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 151 flow. Second operand 2 states and 205 transitions. [2023-08-29 09:29:21,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 50 transitions, 169 flow [2023-08-29 09:29:21,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 163 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-29 09:29:21,121 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 115 flow [2023-08-29 09:29:21,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=115, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-29 09:29:21,122 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -12 predicate places. [2023-08-29 09:29:21,122 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 115 flow [2023-08-29 09:29:21,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 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) [2023-08-29 09:29:21,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:21,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:29:21,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 09:29:21,123 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-08-29 09:29:21,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash 724867159, now seen corresponding path program 1 times [2023-08-29 09:29:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:21,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327507720] [2023-08-29 09:29:21,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:29:21,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:21,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327507720] [2023-08-29 09:29:21,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327507720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:21,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:21,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:29:21,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975027006] [2023-08-29 09:29:21,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:21,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:29:21,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:21,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:29:21,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:29:21,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 173 [2023-08-29 09:29:21,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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) [2023-08-29 09:29:21,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:21,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 173 [2023-08-29 09:29:21,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:21,833 INFO L130 PetriNetUnfolder]: 4611/8096 cut-off events. [2023-08-29 09:29:21,834 INFO L131 PetriNetUnfolder]: For 296/296 co-relation queries the response was YES. [2023-08-29 09:29:21,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15204 conditions, 8096 events. 4611/8096 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 60322 event pairs, 3937 based on Foata normal form. 0/7265 useless extension candidates. Maximal degree in co-relation 15198. Up to 6234 conditions per place. [2023-08-29 09:29:21,934 INFO L137 encePairwiseOnDemand]: 164/173 looper letters, 44 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2023-08-29 09:29:21,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 271 flow [2023-08-29 09:29:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:29:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:29:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2023-08-29 09:29:21,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067437379576107 [2023-08-29 09:29:21,937 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 263 transitions. [2023-08-29 09:29:21,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 263 transitions. [2023-08-29 09:29:21,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:21,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 263 transitions. [2023-08-29 09:29:21,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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) [2023-08-29 09:29:21,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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) [2023-08-29 09:29:21,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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) [2023-08-29 09:29:21,939 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 115 flow. Second operand 3 states and 263 transitions. [2023-08-29 09:29:21,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 271 flow [2023-08-29 09:29:21,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 271 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 09:29:21,943 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 169 flow [2023-08-29 09:29:21,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2023-08-29 09:29:21,945 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2023-08-29 09:29:21,945 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 169 flow [2023-08-29 09:29:21,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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) [2023-08-29 09:29:21,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:21,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:29:21,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 09:29:21,946 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-08-29 09:29:21,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:21,946 INFO L85 PathProgramCache]: Analyzing trace with hash -574784502, now seen corresponding path program 1 times [2023-08-29 09:29:21,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:21,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444446987] [2023-08-29 09:29:21,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:21,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:29:21,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:21,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444446987] [2023-08-29 09:29:21,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444446987] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:21,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:21,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:29:21,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641896324] [2023-08-29 09:29:21,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:21,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:29:21,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:21,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:29:21,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:29:22,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 173 [2023-08-29 09:29:22,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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) [2023-08-29 09:29:22,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:22,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 173 [2023-08-29 09:29:22,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:22,844 INFO L130 PetriNetUnfolder]: 6001/10309 cut-off events. [2023-08-29 09:29:22,844 INFO L131 PetriNetUnfolder]: For 2110/2286 co-relation queries the response was YES. [2023-08-29 09:29:22,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22204 conditions, 10309 events. 6001/10309 cut-off events. For 2110/2286 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 77907 event pairs, 4363 based on Foata normal form. 0/9301 useless extension candidates. Maximal degree in co-relation 22196. Up to 7522 conditions per place. [2023-08-29 09:29:22,904 INFO L137 encePairwiseOnDemand]: 163/173 looper letters, 52 selfloop transitions, 9 changer transitions 0/79 dead transitions. [2023-08-29 09:29:22,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 357 flow [2023-08-29 09:29:22,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:29:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:29:22,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2023-08-29 09:29:22,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105973025048169 [2023-08-29 09:29:22,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 265 transitions. [2023-08-29 09:29:22,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 265 transitions. [2023-08-29 09:29:22,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:22,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 265 transitions. [2023-08-29 09:29:22,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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) [2023-08-29 09:29:22,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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) [2023-08-29 09:29:22,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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) [2023-08-29 09:29:22,909 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 169 flow. Second operand 3 states and 265 transitions. [2023-08-29 09:29:22,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 357 flow [2023-08-29 09:29:22,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 09:29:22,914 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 243 flow [2023-08-29 09:29:22,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2023-08-29 09:29:22,916 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -6 predicate places. [2023-08-29 09:29:22,916 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 243 flow [2023-08-29 09:29:22,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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) [2023-08-29 09:29:22,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:22,916 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:29:22,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 09:29:22,917 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-08-29 09:29:22,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:22,917 INFO L85 PathProgramCache]: Analyzing trace with hash 103416486, now seen corresponding path program 1 times [2023-08-29 09:29:22,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:22,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645191960] [2023-08-29 09:29:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:22,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 09:29:22,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:22,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645191960] [2023-08-29 09:29:22,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645191960] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:22,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:22,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:29:22,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206502051] [2023-08-29 09:29:22,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:22,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:29:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:22,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:29:22,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:29:22,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 173 [2023-08-29 09:29:22,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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) [2023-08-29 09:29:22,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:22,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 173 [2023-08-29 09:29:22,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:23,882 INFO L130 PetriNetUnfolder]: 6302/10963 cut-off events. [2023-08-29 09:29:23,883 INFO L131 PetriNetUnfolder]: For 6258/6780 co-relation queries the response was YES. [2023-08-29 09:29:23,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26835 conditions, 10963 events. 6302/10963 cut-off events. For 6258/6780 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 85348 event pairs, 4554 based on Foata normal form. 26/9735 useless extension candidates. Maximal degree in co-relation 26826. Up to 8411 conditions per place. [2023-08-29 09:29:24,035 INFO L137 encePairwiseOnDemand]: 164/173 looper letters, 55 selfloop transitions, 14 changer transitions 0/89 dead transitions. [2023-08-29 09:29:24,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 89 transitions, 478 flow [2023-08-29 09:29:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:29:24,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:29:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2023-08-29 09:29:24,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048169556840078 [2023-08-29 09:29:24,038 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2023-08-29 09:29:24,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2023-08-29 09:29:24,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:24,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2023-08-29 09:29:24,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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) [2023-08-29 09:29:24,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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) [2023-08-29 09:29:24,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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) [2023-08-29 09:29:24,040 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 243 flow. Second operand 3 states and 262 transitions. [2023-08-29 09:29:24,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 89 transitions, 478 flow [2023-08-29 09:29:24,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 432 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-29 09:29:24,083 INFO L231 Difference]: Finished difference. Result has 65 places, 76 transitions, 327 flow [2023-08-29 09:29:24,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=65, PETRI_TRANSITIONS=76} [2023-08-29 09:29:24,084 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -5 predicate places. [2023-08-29 09:29:24,084 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 76 transitions, 327 flow [2023-08-29 09:29:24,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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) [2023-08-29 09:29:24,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:24,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:29:24,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 09:29:24,085 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-08-29 09:29:24,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:24,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1682895140, now seen corresponding path program 1 times [2023-08-29 09:29:24,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:24,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371183460] [2023-08-29 09:29:24,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:24,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:29:24,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:24,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371183460] [2023-08-29 09:29:24,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371183460] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:24,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:24,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:29:24,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161121083] [2023-08-29 09:29:24,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:24,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:29:24,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:24,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:29:24,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:29:24,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 173 [2023-08-29 09:29:24,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 76 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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) [2023-08-29 09:29:24,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:24,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 173 [2023-08-29 09:29:24,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:25,374 INFO L130 PetriNetUnfolder]: 12532/20442 cut-off events. [2023-08-29 09:29:25,375 INFO L131 PetriNetUnfolder]: For 18375/19725 co-relation queries the response was YES. [2023-08-29 09:29:25,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54017 conditions, 20442 events. 12532/20442 cut-off events. For 18375/19725 co-relation queries the response was YES. Maximal size of possible extension queue 1010. Compared 159892 event pairs, 4633 based on Foata normal form. 132/18945 useless extension candidates. Maximal degree in co-relation 54007. Up to 9536 conditions per place. [2023-08-29 09:29:25,502 INFO L137 encePairwiseOnDemand]: 158/173 looper letters, 81 selfloop transitions, 33 changer transitions 0/129 dead transitions. [2023-08-29 09:29:25,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 129 transitions, 806 flow [2023-08-29 09:29:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:29:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:29:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2023-08-29 09:29:25,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5279383429672447 [2023-08-29 09:29:25,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 274 transitions. [2023-08-29 09:29:25,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 274 transitions. [2023-08-29 09:29:25,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:25,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 274 transitions. [2023-08-29 09:29:25,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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) [2023-08-29 09:29:25,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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) [2023-08-29 09:29:25,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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) [2023-08-29 09:29:25,507 INFO L175 Difference]: Start difference. First operand has 65 places, 76 transitions, 327 flow. Second operand 3 states and 274 transitions. [2023-08-29 09:29:25,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 129 transitions, 806 flow [2023-08-29 09:29:25,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 129 transitions, 781 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 09:29:25,515 INFO L231 Difference]: Finished difference. Result has 68 places, 108 transitions, 695 flow [2023-08-29 09:29:25,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=68, PETRI_TRANSITIONS=108} [2023-08-29 09:29:25,516 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -2 predicate places. [2023-08-29 09:29:25,516 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 108 transitions, 695 flow [2023-08-29 09:29:25,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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) [2023-08-29 09:29:25,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:25,517 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:29:25,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 09:29:25,517 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-08-29 09:29:25,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:25,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1968363732, now seen corresponding path program 1 times [2023-08-29 09:29:25,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:25,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615080427] [2023-08-29 09:29:25,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:25,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 09:29:25,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:25,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615080427] [2023-08-29 09:29:25,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615080427] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:25,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:25,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 09:29:25,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620471903] [2023-08-29 09:29:25,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:25,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:29:25,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:25,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:29:25,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:29:25,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 173 [2023-08-29 09:29:25,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 108 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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) [2023-08-29 09:29:25,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:25,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 173 [2023-08-29 09:29:25,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:25,661 INFO L130 PetriNetUnfolder]: 141/557 cut-off events. [2023-08-29 09:29:25,661 INFO L131 PetriNetUnfolder]: For 779/779 co-relation queries the response was YES. [2023-08-29 09:29:25,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 557 events. 141/557 cut-off events. For 779/779 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3199 event pairs, 17 based on Foata normal form. 148/676 useless extension candidates. Maximal degree in co-relation 1477. Up to 292 conditions per place. [2023-08-29 09:29:25,663 INFO L137 encePairwiseOnDemand]: 167/173 looper letters, 21 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2023-08-29 09:29:25,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 50 transitions, 287 flow [2023-08-29 09:29:25,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:29:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:29:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2023-08-29 09:29:25,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5317919075144508 [2023-08-29 09:29:25,665 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 276 transitions. [2023-08-29 09:29:25,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 276 transitions. [2023-08-29 09:29:25,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:25,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 276 transitions. [2023-08-29 09:29:25,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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) [2023-08-29 09:29:25,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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) [2023-08-29 09:29:25,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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) [2023-08-29 09:29:25,670 INFO L175 Difference]: Start difference. First operand has 68 places, 108 transitions, 695 flow. Second operand 3 states and 276 transitions. [2023-08-29 09:29:25,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 50 transitions, 287 flow [2023-08-29 09:29:25,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 197 flow, removed 31 selfloop flow, removed 8 redundant places. [2023-08-29 09:29:25,673 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 139 flow [2023-08-29 09:29:25,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-29 09:29:25,674 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -14 predicate places. [2023-08-29 09:29:25,675 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 139 flow [2023-08-29 09:29:25,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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) [2023-08-29 09:29:25,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:25,675 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:29:25,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 09:29:25,676 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-08-29 09:29:25,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:25,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1390407090, now seen corresponding path program 1 times [2023-08-29 09:29:25,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:25,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060374541] [2023-08-29 09:29:25,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:25,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 09:29:25,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:25,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060374541] [2023-08-29 09:29:25,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060374541] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:25,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:25,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:29:25,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476798074] [2023-08-29 09:29:25,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:25,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:29:25,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:25,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:29:25,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:29:25,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 173 [2023-08-29 09:29:25,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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) [2023-08-29 09:29:25,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:25,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 173 [2023-08-29 09:29:25,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:25,800 INFO L130 PetriNetUnfolder]: 193/625 cut-off events. [2023-08-29 09:29:25,801 INFO L131 PetriNetUnfolder]: For 187/187 co-relation queries the response was YES. [2023-08-29 09:29:25,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 625 events. 193/625 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3650 event pairs, 167 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 1387. Up to 442 conditions per place. [2023-08-29 09:29:25,802 INFO L137 encePairwiseOnDemand]: 170/173 looper letters, 34 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-29 09:29:25,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 218 flow [2023-08-29 09:29:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:29:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:29:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2023-08-29 09:29:25,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4701348747591522 [2023-08-29 09:29:25,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 244 transitions. [2023-08-29 09:29:25,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 244 transitions. [2023-08-29 09:29:25,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:25,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 244 transitions. [2023-08-29 09:29:25,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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) [2023-08-29 09:29:25,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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) [2023-08-29 09:29:25,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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) [2023-08-29 09:29:25,806 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 139 flow. Second operand 3 states and 244 transitions. [2023-08-29 09:29:25,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 218 flow [2023-08-29 09:29:25,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 09:29:25,808 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 135 flow [2023-08-29 09:29:25,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-08-29 09:29:25,808 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -14 predicate places. [2023-08-29 09:29:25,809 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 135 flow [2023-08-29 09:29:25,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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) [2023-08-29 09:29:25,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:25,809 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-29 09:29:25,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 09:29:25,809 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-08-29 09:29:25,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:25,810 INFO L85 PathProgramCache]: Analyzing trace with hash -284948833, now seen corresponding path program 1 times [2023-08-29 09:29:25,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:25,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078981898] [2023-08-29 09:29:25,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:25,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 09:29:25,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 09:29:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 09:29:25,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 09:29:25,833 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 09:29:25,834 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2023-08-29 09:29:25,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2023-08-29 09:29:25,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2023-08-29 09:29:25,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2023-08-29 09:29:25,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2023-08-29 09:29:25,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2023-08-29 09:29:25,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2023-08-29 09:29:25,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2023-08-29 09:29:25,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2023-08-29 09:29:25,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2023-08-29 09:29:25,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2023-08-29 09:29:25,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2023-08-29 09:29:25,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2023-08-29 09:29:25,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2023-08-29 09:29:25,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2023-08-29 09:29:25,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2023-08-29 09:29:25,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2023-08-29 09:29:25,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2023-08-29 09:29:25,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2023-08-29 09:29:25,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2023-08-29 09:29:25,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2023-08-29 09:29:25,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2023-08-29 09:29:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2023-08-29 09:29:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2023-08-29 09:29:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2023-08-29 09:29:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2023-08-29 09:29:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2023-08-29 09:29:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2023-08-29 09:29:25,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2023-08-29 09:29:25,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 09:29:25,838 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:29:25,838 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 09:29:25,838 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-29 09:29:25,856 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 09:29:25,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 141 transitions, 314 flow [2023-08-29 09:29:25,872 INFO L130 PetriNetUnfolder]: 9/187 cut-off events. [2023-08-29 09:29:25,872 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 09:29:25,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 187 events. 9/187 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 512 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 154. Up to 10 conditions per place. [2023-08-29 09:29:25,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 141 transitions, 314 flow [2023-08-29 09:29:25,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 141 transitions, 314 flow [2023-08-29 09:29:25,874 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 09:29:25,874 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 141 transitions, 314 flow [2023-08-29 09:29:25,875 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 141 transitions, 314 flow [2023-08-29 09:29:25,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 141 transitions, 314 flow [2023-08-29 09:29:25,888 INFO L130 PetriNetUnfolder]: 9/187 cut-off events. [2023-08-29 09:29:25,889 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2023-08-29 09:29:25,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 187 events. 9/187 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 512 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 154. Up to 10 conditions per place. [2023-08-29 09:29:25,896 INFO L119 LiptonReduction]: Number of co-enabled transitions 12656 [2023-08-29 09:29:26,997 INFO L134 LiptonReduction]: Checked pairs total: 48761 [2023-08-29 09:29:26,997 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-08-29 09:29:26,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 09:29:27,000 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@37bb78e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 09:29:27,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2023-08-29 09:29:27,001 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2023-08-29 09:29:27,001 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 09:29:27,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:27,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 09:29:27,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-29 09:29:27,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:27,002 INFO L85 PathProgramCache]: Analyzing trace with hash 28148605, now seen corresponding path program 1 times [2023-08-29 09:29:27,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:27,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453965253] [2023-08-29 09:29:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:29:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453965253] [2023-08-29 09:29:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453965253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:27,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:27,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 09:29:27,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767457512] [2023-08-29 09:29:27,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:27,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 09:29:27,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:27,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 09:29:27,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 09:29:27,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 219 [2023-08-29 09:29:27,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 198 flow. Second operand has 2 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 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) [2023-08-29 09:29:27,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:27,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 219 [2023-08-29 09:29:27,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:29,669 INFO L130 PetriNetUnfolder]: 23951/41095 cut-off events. [2023-08-29 09:29:29,669 INFO L131 PetriNetUnfolder]: For 5773/5773 co-relation queries the response was YES. [2023-08-29 09:29:29,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76456 conditions, 41095 events. 23951/41095 cut-off events. For 5773/5773 co-relation queries the response was YES. Maximal size of possible extension queue 1451. Compared 366435 event pairs, 23951 based on Foata normal form. 3072/41041 useless extension candidates. Maximal degree in co-relation 7770. Up to 32162 conditions per place. [2023-08-29 09:29:29,914 INFO L137 encePairwiseOnDemand]: 201/219 looper letters, 33 selfloop transitions, 0 changer transitions 0/65 dead transitions. [2023-08-29 09:29:29,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 65 transitions, 228 flow [2023-08-29 09:29:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 09:29:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 09:29:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 257 transitions. [2023-08-29 09:29:29,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.58675799086758 [2023-08-29 09:29:29,917 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 257 transitions. [2023-08-29 09:29:29,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 257 transitions. [2023-08-29 09:29:29,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:29,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 257 transitions. [2023-08-29 09:29:29,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 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) [2023-08-29 09:29:29,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 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) [2023-08-29 09:29:29,919 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 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) [2023-08-29 09:29:29,920 INFO L175 Difference]: Start difference. First operand has 91 places, 83 transitions, 198 flow. Second operand 2 states and 257 transitions. [2023-08-29 09:29:29,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 65 transitions, 228 flow [2023-08-29 09:29:29,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 65 transitions, 216 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-29 09:29:29,926 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 150 flow [2023-08-29 09:29:29,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=150, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2023-08-29 09:29:29,928 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -16 predicate places. [2023-08-29 09:29:29,928 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 150 flow [2023-08-29 09:29:29,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.0) internal successors, (210), 2 states have internal predecessors, (210), 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) [2023-08-29 09:29:29,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:29,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:29:29,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 09:29:29,929 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-29 09:29:29,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1057250607, now seen corresponding path program 1 times [2023-08-29 09:29:29,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:29,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130983657] [2023-08-29 09:29:29,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:29,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:29:29,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130983657] [2023-08-29 09:29:29,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130983657] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:29,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:29,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:29:29,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755770365] [2023-08-29 09:29:29,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:29,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:29:29,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:29,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:29:29,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:29:29,995 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 219 [2023-08-29 09:29:29,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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) [2023-08-29 09:29:29,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:29,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 219 [2023-08-29 09:29:29,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:34,312 INFO L130 PetriNetUnfolder]: 48081/74367 cut-off events. [2023-08-29 09:29:34,312 INFO L131 PetriNetUnfolder]: For 2594/2594 co-relation queries the response was YES. [2023-08-29 09:29:34,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141307 conditions, 74367 events. 48081/74367 cut-off events. For 2594/2594 co-relation queries the response was YES. Maximal size of possible extension queue 2455. Compared 615156 event pairs, 41569 based on Foata normal form. 0/68529 useless extension candidates. Maximal degree in co-relation 141300. Up to 59562 conditions per place. [2023-08-29 09:29:34,704 INFO L137 encePairwiseOnDemand]: 207/219 looper letters, 55 selfloop transitions, 11 changer transitions 0/93 dead transitions. [2023-08-29 09:29:34,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 93 transitions, 353 flow [2023-08-29 09:29:34,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:29:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:29:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-08-29 09:29:34,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4992389649923896 [2023-08-29 09:29:34,705 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-08-29 09:29:34,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-08-29 09:29:34,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:34,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-08-29 09:29:34,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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) [2023-08-29 09:29:34,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:29:34,708 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:29:34,709 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 150 flow. Second operand 3 states and 328 transitions. [2023-08-29 09:29:34,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 93 transitions, 353 flow [2023-08-29 09:29:34,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 93 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 09:29:34,713 INFO L231 Difference]: Finished difference. Result has 78 places, 75 transitions, 225 flow [2023-08-29 09:29:34,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=78, PETRI_TRANSITIONS=75} [2023-08-29 09:29:34,714 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -13 predicate places. [2023-08-29 09:29:34,714 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 75 transitions, 225 flow [2023-08-29 09:29:34,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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) [2023-08-29 09:29:34,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:34,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:29:34,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 09:29:34,715 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-29 09:29:34,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:34,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1561413315, now seen corresponding path program 1 times [2023-08-29 09:29:34,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:34,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306834260] [2023-08-29 09:29:34,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:34,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:29:34,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:34,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306834260] [2023-08-29 09:29:34,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306834260] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:34,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:34,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:29:34,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587818770] [2023-08-29 09:29:34,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:34,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:29:34,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:34,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:29:34,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:29:34,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 219 [2023-08-29 09:29:34,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 75 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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) [2023-08-29 09:29:34,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:34,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 219 [2023-08-29 09:29:34,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:40,567 INFO L130 PetriNetUnfolder]: 64454/97784 cut-off events. [2023-08-29 09:29:40,567 INFO L131 PetriNetUnfolder]: For 22281/23184 co-relation queries the response was YES. [2023-08-29 09:29:40,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217242 conditions, 97784 events. 64454/97784 cut-off events. For 22281/23184 co-relation queries the response was YES. Maximal size of possible extension queue 3255. Compared 820397 event pairs, 48320 based on Foata normal form. 0/90199 useless extension candidates. Maximal degree in co-relation 217233. Up to 75081 conditions per place. [2023-08-29 09:29:41,389 INFO L137 encePairwiseOnDemand]: 206/219 looper letters, 66 selfloop transitions, 12 changer transitions 0/104 dead transitions. [2023-08-29 09:29:41,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 104 transitions, 472 flow [2023-08-29 09:29:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:29:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:29:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2023-08-29 09:29:41,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502283105022831 [2023-08-29 09:29:41,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2023-08-29 09:29:41,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2023-08-29 09:29:41,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:41,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2023-08-29 09:29:41,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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) [2023-08-29 09:29:41,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:29:41,394 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:29:41,394 INFO L175 Difference]: Start difference. First operand has 78 places, 75 transitions, 225 flow. Second operand 3 states and 330 transitions. [2023-08-29 09:29:41,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 104 transitions, 472 flow [2023-08-29 09:29:41,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 104 transitions, 461 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 09:29:41,701 INFO L231 Difference]: Finished difference. Result has 81 places, 86 transitions, 326 flow [2023-08-29 09:29:41,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=81, PETRI_TRANSITIONS=86} [2023-08-29 09:29:41,701 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -10 predicate places. [2023-08-29 09:29:41,701 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 86 transitions, 326 flow [2023-08-29 09:29:41,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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) [2023-08-29 09:29:41,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:41,702 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:29:41,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 09:29:41,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-29 09:29:41,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:41,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2087599818, now seen corresponding path program 1 times [2023-08-29 09:29:41,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:41,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719903825] [2023-08-29 09:29:41,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:41,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 09:29:41,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:41,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719903825] [2023-08-29 09:29:41,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719903825] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:41,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:41,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:29:41,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094241073] [2023-08-29 09:29:41,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:41,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:29:41,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:41,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:29:41,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:29:41,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 219 [2023-08-29 09:29:41,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 86 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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) [2023-08-29 09:29:41,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:41,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 219 [2023-08-29 09:29:41,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:49,715 INFO L130 PetriNetUnfolder]: 84113/127452 cut-off events. [2023-08-29 09:29:49,715 INFO L131 PetriNetUnfolder]: For 81480/83769 co-relation queries the response was YES. [2023-08-29 09:29:49,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324975 conditions, 127452 events. 84113/127452 cut-off events. For 81480/83769 co-relation queries the response was YES. Maximal size of possible extension queue 4349. Compared 1096539 event pairs, 56088 based on Foata normal form. 100/115644 useless extension candidates. Maximal degree in co-relation 324965. Up to 96452 conditions per place. [2023-08-29 09:29:50,532 INFO L137 encePairwiseOnDemand]: 206/219 looper letters, 74 selfloop transitions, 27 changer transitions 0/128 dead transitions. [2023-08-29 09:29:50,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 128 transitions, 710 flow [2023-08-29 09:29:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:29:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:29:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-08-29 09:29:50,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5007610350076104 [2023-08-29 09:29:50,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-08-29 09:29:50,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-08-29 09:29:50,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:29:50,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-08-29 09:29:50,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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) [2023-08-29 09:29:50,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:29:50,539 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:29:50,539 INFO L175 Difference]: Start difference. First operand has 81 places, 86 transitions, 326 flow. Second operand 3 states and 329 transitions. [2023-08-29 09:29:50,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 128 transitions, 710 flow [2023-08-29 09:29:51,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 128 transitions, 640 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-08-29 09:29:51,956 INFO L231 Difference]: Finished difference. Result has 83 places, 110 transitions, 546 flow [2023-08-29 09:29:51,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=83, PETRI_TRANSITIONS=110} [2023-08-29 09:29:51,957 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -8 predicate places. [2023-08-29 09:29:51,957 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 110 transitions, 546 flow [2023-08-29 09:29:51,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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) [2023-08-29 09:29:51,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:29:51,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:29:51,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 09:29:51,957 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-29 09:29:51,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:29:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1574636312, now seen corresponding path program 1 times [2023-08-29 09:29:51,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:29:51,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57997430] [2023-08-29 09:29:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:29:51,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:29:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:29:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:29:51,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:29:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57997430] [2023-08-29 09:29:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57997430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:29:51,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:29:51,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:29:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792846918] [2023-08-29 09:29:51,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:29:51,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:29:51,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:29:51,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:29:51,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:29:52,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 219 [2023-08-29 09:29:52,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 110 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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) [2023-08-29 09:29:52,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:29:52,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 219 [2023-08-29 09:29:52,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:29:55,309 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([840] L702-1-->L702-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet6#1_13| |v_#race~x~0_158|) InVars {} OutVars{#race~x~0=|v_#race~x~0_158|, thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_13|} AuxVars[] AssignedVars[#race~x~0, thr1Thread4of4ForFork0_#t~nondet6#1][122], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 14#L710-5true, 16#L701-3true, 107#L702true, 148#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 67#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 168#true, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 82#L702-3true]) [2023-08-29 09:29:55,309 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-08-29 09:29:55,309 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-29 09:29:55,309 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-29 09:29:55,309 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-29 09:29:55,311 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L702-1-->L702-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_17| |v_#race~x~0_154|) InVars {} OutVars{#race~x~0=|v_#race~x~0_154|, thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread3of4ForFork0_#t~nondet6#1][82], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 162#true, 14#L710-5true, 16#L701-3true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 148#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 78#L702-1true, 28#L702-3true, 67#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 168#true, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|)]) [2023-08-29 09:29:55,311 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-29 09:29:55,311 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 09:29:55,312 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 09:29:55,312 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-29 09:29:56,653 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([812] L702-4-->L703-1: Formula: (= |v_#race~x~0_140| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_140|, thr1Thread1of4ForFork0_#t~nondet6#1=|v_thr1Thread1of4ForFork0_#t~nondet6#1_13|} AuxVars[] AssignedVars[#race~x~0, thr1Thread1of4ForFork0_#t~nondet6#1][18], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 170#(= |#race~x~0| 0), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 14#L710-5true, 107#L702true, 148#true, thr1Thread1of4ForFork0InUse, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 90#L703-1true, 78#L702-1true, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|)]) [2023-08-29 09:29:56,653 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-29 09:29:56,654 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 09:29:56,654 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 09:29:56,654 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-29 09:29:57,449 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([840] L702-1-->L702-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet6#1_13| |v_#race~x~0_158|) InVars {} OutVars{#race~x~0=|v_#race~x~0_158|, thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_13|} AuxVars[] AssignedVars[#race~x~0, thr1Thread4of4ForFork0_#t~nondet6#1][122], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 162#true, 16#L701-3true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 107#L702true, 148#true, 91#L710-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 67#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 168#true, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 82#L702-3true]) [2023-08-29 09:29:57,449 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-29 09:29:57,449 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 09:29:57,449 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 09:29:57,449 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 09:29:57,451 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L702-1-->L702-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_17| |v_#race~x~0_154|) InVars {} OutVars{#race~x~0=|v_#race~x~0_154|, thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread3of4ForFork0_#t~nondet6#1][82], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 16#L701-3true, 148#true, 91#L710-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 78#L702-1true, 28#L702-3true, 67#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 168#true, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|)]) [2023-08-29 09:29:57,452 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 09:29:57,452 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 09:29:57,452 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 09:29:57,452 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 09:29:57,662 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([840] L702-1-->L702-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet6#1_13| |v_#race~x~0_158|) InVars {} OutVars{#race~x~0=|v_#race~x~0_158|, thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_13|} AuxVars[] AssignedVars[#race~x~0, thr1Thread4of4ForFork0_#t~nondet6#1][141], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 162#true, 14#L710-5true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 3#L702-4true, 107#L702true, 148#true, thr1Thread1of4ForFork0InUse, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 168#true, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 82#L702-3true]) [2023-08-29 09:29:57,662 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-29 09:29:57,662 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 09:29:57,662 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 09:29:57,662 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 09:29:57,664 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L702-1-->L702-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_17| |v_#race~x~0_154|) InVars {} OutVars{#race~x~0=|v_#race~x~0_154|, thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread3of4ForFork0_#t~nondet6#1][111], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 14#L710-5true, 3#L702-4true, 148#true, thr1Thread1of4ForFork0InUse, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 78#L702-1true, 28#L702-3true, 168#true, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|)]) [2023-08-29 09:29:57,664 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 09:29:57,664 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 09:29:57,664 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 09:29:57,664 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 09:29:57,697 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L702-1-->L702-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_17| |v_#race~x~0_154|) InVars {} OutVars{#race~x~0=|v_#race~x~0_154|, thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread3of4ForFork0_#t~nondet6#1][82], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 16#L701-3true, 14#L710-5true, 148#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 78#L702-1true, 28#L702-3true, 168#true, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 58#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 09:29:57,697 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-29 09:29:57,697 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 09:29:57,697 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 09:29:57,697 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-29 09:29:57,698 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([840] L702-1-->L702-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet6#1_13| |v_#race~x~0_158|) InVars {} OutVars{#race~x~0=|v_#race~x~0_158|, thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_13|} AuxVars[] AssignedVars[#race~x~0, thr1Thread4of4ForFork0_#t~nondet6#1][122], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 162#true, 16#L701-3true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 14#L710-5true, 107#L702true, 148#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 168#true, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 58#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 82#L702-3true]) [2023-08-29 09:29:57,698 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-29 09:29:57,698 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 09:29:57,698 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 09:29:57,698 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-29 09:29:59,564 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([812] L702-4-->L703-1: Formula: (= |v_#race~x~0_140| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_140|, thr1Thread1of4ForFork0_#t~nondet6#1=|v_thr1Thread1of4ForFork0_#t~nondet6#1_13|} AuxVars[] AssignedVars[#race~x~0, thr1Thread1of4ForFork0_#t~nondet6#1][18], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 170#(= |#race~x~0| 0), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 107#L702true, 148#true, 91#L710-4true, thr1Thread1of4ForFork0InUse, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 90#L703-1true, 78#L702-1true, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|)]) [2023-08-29 09:29:59,564 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-29 09:29:59,564 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 09:29:59,564 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 09:29:59,564 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-29 09:30:00,795 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([840] L702-1-->L702-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet6#1_13| |v_#race~x~0_158|) InVars {} OutVars{#race~x~0=|v_#race~x~0_158|, thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_13|} AuxVars[] AssignedVars[#race~x~0, thr1Thread4of4ForFork0_#t~nondet6#1][141], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 107#L702true, 3#L702-4true, 148#true, 91#L710-4true, thr1Thread1of4ForFork0InUse, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 168#true, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 82#L702-3true]) [2023-08-29 09:30:00,795 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-29 09:30:00,795 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-29 09:30:00,795 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-29 09:30:00,796 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-29 09:30:00,798 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L702-1-->L702-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_17| |v_#race~x~0_154|) InVars {} OutVars{#race~x~0=|v_#race~x~0_154|, thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread3of4ForFork0_#t~nondet6#1][111], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 3#L702-4true, 148#true, 91#L710-4true, thr1Thread1of4ForFork0InUse, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 78#L702-1true, 28#L702-3true, 168#true, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|)]) [2023-08-29 09:30:00,798 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 09:30:00,798 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 09:30:00,798 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 09:30:00,798 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 09:30:00,829 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([834] L702-1-->L702-3: Formula: (= |v_thr1Thread3of4ForFork0_#t~nondet6#1_17| |v_#race~x~0_154|) InVars {} OutVars{#race~x~0=|v_#race~x~0_154|, thr1Thread3of4ForFork0_#t~nondet6#1=|v_thr1Thread3of4ForFork0_#t~nondet6#1_17|} AuxVars[] AssignedVars[#race~x~0, thr1Thread3of4ForFork0_#t~nondet6#1][82], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 16#L701-3true, 148#true, 91#L710-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 78#L702-1true, 28#L702-3true, 168#true, 58#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|)]) [2023-08-29 09:30:00,829 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-29 09:30:00,829 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 09:30:00,829 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 09:30:00,830 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-29 09:30:00,830 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([840] L702-1-->L702-3: Formula: (= |v_thr1Thread4of4ForFork0_#t~nondet6#1_13| |v_#race~x~0_158|) InVars {} OutVars{#race~x~0=|v_#race~x~0_158|, thr1Thread4of4ForFork0_#t~nondet6#1=|v_thr1Thread4of4ForFork0_#t~nondet6#1_13|} AuxVars[] AssignedVars[#race~x~0, thr1Thread4of4ForFork0_#t~nondet6#1][122], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 16#L701-3true, 107#L702true, 148#true, 91#L710-4true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 168#true, 58#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 82#L702-3true]) [2023-08-29 09:30:00,830 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is not cut-off event [2023-08-29 09:30:00,830 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-29 09:30:00,830 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-29 09:30:00,830 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is not cut-off event [2023-08-29 09:30:03,269 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([739] L703-->L703-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][163], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 170#(= |#race~x~0| 0), 162#true, 14#L710-5true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 148#true, thr1Thread1of4ForFork0InUse, 87#L703-2true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 51#L703-1true, thr1Thread4of4ForFork0InUse, 67#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|)]) [2023-08-29 09:30:03,269 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is not cut-off event [2023-08-29 09:30:03,269 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-29 09:30:03,269 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-29 09:30:03,269 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is not cut-off event [2023-08-29 09:30:06,022 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([739] L703-->L703-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][163], [120#thr1EXITtrue, Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 170#(= |#race~x~0| 0), 162#true, 14#L710-5true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 148#true, thr1Thread1of4ForFork0InUse, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 51#L703-1true, thr1Thread4of4ForFork0InUse, 67#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|)]) [2023-08-29 09:30:06,022 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-08-29 09:30:06,022 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 09:30:06,022 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 09:30:06,022 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-29 09:30:06,518 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([739] L703-->L703-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][163], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 170#(= |#race~x~0| 0), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 148#true, 91#L710-4true, thr1Thread1of4ForFork0InUse, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 87#L703-2true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 51#L703-1true, thr1Thread4of4ForFork0InUse, 67#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|)]) [2023-08-29 09:30:06,518 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 09:30:06,519 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 09:30:06,519 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 09:30:06,519 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 09:30:07,199 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([739] L703-->L703-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][163], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 170#(= |#race~x~0| 0), 162#true, 14#L710-5true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 148#true, thr1Thread1of4ForFork0InUse, 87#L703-2true, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 51#L703-1true, thr1Thread4of4ForFork0InUse, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 58#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 09:30:07,200 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-29 09:30:07,200 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 09:30:07,200 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 09:30:07,200 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-29 09:30:09,103 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([739] L703-->L703-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][163], [120#thr1EXITtrue, Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 170#(= |#race~x~0| 0), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 148#true, 91#L710-4true, thr1Thread1of4ForFork0InUse, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 51#L703-1true, thr1Thread4of4ForFork0InUse, 67#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|)]) [2023-08-29 09:30:09,103 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is not cut-off event [2023-08-29 09:30:09,103 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 09:30:09,103 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 09:30:09,103 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 09:30:09,718 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([739] L703-->L703-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][163], [120#thr1EXITtrue, Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 170#(= |#race~x~0| 0), 162#true, 14#L710-5true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 148#true, thr1Thread1of4ForFork0InUse, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 51#L703-1true, thr1Thread4of4ForFork0InUse, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|), 58#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue]) [2023-08-29 09:30:09,719 INFO L383 tUnfolder$Statistics]: this new event has 45 ancestors and is not cut-off event [2023-08-29 09:30:09,719 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 09:30:09,719 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 09:30:09,719 INFO L386 tUnfolder$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-08-29 09:30:10,097 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([739] L703-->L703-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][163], [Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 170#(= |#race~x~0| 0), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 148#true, 91#L710-4true, thr1Thread1of4ForFork0InUse, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, 87#L703-2true, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 51#L703-1true, thr1Thread4of4ForFork0InUse, 58#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|)]) [2023-08-29 09:30:10,097 INFO L383 tUnfolder$Statistics]: this new event has 46 ancestors and is not cut-off event [2023-08-29 09:30:10,097 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2023-08-29 09:30:10,097 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2023-08-29 09:30:10,097 INFO L386 tUnfolder$Statistics]: existing Event has 46 ancestors and is not cut-off event [2023-08-29 09:30:11,843 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([739] L703-->L703-1: Formula: (= |v_#race~x~0_7| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_7|} AuxVars[] AssignedVars[#race~x~0][163], [120#thr1EXITtrue, Black: 158#(= |thr1Thread1of4ForFork0_#t~nondet6#1| |#race~x~0|), 170#(= |#race~x~0| 0), 162#true, Black: 164#(= |#race~x~0| |thr1Thread2of4ForFork0_#t~nondet5#1|), 148#true, 91#L710-4true, thr1Thread1of4ForFork0InUse, 52#thr1Err2ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread2of4ForFork0InUse, thr1Thread3of4ForFork0InUse, 51#L703-1true, thr1Thread4of4ForFork0InUse, 58#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, Black: 153#(= |thr1Thread1of4ForFork0_#t~nondet5#1| |#race~x~0|)]) [2023-08-29 09:30:11,843 INFO L383 tUnfolder$Statistics]: this new event has 48 ancestors and is not cut-off event [2023-08-29 09:30:11,843 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is not cut-off event [2023-08-29 09:30:11,843 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is not cut-off event [2023-08-29 09:30:11,843 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is not cut-off event [2023-08-29 09:30:15,146 INFO L130 PetriNetUnfolder]: 235306/337568 cut-off events. [2023-08-29 09:30:15,146 INFO L131 PetriNetUnfolder]: For 415803/431175 co-relation queries the response was YES. [2023-08-29 09:30:15,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962767 conditions, 337568 events. 235306/337568 cut-off events. For 415803/431175 co-relation queries the response was YES. Maximal size of possible extension queue 11404. Compared 2927619 event pairs, 78887 based on Foata normal form. 3751/312791 useless extension candidates. Maximal degree in co-relation 962756. Up to 157777 conditions per place. [2023-08-29 09:30:17,690 INFO L137 encePairwiseOnDemand]: 199/219 looper letters, 113 selfloop transitions, 57 changer transitions 0/192 dead transitions. [2023-08-29 09:30:17,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 192 transitions, 1355 flow [2023-08-29 09:30:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:30:17,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:30:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-08-29 09:30:17,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512937595129376 [2023-08-29 09:30:17,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-08-29 09:30:17,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-08-29 09:30:17,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:30:17,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-08-29 09:30:17,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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) [2023-08-29 09:30:17,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:30:17,695 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:30:17,696 INFO L175 Difference]: Start difference. First operand has 83 places, 110 transitions, 546 flow. Second operand 3 states and 337 transitions. [2023-08-29 09:30:17,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 192 transitions, 1355 flow [2023-08-29 09:30:21,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 192 transitions, 1249 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 09:30:21,146 INFO L231 Difference]: Finished difference. Result has 85 places, 167 transitions, 1186 flow [2023-08-29 09:30:21,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1186, PETRI_PLACES=85, PETRI_TRANSITIONS=167} [2023-08-29 09:30:21,147 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2023-08-29 09:30:21,147 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 167 transitions, 1186 flow [2023-08-29 09:30:21,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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) [2023-08-29 09:30:21,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:30:21,148 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:30:21,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 09:30:21,148 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-29 09:30:21,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:30:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1417737201, now seen corresponding path program 1 times [2023-08-29 09:30:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:30:21,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377242162] [2023-08-29 09:30:21,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:30:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:30:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:30:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-29 09:30:21,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:30:21,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377242162] [2023-08-29 09:30:21,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377242162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:30:21,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:30:21,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 09:30:21,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5149951] [2023-08-29 09:30:21,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:30:21,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:30:21,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:30:21,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:30:21,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:30:21,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 219 [2023-08-29 09:30:21,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 167 transitions, 1186 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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) [2023-08-29 09:30:21,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:30:21,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 219 [2023-08-29 09:30:21,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:30:21,389 INFO L130 PetriNetUnfolder]: 463/1651 cut-off events. [2023-08-29 09:30:21,389 INFO L131 PetriNetUnfolder]: For 2808/2808 co-relation queries the response was YES. [2023-08-29 09:30:21,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4518 conditions, 1651 events. 463/1651 cut-off events. For 2808/2808 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 12389 event pairs, 51 based on Foata normal form. 712/2330 useless extension candidates. Maximal degree in co-relation 4506. Up to 944 conditions per place. [2023-08-29 09:30:21,394 INFO L137 encePairwiseOnDemand]: 211/219 looper letters, 33 selfloop transitions, 8 changer transitions 0/66 dead transitions. [2023-08-29 09:30:21,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 66 transitions, 397 flow [2023-08-29 09:30:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:30:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:30:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-08-29 09:30:21,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528158295281583 [2023-08-29 09:30:21,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-08-29 09:30:21,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-08-29 09:30:21,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:30:21,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-08-29 09:30:21,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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) [2023-08-29 09:30:21,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:30:21,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:30:21,398 INFO L175 Difference]: Start difference. First operand has 85 places, 167 transitions, 1186 flow. Second operand 3 states and 347 transitions. [2023-08-29 09:30:21,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 66 transitions, 397 flow [2023-08-29 09:30:21,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 273 flow, removed 46 selfloop flow, removed 8 redundant places. [2023-08-29 09:30:21,402 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 184 flow [2023-08-29 09:30:21,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2023-08-29 09:30:21,403 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -19 predicate places. [2023-08-29 09:30:21,403 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 184 flow [2023-08-29 09:30:21,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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) [2023-08-29 09:30:21,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:30:21,404 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:30:21,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 09:30:21,404 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-29 09:30:21,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:30:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash 560574865, now seen corresponding path program 1 times [2023-08-29 09:30:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:30:21,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688410539] [2023-08-29 09:30:21,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:30:21,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:30:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:30:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-29 09:30:21,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:30:21,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688410539] [2023-08-29 09:30:21,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688410539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:30:21,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:30:21,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:30:21,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821166234] [2023-08-29 09:30:21,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:30:21,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:30:21,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:30:21,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:30:21,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:30:21,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 219 [2023-08-29 09:30:21,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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) [2023-08-29 09:30:21,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:30:21,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 219 [2023-08-29 09:30:21,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:30:21,572 INFO L130 PetriNetUnfolder]: 529/1710 cut-off events. [2023-08-29 09:30:21,572 INFO L131 PetriNetUnfolder]: For 538/538 co-relation queries the response was YES. [2023-08-29 09:30:21,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3774 conditions, 1710 events. 529/1710 cut-off events. For 538/538 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 12632 event pairs, 477 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 3765. Up to 1206 conditions per place. [2023-08-29 09:30:21,577 INFO L137 encePairwiseOnDemand]: 216/219 looper letters, 42 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-29 09:30:21,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 286 flow [2023-08-29 09:30:21,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:30:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:30:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-08-29 09:30:21,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4596651445966514 [2023-08-29 09:30:21,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-08-29 09:30:21,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-08-29 09:30:21,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:30:21,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-08-29 09:30:21,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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) [2023-08-29 09:30:21,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:30:21,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:30:21,581 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 184 flow. Second operand 3 states and 302 transitions. [2023-08-29 09:30:21,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 286 flow [2023-08-29 09:30:21,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 09:30:21,583 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 178 flow [2023-08-29 09:30:21,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2023-08-29 09:30:21,583 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -19 predicate places. [2023-08-29 09:30:21,584 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 178 flow [2023-08-29 09:30:21,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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) [2023-08-29 09:30:21,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:30:21,584 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:30:21,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 09:30:21,584 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-29 09:30:21,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:30:21,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1696373225, now seen corresponding path program 1 times [2023-08-29 09:30:21,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:30:21,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363658224] [2023-08-29 09:30:21,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:30:21,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:30:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:30:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 09:30:21,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:30:21,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363658224] [2023-08-29 09:30:21,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363658224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:30:21,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:30:21,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:30:21,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892570507] [2023-08-29 09:30:21,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:30:21,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:30:21,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:30:21,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:30:21,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:30:21,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 219 [2023-08-29 09:30:21,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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) [2023-08-29 09:30:21,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:30:21,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 219 [2023-08-29 09:30:21,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:30:21,752 INFO L130 PetriNetUnfolder]: 529/1694 cut-off events. [2023-08-29 09:30:21,752 INFO L131 PetriNetUnfolder]: For 520/520 co-relation queries the response was YES. [2023-08-29 09:30:21,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 1694 events. 529/1694 cut-off events. For 520/520 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 12380 event pairs, 481 based on Foata normal form. 0/1662 useless extension candidates. Maximal degree in co-relation 3711. Up to 1214 conditions per place. [2023-08-29 09:30:21,757 INFO L137 encePairwiseOnDemand]: 216/219 looper letters, 40 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-08-29 09:30:21,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 271 flow [2023-08-29 09:30:21,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:30:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:30:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-08-29 09:30:21,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581430745814307 [2023-08-29 09:30:21,758 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-08-29 09:30:21,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-08-29 09:30:21,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:30:21,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-08-29 09:30:21,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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) [2023-08-29 09:30:21,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:30:21,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:30:21,760 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 178 flow. Second operand 3 states and 301 transitions. [2023-08-29 09:30:21,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 271 flow [2023-08-29 09:30:21,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 09:30:21,762 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 178 flow [2023-08-29 09:30:21,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2023-08-29 09:30:21,762 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -20 predicate places. [2023-08-29 09:30:21,763 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 178 flow [2023-08-29 09:30:21,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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) [2023-08-29 09:30:21,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:30:21,763 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:30:21,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 09:30:21,763 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-29 09:30:21,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:30:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2065113297, now seen corresponding path program 1 times [2023-08-29 09:30:21,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:30:21,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870086216] [2023-08-29 09:30:21,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:30:21,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:30:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:30:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-29 09:30:21,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:30:21,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870086216] [2023-08-29 09:30:21,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870086216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:30:21,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:30:21,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:30:21,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025286244] [2023-08-29 09:30:21,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:30:21,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:30:21,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:30:21,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:30:21,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:30:21,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 219 [2023-08-29 09:30:21,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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) [2023-08-29 09:30:21,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:30:21,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 219 [2023-08-29 09:30:21,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:30:21,944 INFO L130 PetriNetUnfolder]: 529/1672 cut-off events. [2023-08-29 09:30:21,945 INFO L131 PetriNetUnfolder]: For 562/562 co-relation queries the response was YES. [2023-08-29 09:30:21,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3689 conditions, 1672 events. 529/1672 cut-off events. For 562/562 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 12127 event pairs, 481 based on Foata normal form. 0/1642 useless extension candidates. Maximal degree in co-relation 3679. Up to 1214 conditions per place. [2023-08-29 09:30:21,949 INFO L137 encePairwiseOnDemand]: 216/219 looper letters, 41 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-29 09:30:21,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 61 transitions, 271 flow [2023-08-29 09:30:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 09:30:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 09:30:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-08-29 09:30:21,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581430745814307 [2023-08-29 09:30:21,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-08-29 09:30:21,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-08-29 09:30:21,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:30:21,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-08-29 09:30:21,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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) [2023-08-29 09:30:21,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:30:21,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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) [2023-08-29 09:30:21,953 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 178 flow. Second operand 3 states and 301 transitions. [2023-08-29 09:30:21,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 61 transitions, 271 flow [2023-08-29 09:30:21,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 61 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 09:30:21,956 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 174 flow [2023-08-29 09:30:21,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-08-29 09:30:21,956 INFO L281 CegarLoopForPetriNet]: 91 programPoint places, -21 predicate places. [2023-08-29 09:30:21,957 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 174 flow [2023-08-29 09:30:21,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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) [2023-08-29 09:30:21,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:30:21,957 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2023-08-29 09:30:21,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 09:30:21,957 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-08-29 09:30:21,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:30:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1571671399, now seen corresponding path program 1 times [2023-08-29 09:30:21,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:30:21,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066618071] [2023-08-29 09:30:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:30:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:30:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 09:30:21,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 09:30:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 09:30:21,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 09:30:21,977 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 09:30:21,977 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 36 remaining) [2023-08-29 09:30:21,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2023-08-29 09:30:21,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2023-08-29 09:30:21,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2023-08-29 09:30:21,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2023-08-29 09:30:21,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2023-08-29 09:30:21,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2023-08-29 09:30:21,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2023-08-29 09:30:21,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2023-08-29 09:30:21,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2023-08-29 09:30:21,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2023-08-29 09:30:21,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2023-08-29 09:30:21,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2023-08-29 09:30:21,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2023-08-29 09:30:21,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2023-08-29 09:30:21,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2023-08-29 09:30:21,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2023-08-29 09:30:21,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2023-08-29 09:30:21,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2023-08-29 09:30:21,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2023-08-29 09:30:21,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2023-08-29 09:30:21,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2023-08-29 09:30:21,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 36 remaining) [2023-08-29 09:30:21,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 36 remaining) [2023-08-29 09:30:21,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2023-08-29 09:30:21,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2023-08-29 09:30:21,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2023-08-29 09:30:21,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2023-08-29 09:30:21,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2023-08-29 09:30:21,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2023-08-29 09:30:21,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2023-08-29 09:30:21,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2023-08-29 09:30:21,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2023-08-29 09:30:21,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2023-08-29 09:30:21,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2023-08-29 09:30:21,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2023-08-29 09:30:21,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 09:30:21,983 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:30:21,983 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-29 09:30:21,983 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-08-29 09:30:22,003 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 09:30:22,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 170 transitions, 385 flow [2023-08-29 09:30:22,024 INFO L130 PetriNetUnfolder]: 11/228 cut-off events. [2023-08-29 09:30:22,024 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-29 09:30:22,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 228 events. 11/228 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 666 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 200. Up to 12 conditions per place. [2023-08-29 09:30:22,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 170 transitions, 385 flow [2023-08-29 09:30:22,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 170 transitions, 385 flow [2023-08-29 09:30:22,028 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 09:30:22,028 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 170 transitions, 385 flow [2023-08-29 09:30:22,029 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 170 transitions, 385 flow [2023-08-29 09:30:22,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 170 transitions, 385 flow [2023-08-29 09:30:22,046 INFO L130 PetriNetUnfolder]: 11/228 cut-off events. [2023-08-29 09:30:22,047 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-29 09:30:22,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 228 events. 11/228 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 666 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 200. Up to 12 conditions per place. [2023-08-29 09:30:22,059 INFO L119 LiptonReduction]: Number of co-enabled transitions 19880 [2023-08-29 09:30:23,275 INFO L134 LiptonReduction]: Checked pairs total: 81894 [2023-08-29 09:30:23,275 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-29 09:30:23,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 09:30:23,277 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@37bb78e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 09:30:23,277 INFO L358 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2023-08-29 09:30:23,278 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2023-08-29 09:30:23,278 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 09:30:23,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:30:23,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 09:30:23,278 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2023-08-29 09:30:23,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:30:23,279 INFO L85 PathProgramCache]: Analyzing trace with hash 37252320, now seen corresponding path program 1 times [2023-08-29 09:30:23,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:30:23,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230011100] [2023-08-29 09:30:23,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:30:23,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:30:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:30:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:30:23,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:30:23,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230011100] [2023-08-29 09:30:23,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230011100] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:30:23,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:30:23,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 09:30:23,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198584520] [2023-08-29 09:30:23,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:30:23,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 09:30:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:30:23,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 09:30:23,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 09:30:23,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 263 [2023-08-29 09:30:23,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 249 flow. Second operand has 2 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 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) [2023-08-29 09:30:23,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:30:23,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 263 [2023-08-29 09:30:23,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 09:30:51,475 INFO L130 PetriNetUnfolder]: 252783/397913 cut-off events. [2023-08-29 09:30:51,475 INFO L131 PetriNetUnfolder]: For 83919/83919 co-relation queries the response was YES. [2023-08-29 09:30:52,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753787 conditions, 397913 events. 252783/397913 cut-off events. For 83919/83919 co-relation queries the response was YES. Maximal size of possible extension queue 11232. Compared 4025276 event pairs, 252783 based on Foata normal form. 33058/413523 useless extension candidates. Maximal degree in co-relation 85108. Up to 319490 conditions per place. [2023-08-29 09:30:55,185 INFO L137 encePairwiseOnDemand]: 241/263 looper letters, 41 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2023-08-29 09:30:55,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 80 transitions, 287 flow [2023-08-29 09:30:55,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 09:30:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 09:30:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2023-08-29 09:30:55,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5874524714828897 [2023-08-29 09:30:55,205 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2023-08-29 09:30:55,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2023-08-29 09:30:55,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 09:30:55,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2023-08-29 09:30:55,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 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) [2023-08-29 09:30:55,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 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) [2023-08-29 09:30:55,207 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 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) [2023-08-29 09:30:55,207 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 249 flow. Second operand 2 states and 309 transitions. [2023-08-29 09:30:55,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 80 transitions, 287 flow [2023-08-29 09:30:55,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 80 transitions, 267 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-08-29 09:30:55,404 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 185 flow [2023-08-29 09:30:55,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=185, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2023-08-29 09:30:55,405 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -20 predicate places. [2023-08-29 09:30:55,405 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 185 flow [2023-08-29 09:30:55,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 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) [2023-08-29 09:30:55,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 09:30:55,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 09:30:55,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 09:30:55,406 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2023-08-29 09:30:55,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 09:30:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1683431479, now seen corresponding path program 1 times [2023-08-29 09:30:55,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 09:30:55,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422263870] [2023-08-29 09:30:55,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 09:30:55,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 09:30:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 09:30:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 09:30:55,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 09:30:55,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422263870] [2023-08-29 09:30:55,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422263870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 09:30:55,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 09:30:55,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 09:30:55,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718678431] [2023-08-29 09:30:55,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 09:30:55,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 09:30:55,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 09:30:55,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 09:30:55,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 09:30:55,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 263 [2023-08-29 09:30:55,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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) [2023-08-29 09:30:55,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 09:30:55,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 263 [2023-08-29 09:30:55,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand