./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/goblint-regression/06-symbeq_02-funloop_norace.c -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 --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 f4443c7da5298ac603586799640102b5bfbd455269f211f15877108d6d955b4a --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:22,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:22,277 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:08:22,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:22,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:22,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:22,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:22,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:22,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:22,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:22,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:22,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:22,306 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:22,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:22,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:22,306 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:22,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:22,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:22,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:22,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:22,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:22,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:22,307 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:22,307 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:22,307 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:22,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:22,307 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:22,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:22,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:22,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:22,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:22,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:22,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:22,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:22,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:22,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:22,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:22,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:22,308 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:22,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:22,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:22,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:22,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:22,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:22,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:22,309 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> f4443c7da5298ac603586799640102b5bfbd455269f211f15877108d6d955b4a [2025-04-29 11:08:22,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:22,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:22,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:22,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:22,539 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:22,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.c [2025-04-29 11:08:23,810 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a98acf8e/a8133013071c4b808882888a87f812bc/FLAGef60b2fc5 [2025-04-29 11:08:24,034 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:24,036 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.c [2025-04-29 11:08:24,037 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:24,038 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:24,044 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a98acf8e/a8133013071c4b808882888a87f812bc/FLAGef60b2fc5 [2025-04-29 11:08:24,811 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a98acf8e/a8133013071c4b808882888a87f812bc [2025-04-29 11:08:24,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:24,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:24,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:24,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:24,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:24,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da06c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:24, skipping insertion in model container [2025-04-29 11:08:24,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:24" (1/1) ... [2025-04-29 11:08:24,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:24,998 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:25,014 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:25,045 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:25,058 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:25,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25 WrapperNode [2025-04-29 11:08:25,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:25,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:25,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:25,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:25,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25" (1/1) ... [2025-04-29 11:08:25,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25" (1/1) ... [2025-04-29 11:08:25,088 INFO L138 Inliner]: procedures = 12, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 107 [2025-04-29 11:08:25,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:25,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:25,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:25,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:25,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25" (1/1) ... [2025-04-29 11:08:25,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25" (1/1) ... [2025-04-29 11:08:25,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25" (1/1) ... [2025-04-29 11:08:25,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25" (1/1) ... [2025-04-29 11:08:25,107 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25" (1/1) ... [2025-04-29 11:08:25,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25" (1/1) ... [2025-04-29 11:08:25,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25" (1/1) ... [2025-04-29 11:08:25,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25" (1/1) ... [2025-04-29 11:08:25,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25" (1/1) ... [2025-04-29 11:08:25,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:25,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:25,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:25,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:25,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25" (1/1) ... [2025-04-29 11:08:25,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:25,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:25,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:08:25,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:08:25,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:08:25,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:25,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:08:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:25,159 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:25,159 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:25,160 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:08:25,229 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:25,230 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:25,450 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:25,450 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:25,474 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:25,474 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:25,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:25 BoogieIcfgContainer [2025-04-29 11:08:25,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:25,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:25,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:25,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:25,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:24" (1/3) ... [2025-04-29 11:08:25,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce9a246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:25, skipping insertion in model container [2025-04-29 11:08:25,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:25" (2/3) ... [2025-04-29 11:08:25,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce9a246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:25, skipping insertion in model container [2025-04-29 11:08:25,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:25" (3/3) ... [2025-04-29 11:08:25,484 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.c [2025-04-29 11:08:25,494 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:25,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_02-funloop_norace.c that has 2 procedures, 117 locations, 118 edges, 1 initial locations, 3 loop locations, and 4 error locations. [2025-04-29 11:08:25,496 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:25,548 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:08:25,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 119 transitions, 242 flow [2025-04-29 11:08:25,623 INFO L116 PetriNetUnfolderBase]: 3/118 cut-off events. [2025-04-29 11:08:25,627 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:25,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 124 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-04-29 11:08:25,633 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 119 transitions, 242 flow [2025-04-29 11:08:25,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 118 transitions, 239 flow [2025-04-29 11:08:25,647 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:25,656 INFO L340 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@2d7a6568, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:25,656 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:08:25,679 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:25,684 INFO L116 PetriNetUnfolderBase]: 1/76 cut-off events. [2025-04-29 11:08:25,684 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:25,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:25,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:25,685 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:25,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1968799303, now seen corresponding path program 1 times [2025-04-29 11:08:25,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:25,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448706755] [2025-04-29 11:08:25,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:25,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:25,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:08:25,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:08:25,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:25,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:25,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:25,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448706755] [2025-04-29 11:08:25,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448706755] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:25,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:25,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:08:25,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774923973] [2025-04-29 11:08:25,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:25,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:25,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:25,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:25,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:25,980 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 119 [2025-04-29 11:08:25,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 239 flow. Second operand has 3 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) [2025-04-29 11:08:25,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:25,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 119 [2025-04-29 11:08:25,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:26,043 INFO L116 PetriNetUnfolderBase]: 13/206 cut-off events. [2025-04-29 11:08:26,044 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:26,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 206 events. 13/206 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 401 event pairs, 6 based on Foata normal form. 1/193 useless extension candidates. Maximal degree in co-relation 183. Up to 28 conditions per place. [2025-04-29 11:08:26,047 INFO L140 encePairwiseOnDemand]: 116/119 looper letters, 10 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2025-04-29 11:08:26,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 265 flow [2025-04-29 11:08:26,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2025-04-29 11:08:26,057 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9439775910364145 [2025-04-29 11:08:26,058 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 239 flow. Second operand 3 states and 337 transitions. [2025-04-29 11:08:26,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 265 flow [2025-04-29 11:08:26,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 119 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:26,067 INFO L231 Difference]: Finished difference. Result has 121 places, 119 transitions, 250 flow [2025-04-29 11:08:26,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=121, PETRI_TRANSITIONS=119} [2025-04-29 11:08:26,072 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 2 predicate places. [2025-04-29 11:08:26,072 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 119 transitions, 250 flow [2025-04-29 11:08:26,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2025-04-29 11:08:26,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:26,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:26,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:26,074 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:26,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:26,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1905223045, now seen corresponding path program 1 times [2025-04-29 11:08:26,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:26,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936797791] [2025-04-29 11:08:26,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:26,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:26,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:08:26,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:08:26,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:26,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:26,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:26,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936797791] [2025-04-29 11:08:26,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936797791] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:26,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869298648] [2025-04-29 11:08:26,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:26,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:26,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:26,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:26,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:08:26,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:08:26,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:08:26,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:26,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:26,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:08:26,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:26,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:26,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:26,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869298648] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:26,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:26,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:08:26,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117004945] [2025-04-29 11:08:26,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:26,444 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:26,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:26,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:26,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:26,467 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 119 [2025-04-29 11:08:26,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 119 transitions, 250 flow. Second operand has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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) [2025-04-29 11:08:26,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:26,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 119 [2025-04-29 11:08:26,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:26,572 INFO L116 PetriNetUnfolderBase]: 13/213 cut-off events. [2025-04-29 11:08:26,572 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:26,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 213 events. 13/213 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 394 event pairs, 6 based on Foata normal form. 2/201 useless extension candidates. Maximal degree in co-relation 221. Up to 28 conditions per place. [2025-04-29 11:08:26,574 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 14 selfloop transitions, 9 changer transitions 0/127 dead transitions. [2025-04-29 11:08:26,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 127 transitions, 314 flow [2025-04-29 11:08:26,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 970 transitions. [2025-04-29 11:08:26,581 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9056956115779645 [2025-04-29 11:08:26,581 INFO L175 Difference]: Start difference. First operand has 121 places, 119 transitions, 250 flow. Second operand 9 states and 970 transitions. [2025-04-29 11:08:26,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 127 transitions, 314 flow [2025-04-29 11:08:26,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 127 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:26,584 INFO L231 Difference]: Finished difference. Result has 131 places, 125 transitions, 298 flow [2025-04-29 11:08:26,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=298, PETRI_PLACES=131, PETRI_TRANSITIONS=125} [2025-04-29 11:08:26,585 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 12 predicate places. [2025-04-29 11:08:26,585 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 125 transitions, 298 flow [2025-04-29 11:08:26,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.0) internal successors, (1070), 10 states have internal predecessors, (1070), 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) [2025-04-29 11:08:26,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:26,588 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:26,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:08:26,789 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:26,789 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:26,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:26,790 INFO L85 PathProgramCache]: Analyzing trace with hash -765278523, now seen corresponding path program 2 times [2025-04-29 11:08:26,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:26,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495005908] [2025-04-29 11:08:26,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:26,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:26,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-04-29 11:08:26,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 65 statements. [2025-04-29 11:08:26,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:26,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:08:27,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:27,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495005908] [2025-04-29 11:08:27,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495005908] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:27,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:27,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:27,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040902917] [2025-04-29 11:08:27,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:27,176 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:27,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:27,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:27,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:27,298 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2025-04-29 11:08:27,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 125 transitions, 298 flow. Second operand has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 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) [2025-04-29 11:08:27,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:27,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2025-04-29 11:08:27,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:27,447 INFO L116 PetriNetUnfolderBase]: 150/800 cut-off events. [2025-04-29 11:08:27,447 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:08:27,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 800 events. 150/800 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4744 event pairs, 62 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 1057. Up to 240 conditions per place. [2025-04-29 11:08:27,454 INFO L140 encePairwiseOnDemand]: 108/119 looper letters, 30 selfloop transitions, 22 changer transitions 0/154 dead transitions. [2025-04-29 11:08:27,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 154 transitions, 460 flow [2025-04-29 11:08:27,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions. [2025-04-29 11:08:27,456 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2025-04-29 11:08:27,456 INFO L175 Difference]: Start difference. First operand has 131 places, 125 transitions, 298 flow. Second operand 6 states and 629 transitions. [2025-04-29 11:08:27,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 154 transitions, 460 flow [2025-04-29 11:08:27,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 154 transitions, 454 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:27,459 INFO L231 Difference]: Finished difference. Result has 140 places, 146 transitions, 442 flow [2025-04-29 11:08:27,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=140, PETRI_TRANSITIONS=146} [2025-04-29 11:08:27,460 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places. [2025-04-29 11:08:27,460 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 146 transitions, 442 flow [2025-04-29 11:08:27,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 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) [2025-04-29 11:08:27,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:27,460 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:27,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:08:27,461 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:27,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash 231184044, now seen corresponding path program 1 times [2025-04-29 11:08:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:27,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411283873] [2025-04-29 11:08:27,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:27,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:08:27,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:08:27,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:27,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:27,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:27,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411283873] [2025-04-29 11:08:27,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411283873] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:27,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446608893] [2025-04-29 11:08:27,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:27,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:27,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:27,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:27,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:08:27,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:08:27,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:08:27,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:27,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:27,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:08:27,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:27,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:27,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446608893] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:27,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:27,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:08:27,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180633627] [2025-04-29 11:08:27,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:27,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:08:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:27,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:08:27,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:08:27,769 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 119 [2025-04-29 11:08:27,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 146 transitions, 442 flow. Second operand has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 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) [2025-04-29 11:08:27,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:27,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 119 [2025-04-29 11:08:27,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:28,014 INFO L116 PetriNetUnfolderBase]: 61/546 cut-off events. [2025-04-29 11:08:28,015 INFO L117 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2025-04-29 11:08:28,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 546 events. 61/546 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2308 event pairs, 11 based on Foata normal form. 4/516 useless extension candidates. Maximal degree in co-relation 693. Up to 63 conditions per place. [2025-04-29 11:08:28,018 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 18 selfloop transitions, 21 changer transitions 0/164 dead transitions. [2025-04-29 11:08:28,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 608 flow [2025-04-29 11:08:28,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:08:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:08:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2248 transitions. [2025-04-29 11:08:28,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8995598239295718 [2025-04-29 11:08:28,022 INFO L175 Difference]: Start difference. First operand has 140 places, 146 transitions, 442 flow. Second operand 21 states and 2248 transitions. [2025-04-29 11:08:28,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 164 transitions, 608 flow [2025-04-29 11:08:28,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 164 transitions, 608 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:28,026 INFO L231 Difference]: Finished difference. Result has 165 places, 159 transitions, 572 flow [2025-04-29 11:08:28,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=572, PETRI_PLACES=165, PETRI_TRANSITIONS=159} [2025-04-29 11:08:28,029 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 46 predicate places. [2025-04-29 11:08:28,029 INFO L485 AbstractCegarLoop]: Abstraction has has 165 places, 159 transitions, 572 flow [2025-04-29 11:08:28,030 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 107.0) internal successors, (1926), 18 states have internal predecessors, (1926), 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) [2025-04-29 11:08:28,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:28,030 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:28,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:28,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 11:08:28,231 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:28,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2019076396, now seen corresponding path program 2 times [2025-04-29 11:08:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:28,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355865651] [2025-04-29 11:08:28,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:28,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:28,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-04-29 11:08:28,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 85 statements. [2025-04-29 11:08:28,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:28,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-04-29 11:08:28,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:28,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355865651] [2025-04-29 11:08:28,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355865651] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:28,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:28,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:28,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766387159] [2025-04-29 11:08:28,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:28,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:28,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:28,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:28,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:28,497 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 119 [2025-04-29 11:08:28,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 159 transitions, 572 flow. Second operand has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 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) [2025-04-29 11:08:28,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:28,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 119 [2025-04-29 11:08:28,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:28,668 INFO L116 PetriNetUnfolderBase]: 206/1058 cut-off events. [2025-04-29 11:08:28,668 INFO L117 PetriNetUnfolderBase]: For 225/245 co-relation queries the response was YES. [2025-04-29 11:08:28,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1058 events. 206/1058 cut-off events. For 225/245 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6566 event pairs, 62 based on Foata normal form. 5/1001 useless extension candidates. Maximal degree in co-relation 1691. Up to 330 conditions per place. [2025-04-29 11:08:28,673 INFO L140 encePairwiseOnDemand]: 108/119 looper letters, 47 selfloop transitions, 30 changer transitions 0/196 dead transitions. [2025-04-29 11:08:28,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 196 transitions, 842 flow [2025-04-29 11:08:28,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions. [2025-04-29 11:08:28,674 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2025-04-29 11:08:28,674 INFO L175 Difference]: Start difference. First operand has 165 places, 159 transitions, 572 flow. Second operand 6 states and 629 transitions. [2025-04-29 11:08:28,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 196 transitions, 842 flow [2025-04-29 11:08:28,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 196 transitions, 818 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:08:28,679 INFO L231 Difference]: Finished difference. Result has 169 places, 188 transitions, 798 flow [2025-04-29 11:08:28,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=798, PETRI_PLACES=169, PETRI_TRANSITIONS=188} [2025-04-29 11:08:28,679 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 50 predicate places. [2025-04-29 11:08:28,679 INFO L485 AbstractCegarLoop]: Abstraction has has 169 places, 188 transitions, 798 flow [2025-04-29 11:08:28,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 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) [2025-04-29 11:08:28,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:28,680 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:28,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:08:28,680 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:28,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:28,681 INFO L85 PathProgramCache]: Analyzing trace with hash 484248266, now seen corresponding path program 1 times [2025-04-29 11:08:28,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:28,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615638156] [2025-04-29 11:08:28,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:28,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:28,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-29 11:08:28,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-29 11:08:28,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:28,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:28,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:28,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615638156] [2025-04-29 11:08:28,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615638156] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:28,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334693235] [2025-04-29 11:08:28,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:28,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:28,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:28,966 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:28,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:08:29,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-29 11:08:29,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-29 11:08:29,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:29,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:29,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:08:29,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:29,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:29,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334693235] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:29,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:29,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:08:29,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769080207] [2025-04-29 11:08:29,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:29,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:08:29,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:29,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:08:29,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:08:29,325 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 119 [2025-04-29 11:08:29,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 188 transitions, 798 flow. Second operand has 23 states, 23 states have (on average 107.08695652173913) internal successors, (2463), 23 states have internal predecessors, (2463), 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) [2025-04-29 11:08:29,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:29,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 119 [2025-04-29 11:08:29,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:29,656 INFO L116 PetriNetUnfolderBase]: 117/806 cut-off events. [2025-04-29 11:08:29,656 INFO L117 PetriNetUnfolderBase]: For 360/373 co-relation queries the response was YES. [2025-04-29 11:08:29,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 806 events. 117/806 cut-off events. For 360/373 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4356 event pairs, 14 based on Foata normal form. 8/777 useless extension candidates. Maximal degree in co-relation 1309. Up to 84 conditions per place. [2025-04-29 11:08:29,661 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 21 selfloop transitions, 30 changer transitions 0/205 dead transitions. [2025-04-29 11:08:29,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 205 transitions, 1022 flow [2025-04-29 11:08:29,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:08:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:08:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3204 transitions. [2025-04-29 11:08:29,667 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8974789915966387 [2025-04-29 11:08:29,667 INFO L175 Difference]: Start difference. First operand has 169 places, 188 transitions, 798 flow. Second operand 30 states and 3204 transitions. [2025-04-29 11:08:29,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 205 transitions, 1022 flow [2025-04-29 11:08:29,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 205 transitions, 1022 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:29,674 INFO L231 Difference]: Finished difference. Result has 202 places, 198 transitions, 950 flow [2025-04-29 11:08:29,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=950, PETRI_PLACES=202, PETRI_TRANSITIONS=198} [2025-04-29 11:08:29,676 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 83 predicate places. [2025-04-29 11:08:29,676 INFO L485 AbstractCegarLoop]: Abstraction has has 202 places, 198 transitions, 950 flow [2025-04-29 11:08:29,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 107.08695652173913) internal successors, (2463), 23 states have internal predecessors, (2463), 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) [2025-04-29 11:08:29,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:29,677 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:29,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:08:29,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:29,881 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:29,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1036869748, now seen corresponding path program 2 times [2025-04-29 11:08:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:29,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475058342] [2025-04-29 11:08:29,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:29,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-04-29 11:08:29,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 108 statements. [2025-04-29 11:08:29,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:29,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:30,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:30,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475058342] [2025-04-29 11:08:30,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475058342] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:30,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:30,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:30,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94260010] [2025-04-29 11:08:30,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:30,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:30,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:30,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:30,160 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 119 [2025-04-29 11:08:30,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 198 transitions, 950 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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) [2025-04-29 11:08:30,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:30,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 119 [2025-04-29 11:08:30,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:30,380 INFO L116 PetriNetUnfolderBase]: 422/1613 cut-off events. [2025-04-29 11:08:30,380 INFO L117 PetriNetUnfolderBase]: For 998/1040 co-relation queries the response was YES. [2025-04-29 11:08:30,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3623 conditions, 1613 events. 422/1613 cut-off events. For 998/1040 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 10517 event pairs, 107 based on Foata normal form. 12/1534 useless extension candidates. Maximal degree in co-relation 3386. Up to 718 conditions per place. [2025-04-29 11:08:30,388 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 76 selfloop transitions, 57 changer transitions 0/253 dead transitions. [2025-04-29 11:08:30,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 253 transitions, 1460 flow [2025-04-29 11:08:30,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2025-04-29 11:08:30,391 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8613445378151261 [2025-04-29 11:08:30,391 INFO L175 Difference]: Start difference. First operand has 202 places, 198 transitions, 950 flow. Second operand 6 states and 615 transitions. [2025-04-29 11:08:30,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 253 transitions, 1460 flow [2025-04-29 11:08:30,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 253 transitions, 1414 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-29 11:08:30,400 INFO L231 Difference]: Finished difference. Result has 194 places, 245 transitions, 1402 flow [2025-04-29 11:08:30,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1402, PETRI_PLACES=194, PETRI_TRANSITIONS=245} [2025-04-29 11:08:30,402 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 75 predicate places. [2025-04-29 11:08:30,402 INFO L485 AbstractCegarLoop]: Abstraction has has 194 places, 245 transitions, 1402 flow [2025-04-29 11:08:30,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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) [2025-04-29 11:08:30,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:30,403 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:30,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:08:30,403 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:30,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:30,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1475807919, now seen corresponding path program 1 times [2025-04-29 11:08:30,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:30,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688903074] [2025-04-29 11:08:30,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:30,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:30,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-29 11:08:30,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-29 11:08:30,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:30,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:30,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:30,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688903074] [2025-04-29 11:08:30,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688903074] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:30,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:30,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:30,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317713115] [2025-04-29 11:08:30,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:30,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:30,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:30,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:30,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:30,773 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 119 [2025-04-29 11:08:30,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 245 transitions, 1402 flow. Second operand has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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) [2025-04-29 11:08:30,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:30,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 119 [2025-04-29 11:08:30,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:31,055 INFO L116 PetriNetUnfolderBase]: 542/2053 cut-off events. [2025-04-29 11:08:31,055 INFO L117 PetriNetUnfolderBase]: For 2462/2523 co-relation queries the response was YES. [2025-04-29 11:08:31,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5220 conditions, 2053 events. 542/2053 cut-off events. For 2462/2523 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 14599 event pairs, 113 based on Foata normal form. 13/1980 useless extension candidates. Maximal degree in co-relation 5000. Up to 894 conditions per place. [2025-04-29 11:08:31,066 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 113 selfloop transitions, 71 changer transitions 0/306 dead transitions. [2025-04-29 11:08:31,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 306 transitions, 2124 flow [2025-04-29 11:08:31,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2025-04-29 11:08:31,068 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8613445378151261 [2025-04-29 11:08:31,068 INFO L175 Difference]: Start difference. First operand has 194 places, 245 transitions, 1402 flow. Second operand 6 states and 615 transitions. [2025-04-29 11:08:31,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 306 transitions, 2124 flow [2025-04-29 11:08:31,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 306 transitions, 2060 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:31,083 INFO L231 Difference]: Finished difference. Result has 204 places, 298 transitions, 2014 flow [2025-04-29 11:08:31,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1344, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2014, PETRI_PLACES=204, PETRI_TRANSITIONS=298} [2025-04-29 11:08:31,084 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 85 predicate places. [2025-04-29 11:08:31,085 INFO L485 AbstractCegarLoop]: Abstraction has has 204 places, 298 transitions, 2014 flow [2025-04-29 11:08:31,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.5) internal successors, (555), 6 states have internal predecessors, (555), 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) [2025-04-29 11:08:31,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:31,086 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:31,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:08:31,086 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:31,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1806238493, now seen corresponding path program 1 times [2025-04-29 11:08:31,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:31,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125962252] [2025-04-29 11:08:31,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:31,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:31,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:08:31,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:08:31,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:31,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:31,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:31,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125962252] [2025-04-29 11:08:31,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125962252] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:31,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:31,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:31,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951099672] [2025-04-29 11:08:31,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:31,399 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:31,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:31,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:31,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:31,840 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:08:31,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 298 transitions, 2014 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:31,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:31,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:08:31,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:32,509 INFO L116 PetriNetUnfolderBase]: 1100/4366 cut-off events. [2025-04-29 11:08:32,510 INFO L117 PetriNetUnfolderBase]: For 5763/5884 co-relation queries the response was YES. [2025-04-29 11:08:32,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11993 conditions, 4366 events. 1100/4366 cut-off events. For 5763/5884 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 35893 event pairs, 151 based on Foata normal form. 49/4390 useless extension candidates. Maximal degree in co-relation 11756. Up to 625 conditions per place. [2025-04-29 11:08:32,535 INFO L140 encePairwiseOnDemand]: 102/119 looper letters, 71 selfloop transitions, 19 changer transitions 1/362 dead transitions. [2025-04-29 11:08:32,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 362 transitions, 2324 flow [2025-04-29 11:08:32,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 922 transitions. [2025-04-29 11:08:32,537 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8608776844070962 [2025-04-29 11:08:32,537 INFO L175 Difference]: Start difference. First operand has 204 places, 298 transitions, 2014 flow. Second operand 9 states and 922 transitions. [2025-04-29 11:08:32,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 362 transitions, 2324 flow [2025-04-29 11:08:32,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 362 transitions, 2242 flow, removed 41 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:32,568 INFO L231 Difference]: Finished difference. Result has 219 places, 316 transitions, 2076 flow [2025-04-29 11:08:32,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1932, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2076, PETRI_PLACES=219, PETRI_TRANSITIONS=316} [2025-04-29 11:08:32,569 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 100 predicate places. [2025-04-29 11:08:32,569 INFO L485 AbstractCegarLoop]: Abstraction has has 219 places, 316 transitions, 2076 flow [2025-04-29 11:08:32,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:32,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:32,570 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:32,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:08:32,570 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:32,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash 900311373, now seen corresponding path program 2 times [2025-04-29 11:08:32,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:32,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125754646] [2025-04-29 11:08:32,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:32,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:32,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-04-29 11:08:32,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 119 statements. [2025-04-29 11:08:32,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:32,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:32,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:32,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125754646] [2025-04-29 11:08:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125754646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:32,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:32,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:32,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957220246] [2025-04-29 11:08:32,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:32,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:32,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:32,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:32,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:33,301 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:08:33,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 316 transitions, 2076 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:33,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:33,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:08:33,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:34,412 INFO L116 PetriNetUnfolderBase]: 2078/7715 cut-off events. [2025-04-29 11:08:34,413 INFO L117 PetriNetUnfolderBase]: For 11360/11648 co-relation queries the response was YES. [2025-04-29 11:08:34,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22898 conditions, 7715 events. 2078/7715 cut-off events. For 11360/11648 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 68611 event pairs, 274 based on Foata normal form. 75/7746 useless extension candidates. Maximal degree in co-relation 22653. Up to 1103 conditions per place. [2025-04-29 11:08:34,466 INFO L140 encePairwiseOnDemand]: 105/119 looper letters, 85 selfloop transitions, 25 changer transitions 6/387 dead transitions. [2025-04-29 11:08:34,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 387 transitions, 2600 flow [2025-04-29 11:08:34,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 916 transitions. [2025-04-29 11:08:34,469 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8552754435107376 [2025-04-29 11:08:34,469 INFO L175 Difference]: Start difference. First operand has 219 places, 316 transitions, 2076 flow. Second operand 9 states and 916 transitions. [2025-04-29 11:08:34,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 387 transitions, 2600 flow [2025-04-29 11:08:34,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 387 transitions, 2600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:34,521 INFO L231 Difference]: Finished difference. Result has 234 places, 331 transitions, 2273 flow [2025-04-29 11:08:34,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2273, PETRI_PLACES=234, PETRI_TRANSITIONS=331} [2025-04-29 11:08:34,522 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 115 predicate places. [2025-04-29 11:08:34,522 INFO L485 AbstractCegarLoop]: Abstraction has has 234 places, 331 transitions, 2273 flow [2025-04-29 11:08:34,522 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:34,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:34,523 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:34,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:08:34,523 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:34,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1342178607, now seen corresponding path program 3 times [2025-04-29 11:08:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:34,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483397087] [2025-04-29 11:08:34,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:08:34,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:34,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:08:34,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 119 statements. [2025-04-29 11:08:34,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:08:34,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:34,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:34,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483397087] [2025-04-29 11:08:34,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483397087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:34,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:34,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:34,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848619005] [2025-04-29 11:08:34,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:34,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:34,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:34,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:34,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:35,264 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:08:35,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 331 transitions, 2273 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:35,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:35,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:08:35,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:36,461 INFO L116 PetriNetUnfolderBase]: 2422/9046 cut-off events. [2025-04-29 11:08:36,462 INFO L117 PetriNetUnfolderBase]: For 16468/16881 co-relation queries the response was YES. [2025-04-29 11:08:36,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28475 conditions, 9046 events. 2422/9046 cut-off events. For 16468/16881 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 83602 event pairs, 296 based on Foata normal form. 63/9046 useless extension candidates. Maximal degree in co-relation 28222. Up to 1401 conditions per place. [2025-04-29 11:08:36,520 INFO L140 encePairwiseOnDemand]: 105/119 looper letters, 116 selfloop transitions, 23 changer transitions 0/410 dead transitions. [2025-04-29 11:08:36,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 410 transitions, 3066 flow [2025-04-29 11:08:36,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:36,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 926 transitions. [2025-04-29 11:08:36,523 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8646125116713352 [2025-04-29 11:08:36,523 INFO L175 Difference]: Start difference. First operand has 234 places, 331 transitions, 2273 flow. Second operand 9 states and 926 transitions. [2025-04-29 11:08:36,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 410 transitions, 3066 flow [2025-04-29 11:08:36,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 410 transitions, 3024 flow, removed 21 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:36,584 INFO L231 Difference]: Finished difference. Result has 249 places, 350 transitions, 2492 flow [2025-04-29 11:08:36,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=2245, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2492, PETRI_PLACES=249, PETRI_TRANSITIONS=350} [2025-04-29 11:08:36,585 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 130 predicate places. [2025-04-29 11:08:36,585 INFO L485 AbstractCegarLoop]: Abstraction has has 249 places, 350 transitions, 2492 flow [2025-04-29 11:08:36,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:36,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:36,586 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:36,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:08:36,586 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:36,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash -538788355, now seen corresponding path program 4 times [2025-04-29 11:08:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:36,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934199062] [2025-04-29 11:08:36,587 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:08:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:36,597 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 119 statements into 2 equivalence classes. [2025-04-29 11:08:36,606 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 101 of 119 statements. [2025-04-29 11:08:36,607 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:08:36,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:37,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:37,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934199062] [2025-04-29 11:08:37,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934199062] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:37,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:08:37,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918980240] [2025-04-29 11:08:37,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:37,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:37,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:37,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:37,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:37,567 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:08:37,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 350 transitions, 2492 flow. Second operand has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 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) [2025-04-29 11:08:37,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:37,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:08:37,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:38,917 INFO L116 PetriNetUnfolderBase]: 2712/9951 cut-off events. [2025-04-29 11:08:38,917 INFO L117 PetriNetUnfolderBase]: For 21667/22229 co-relation queries the response was YES. [2025-04-29 11:08:39,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32419 conditions, 9951 events. 2712/9951 cut-off events. For 21667/22229 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 94099 event pairs, 300 based on Foata normal form. 110/10005 useless extension candidates. Maximal degree in co-relation 32158. Up to 1480 conditions per place. [2025-04-29 11:08:39,106 INFO L140 encePairwiseOnDemand]: 102/119 looper letters, 117 selfloop transitions, 40 changer transitions 4/432 dead transitions. [2025-04-29 11:08:39,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 432 transitions, 3432 flow [2025-04-29 11:08:39,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:08:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:08:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1011 transitions. [2025-04-29 11:08:39,108 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8495798319327731 [2025-04-29 11:08:39,108 INFO L175 Difference]: Start difference. First operand has 249 places, 350 transitions, 2492 flow. Second operand 10 states and 1011 transitions. [2025-04-29 11:08:39,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 432 transitions, 3432 flow [2025-04-29 11:08:39,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 432 transitions, 3388 flow, removed 22 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:39,182 INFO L231 Difference]: Finished difference. Result has 263 places, 366 transitions, 2747 flow [2025-04-29 11:08:39,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=2464, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2747, PETRI_PLACES=263, PETRI_TRANSITIONS=366} [2025-04-29 11:08:39,182 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 144 predicate places. [2025-04-29 11:08:39,182 INFO L485 AbstractCegarLoop]: Abstraction has has 263 places, 366 transitions, 2747 flow [2025-04-29 11:08:39,183 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 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) [2025-04-29 11:08:39,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:39,183 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:39,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:08:39,183 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:39,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1430898675, now seen corresponding path program 5 times [2025-04-29 11:08:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:39,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654730171] [2025-04-29 11:08:39,184 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:08:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:39,193 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:08:39,205 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:08:39,205 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:08:39,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-04-29 11:08:39,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:39,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654730171] [2025-04-29 11:08:39,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654730171] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:39,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270012260] [2025-04-29 11:08:39,572 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:08:39,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:39,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:39,574 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:39,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:08:39,622 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:08:39,670 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:08:39,671 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:08:39,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:39,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:08:39,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:39,848 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:08:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:39,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:39,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270012260] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:39,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:39,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-04-29 11:08:39,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870889784] [2025-04-29 11:08:39,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:39,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:39,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:39,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:39,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:08:40,290 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:08:40,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 366 transitions, 2747 flow. Second operand has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 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) [2025-04-29 11:08:40,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:40,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:08:40,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:41,715 INFO L116 PetriNetUnfolderBase]: 2728/10009 cut-off events. [2025-04-29 11:08:41,715 INFO L117 PetriNetUnfolderBase]: For 26697/27390 co-relation queries the response was YES. [2025-04-29 11:08:41,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33920 conditions, 10009 events. 2728/10009 cut-off events. For 26697/27390 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 95064 event pairs, 325 based on Foata normal form. 92/10023 useless extension candidates. Maximal degree in co-relation 33652. Up to 1510 conditions per place. [2025-04-29 11:08:41,788 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 114 selfloop transitions, 42 changer transitions 0/427 dead transitions. [2025-04-29 11:08:41,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 427 transitions, 3661 flow [2025-04-29 11:08:41,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:08:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:08:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1012 transitions. [2025-04-29 11:08:41,790 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8504201680672269 [2025-04-29 11:08:41,790 INFO L175 Difference]: Start difference. First operand has 263 places, 366 transitions, 2747 flow. Second operand 10 states and 1012 transitions. [2025-04-29 11:08:41,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 427 transitions, 3661 flow [2025-04-29 11:08:41,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 427 transitions, 3531 flow, removed 29 selfloop flow, removed 4 redundant places. [2025-04-29 11:08:41,883 INFO L231 Difference]: Finished difference. Result has 275 places, 384 transitions, 3044 flow [2025-04-29 11:08:41,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=2664, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3044, PETRI_PLACES=275, PETRI_TRANSITIONS=384} [2025-04-29 11:08:41,884 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 156 predicate places. [2025-04-29 11:08:41,884 INFO L485 AbstractCegarLoop]: Abstraction has has 275 places, 384 transitions, 3044 flow [2025-04-29 11:08:41,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 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) [2025-04-29 11:08:41,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:41,885 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:41,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:08:42,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:42,086 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:42,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:42,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1565735937, now seen corresponding path program 6 times [2025-04-29 11:08:42,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:42,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971271469] [2025-04-29 11:08:42,087 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:08:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:42,098 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:08:42,102 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 119 statements. [2025-04-29 11:08:42,102 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-29 11:08:42,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:42,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:42,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971271469] [2025-04-29 11:08:42,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971271469] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:42,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:42,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:42,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871199508] [2025-04-29 11:08:42,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:42,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:42,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:42,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:42,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:42,722 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:08:42,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 384 transitions, 3044 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:42,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:42,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:08:42,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:44,611 INFO L116 PetriNetUnfolderBase]: 3051/11281 cut-off events. [2025-04-29 11:08:44,611 INFO L117 PetriNetUnfolderBase]: For 35814/36717 co-relation queries the response was YES. [2025-04-29 11:08:44,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39211 conditions, 11281 events. 3051/11281 cut-off events. For 35814/36717 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 110413 event pairs, 317 based on Foata normal form. 98/11299 useless extension candidates. Maximal degree in co-relation 38936. Up to 1709 conditions per place. [2025-04-29 11:08:44,691 INFO L140 encePairwiseOnDemand]: 105/119 looper letters, 151 selfloop transitions, 37 changer transitions 2/461 dead transitions. [2025-04-29 11:08:44,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 461 transitions, 4258 flow [2025-04-29 11:08:44,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 924 transitions. [2025-04-29 11:08:44,692 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8627450980392157 [2025-04-29 11:08:44,692 INFO L175 Difference]: Start difference. First operand has 275 places, 384 transitions, 3044 flow. Second operand 9 states and 924 transitions. [2025-04-29 11:08:44,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 461 transitions, 4258 flow [2025-04-29 11:08:44,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 461 transitions, 4101 flow, removed 71 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:44,794 INFO L231 Difference]: Finished difference. Result has 287 places, 401 transitions, 3326 flow [2025-04-29 11:08:44,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=2955, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3326, PETRI_PLACES=287, PETRI_TRANSITIONS=401} [2025-04-29 11:08:44,794 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 168 predicate places. [2025-04-29 11:08:44,794 INFO L485 AbstractCegarLoop]: Abstraction has has 287 places, 401 transitions, 3326 flow [2025-04-29 11:08:44,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:44,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:44,795 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:44,795 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:08:44,795 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:44,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1680577731, now seen corresponding path program 7 times [2025-04-29 11:08:44,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:44,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146438462] [2025-04-29 11:08:44,796 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:08:44,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:44,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:08:44,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:08:44,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:44,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:44,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:44,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146438462] [2025-04-29 11:08:44,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146438462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:44,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:44,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:44,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326287349] [2025-04-29 11:08:44,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:44,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:44,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:44,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:44,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:45,207 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:08:45,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 401 transitions, 3326 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:45,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:45,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:08:45,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:46,830 INFO L116 PetriNetUnfolderBase]: 3339/12109 cut-off events. [2025-04-29 11:08:46,830 INFO L117 PetriNetUnfolderBase]: For 40462/41435 co-relation queries the response was YES. [2025-04-29 11:08:46,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42491 conditions, 12109 events. 3339/12109 cut-off events. For 40462/41435 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 120671 event pairs, 353 based on Foata normal form. 148/12169 useless extension candidates. Maximal degree in co-relation 42211. Up to 1889 conditions per place. [2025-04-29 11:08:46,932 INFO L140 encePairwiseOnDemand]: 103/119 looper letters, 147 selfloop transitions, 52 changer transitions 0/470 dead transitions. [2025-04-29 11:08:46,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 470 transitions, 4585 flow [2025-04-29 11:08:46,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 924 transitions. [2025-04-29 11:08:46,933 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8627450980392157 [2025-04-29 11:08:46,933 INFO L175 Difference]: Start difference. First operand has 287 places, 401 transitions, 3326 flow. Second operand 9 states and 924 transitions. [2025-04-29 11:08:46,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 470 transitions, 4585 flow [2025-04-29 11:08:47,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 470 transitions, 4485 flow, removed 29 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:47,059 INFO L231 Difference]: Finished difference. Result has 297 places, 415 transitions, 3609 flow [2025-04-29 11:08:47,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=3255, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3609, PETRI_PLACES=297, PETRI_TRANSITIONS=415} [2025-04-29 11:08:47,060 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 178 predicate places. [2025-04-29 11:08:47,060 INFO L485 AbstractCegarLoop]: Abstraction has has 297 places, 415 transitions, 3609 flow [2025-04-29 11:08:47,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:47,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:47,060 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:47,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:08:47,060 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:47,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:47,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1630148273, now seen corresponding path program 8 times [2025-04-29 11:08:47,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:47,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751436626] [2025-04-29 11:08:47,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:47,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:47,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-04-29 11:08:47,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 119 statements. [2025-04-29 11:08:47,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:47,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:47,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:47,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751436626] [2025-04-29 11:08:47,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751436626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:47,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:47,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:47,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658484091] [2025-04-29 11:08:47,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:47,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:47,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:47,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:47,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:47,676 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:08:47,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 415 transitions, 3609 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:47,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:47,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:08:47,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:49,405 INFO L116 PetriNetUnfolderBase]: 3330/12181 cut-off events. [2025-04-29 11:08:49,405 INFO L117 PetriNetUnfolderBase]: For 44518/45373 co-relation queries the response was YES. [2025-04-29 11:08:49,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43335 conditions, 12181 events. 3330/12181 cut-off events. For 44518/45373 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 121390 event pairs, 370 based on Foata normal form. 127/12221 useless extension candidates. Maximal degree in co-relation 43051. Up to 1884 conditions per place. [2025-04-29 11:08:49,492 INFO L140 encePairwiseOnDemand]: 105/119 looper letters, 148 selfloop transitions, 48 changer transitions 0/467 dead transitions. [2025-04-29 11:08:49,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 467 transitions, 4640 flow [2025-04-29 11:08:49,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 926 transitions. [2025-04-29 11:08:49,494 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8646125116713352 [2025-04-29 11:08:49,494 INFO L175 Difference]: Start difference. First operand has 297 places, 415 transitions, 3609 flow. Second operand 9 states and 926 transitions. [2025-04-29 11:08:49,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 467 transitions, 4640 flow [2025-04-29 11:08:49,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 467 transitions, 4493 flow, removed 29 selfloop flow, removed 4 redundant places. [2025-04-29 11:08:49,639 INFO L231 Difference]: Finished difference. Result has 307 places, 427 transitions, 3865 flow [2025-04-29 11:08:49,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=3485, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3865, PETRI_PLACES=307, PETRI_TRANSITIONS=427} [2025-04-29 11:08:49,640 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 188 predicate places. [2025-04-29 11:08:49,640 INFO L485 AbstractCegarLoop]: Abstraction has has 307 places, 427 transitions, 3865 flow [2025-04-29 11:08:49,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:49,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:49,640 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:49,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:08:49,640 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:49,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:49,641 INFO L85 PathProgramCache]: Analyzing trace with hash 68743287, now seen corresponding path program 9 times [2025-04-29 11:08:49,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:49,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054314493] [2025-04-29 11:08:49,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:08:49,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:49,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:08:49,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 119 statements. [2025-04-29 11:08:49,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:08:49,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:49,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054314493] [2025-04-29 11:08:49,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054314493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:49,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:49,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:49,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368183160] [2025-04-29 11:08:49,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:49,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:49,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:49,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:49,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:50,103 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:08:50,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 427 transitions, 3865 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:50,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:50,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:08:50,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:52,276 INFO L116 PetriNetUnfolderBase]: 3638/13251 cut-off events. [2025-04-29 11:08:52,276 INFO L117 PetriNetUnfolderBase]: For 52677/53588 co-relation queries the response was YES. [2025-04-29 11:08:52,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47814 conditions, 13251 events. 3638/13251 cut-off events. For 52677/53588 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 134997 event pairs, 369 based on Foata normal form. 117/13275 useless extension candidates. Maximal degree in co-relation 47524. Up to 2083 conditions per place. [2025-04-29 11:08:52,391 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 171 selfloop transitions, 48 changer transitions 0/490 dead transitions. [2025-04-29 11:08:52,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 490 transitions, 5215 flow [2025-04-29 11:08:52,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 928 transitions. [2025-04-29 11:08:52,392 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8664799253034547 [2025-04-29 11:08:52,392 INFO L175 Difference]: Start difference. First operand has 307 places, 427 transitions, 3865 flow. Second operand 9 states and 928 transitions. [2025-04-29 11:08:52,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 490 transitions, 5215 flow [2025-04-29 11:08:52,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 490 transitions, 5029 flow, removed 76 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:52,571 INFO L231 Difference]: Finished difference. Result has 318 places, 441 transitions, 4134 flow [2025-04-29 11:08:52,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=3753, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4134, PETRI_PLACES=318, PETRI_TRANSITIONS=441} [2025-04-29 11:08:52,571 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 199 predicate places. [2025-04-29 11:08:52,571 INFO L485 AbstractCegarLoop]: Abstraction has has 318 places, 441 transitions, 4134 flow [2025-04-29 11:08:52,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:52,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:52,572 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:52,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:08:52,572 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:52,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:52,573 INFO L85 PathProgramCache]: Analyzing trace with hash 988244441, now seen corresponding path program 10 times [2025-04-29 11:08:52,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:52,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009535641] [2025-04-29 11:08:52,573 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:08:52,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:52,582 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 119 statements into 2 equivalence classes. [2025-04-29 11:08:52,588 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 101 of 119 statements. [2025-04-29 11:08:52,588 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:08:52,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:52,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:52,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009535641] [2025-04-29 11:08:52,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009535641] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:52,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:52,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:08:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713287385] [2025-04-29 11:08:52,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:52,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:52,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:52,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:52,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:53,392 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:08:53,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 441 transitions, 4134 flow. Second operand has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 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) [2025-04-29 11:08:53,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:53,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:08:53,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:55,443 INFO L116 PetriNetUnfolderBase]: 3926/14231 cut-off events. [2025-04-29 11:08:55,443 INFO L117 PetriNetUnfolderBase]: For 57891/58876 co-relation queries the response was YES. [2025-04-29 11:08:55,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51648 conditions, 14231 events. 3926/14231 cut-off events. For 57891/58876 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 147554 event pairs, 403 based on Foata normal form. 134/14268 useless extension candidates. Maximal degree in co-relation 51353. Up to 2259 conditions per place. [2025-04-29 11:08:55,616 INFO L140 encePairwiseOnDemand]: 102/119 looper letters, 170 selfloop transitions, 59 changer transitions 0/500 dead transitions. [2025-04-29 11:08:55,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 500 transitions, 5422 flow [2025-04-29 11:08:55,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:08:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:08:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1022 transitions. [2025-04-29 11:08:55,617 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8588235294117647 [2025-04-29 11:08:55,617 INFO L175 Difference]: Start difference. First operand has 318 places, 441 transitions, 4134 flow. Second operand 10 states and 1022 transitions. [2025-04-29 11:08:55,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 500 transitions, 5422 flow [2025-04-29 11:08:55,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 500 transitions, 5315 flow, removed 23 selfloop flow, removed 3 redundant places. [2025-04-29 11:08:55,857 INFO L231 Difference]: Finished difference. Result has 328 places, 455 transitions, 4481 flow [2025-04-29 11:08:55,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=4047, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4481, PETRI_PLACES=328, PETRI_TRANSITIONS=455} [2025-04-29 11:08:55,858 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 209 predicate places. [2025-04-29 11:08:55,858 INFO L485 AbstractCegarLoop]: Abstraction has has 328 places, 455 transitions, 4481 flow [2025-04-29 11:08:55,858 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 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) [2025-04-29 11:08:55,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:55,859 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:55,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:08:55,859 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:55,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:55,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1381769647, now seen corresponding path program 11 times [2025-04-29 11:08:55,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:55,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589895387] [2025-04-29 11:08:55,860 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:08:55,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:55,869 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:08:55,876 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:08:55,877 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:08:55,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-04-29 11:08:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:56,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589895387] [2025-04-29 11:08:56,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589895387] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:56,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337572653] [2025-04-29 11:08:56,229 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:08:56,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:56,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:56,231 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:56,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:08:56,297 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:08:56,347 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:08:56,348 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:08:56,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:56,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:08:56,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:56,539 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:08:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:56,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:56,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337572653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:56,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:56,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-04-29 11:08:56,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593032522] [2025-04-29 11:08:56,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:56,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:56,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:56,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:56,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:08:56,952 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:08:56,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 455 transitions, 4481 flow. Second operand has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 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) [2025-04-29 11:08:56,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:56,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:08:56,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:58,928 INFO L116 PetriNetUnfolderBase]: 3935/14223 cut-off events. [2025-04-29 11:08:58,928 INFO L117 PetriNetUnfolderBase]: For 62031/63239 co-relation queries the response was YES. [2025-04-29 11:08:59,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52123 conditions, 14223 events. 3935/14223 cut-off events. For 62031/63239 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 147572 event pairs, 403 based on Foata normal form. 139/14254 useless extension candidates. Maximal degree in co-relation 51823. Up to 2271 conditions per place. [2025-04-29 11:08:59,087 INFO L140 encePairwiseOnDemand]: 103/119 looper letters, 174 selfloop transitions, 59 changer transitions 0/504 dead transitions. [2025-04-29 11:08:59,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 504 transitions, 5633 flow [2025-04-29 11:08:59,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:08:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:08:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1023 transitions. [2025-04-29 11:08:59,088 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8596638655462185 [2025-04-29 11:08:59,088 INFO L175 Difference]: Start difference. First operand has 328 places, 455 transitions, 4481 flow. Second operand 10 states and 1023 transitions. [2025-04-29 11:08:59,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 504 transitions, 5633 flow [2025-04-29 11:08:59,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 504 transitions, 5457 flow, removed 43 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:59,304 INFO L231 Difference]: Finished difference. Result has 337 places, 465 transitions, 4708 flow [2025-04-29 11:08:59,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=4321, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4708, PETRI_PLACES=337, PETRI_TRANSITIONS=465} [2025-04-29 11:08:59,305 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 218 predicate places. [2025-04-29 11:08:59,305 INFO L485 AbstractCegarLoop]: Abstraction has has 337 places, 465 transitions, 4708 flow [2025-04-29 11:08:59,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 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) [2025-04-29 11:08:59,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:59,305 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:59,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:59,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:59,506 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:08:59,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:59,507 INFO L85 PathProgramCache]: Analyzing trace with hash -642441871, now seen corresponding path program 12 times [2025-04-29 11:08:59,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:59,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316678452] [2025-04-29 11:08:59,507 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:08:59,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:59,514 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:08:59,519 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 119 statements. [2025-04-29 11:08:59,519 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-29 11:08:59,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:08:59,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:59,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316678452] [2025-04-29 11:08:59,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316678452] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:59,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:59,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:59,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669399847] [2025-04-29 11:08:59,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:59,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:59,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:59,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:59,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:59,960 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:08:59,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 465 transitions, 4708 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:08:59,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:59,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:08:59,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:02,158 INFO L116 PetriNetUnfolderBase]: 3926/14233 cut-off events. [2025-04-29 11:09:02,159 INFO L117 PetriNetUnfolderBase]: For 63822/64818 co-relation queries the response was YES. [2025-04-29 11:09:02,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52344 conditions, 14233 events. 3926/14233 cut-off events. For 63822/64818 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 147614 event pairs, 398 based on Foata normal form. 121/14251 useless extension candidates. Maximal degree in co-relation 52039. Up to 2263 conditions per place. [2025-04-29 11:09:02,263 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 187 selfloop transitions, 53 changer transitions 0/511 dead transitions. [2025-04-29 11:09:02,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 511 transitions, 5842 flow [2025-04-29 11:09:02,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 934 transitions. [2025-04-29 11:09:02,264 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8720821661998133 [2025-04-29 11:09:02,264 INFO L175 Difference]: Start difference. First operand has 337 places, 465 transitions, 4708 flow. Second operand 9 states and 934 transitions. [2025-04-29 11:09:02,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 511 transitions, 5842 flow [2025-04-29 11:09:02,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 511 transitions, 5685 flow, removed 48 selfloop flow, removed 4 redundant places. [2025-04-29 11:09:02,470 INFO L231 Difference]: Finished difference. Result has 345 places, 473 transitions, 4899 flow [2025-04-29 11:09:02,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=4583, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4899, PETRI_PLACES=345, PETRI_TRANSITIONS=473} [2025-04-29 11:09:02,471 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 226 predicate places. [2025-04-29 11:09:02,471 INFO L485 AbstractCegarLoop]: Abstraction has has 345 places, 473 transitions, 4899 flow [2025-04-29 11:09:02,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:02,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:02,471 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:02,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:09:02,471 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:02,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:02,472 INFO L85 PathProgramCache]: Analyzing trace with hash -375619071, now seen corresponding path program 13 times [2025-04-29 11:09:02,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:02,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157226070] [2025-04-29 11:09:02,472 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:09:02,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:02,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:09:02,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:09:02,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:02,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:02,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:02,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157226070] [2025-04-29 11:09:02,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157226070] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:02,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:02,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:02,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361675676] [2025-04-29 11:09:02,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:02,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:09:02,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:02,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:09:02,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:09:02,912 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:09:02,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 473 transitions, 4899 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:02,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:02,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:09:02,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:05,037 INFO L116 PetriNetUnfolderBase]: 3931/14316 cut-off events. [2025-04-29 11:09:05,037 INFO L117 PetriNetUnfolderBase]: For 65692/66672 co-relation queries the response was YES. [2025-04-29 11:09:05,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52821 conditions, 14316 events. 3931/14316 cut-off events. For 65692/66672 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 148868 event pairs, 404 based on Foata normal form. 120/14333 useless extension candidates. Maximal degree in co-relation 52513. Up to 2279 conditions per place. [2025-04-29 11:09:05,260 INFO L140 encePairwiseOnDemand]: 103/119 looper letters, 184 selfloop transitions, 61 changer transitions 0/516 dead transitions. [2025-04-29 11:09:05,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 516 transitions, 6029 flow [2025-04-29 11:09:05,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 933 transitions. [2025-04-29 11:09:05,262 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8711484593837535 [2025-04-29 11:09:05,262 INFO L175 Difference]: Start difference. First operand has 345 places, 473 transitions, 4899 flow. Second operand 9 states and 933 transitions. [2025-04-29 11:09:05,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 516 transitions, 6029 flow [2025-04-29 11:09:05,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 516 transitions, 5915 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-04-29 11:09:05,547 INFO L231 Difference]: Finished difference. Result has 352 places, 482 transitions, 5174 flow [2025-04-29 11:09:05,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=4793, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5174, PETRI_PLACES=352, PETRI_TRANSITIONS=482} [2025-04-29 11:09:05,548 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 233 predicate places. [2025-04-29 11:09:05,548 INFO L485 AbstractCegarLoop]: Abstraction has has 352 places, 482 transitions, 5174 flow [2025-04-29 11:09:05,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:05,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:05,548 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:05,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:09:05,548 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:05,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:05,549 INFO L85 PathProgramCache]: Analyzing trace with hash -936511153, now seen corresponding path program 14 times [2025-04-29 11:09:05,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:05,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384382270] [2025-04-29 11:09:05,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:05,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:05,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-04-29 11:09:05,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 119 statements. [2025-04-29 11:09:05,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:05,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:05,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:05,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384382270] [2025-04-29 11:09:05,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384382270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:05,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:05,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:05,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081817776] [2025-04-29 11:09:05,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:05,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:09:05,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:05,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:09:05,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:09:05,997 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:09:05,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 482 transitions, 5174 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:05,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:05,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:09:05,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:07,956 INFO L116 PetriNetUnfolderBase]: 3668/13522 cut-off events. [2025-04-29 11:09:07,957 INFO L117 PetriNetUnfolderBase]: For 62112/63139 co-relation queries the response was YES. [2025-04-29 11:09:08,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49865 conditions, 13522 events. 3668/13522 cut-off events. For 62112/63139 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 138852 event pairs, 388 based on Foata normal form. 115/13532 useless extension candidates. Maximal degree in co-relation 49554. Up to 2119 conditions per place. [2025-04-29 11:09:08,094 INFO L140 encePairwiseOnDemand]: 103/119 looper letters, 187 selfloop transitions, 60 changer transitions 0/518 dead transitions. [2025-04-29 11:09:08,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 518 transitions, 6153 flow [2025-04-29 11:09:08,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 936 transitions. [2025-04-29 11:09:08,095 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8739495798319328 [2025-04-29 11:09:08,095 INFO L175 Difference]: Start difference. First operand has 352 places, 482 transitions, 5174 flow. Second operand 9 states and 936 transitions. [2025-04-29 11:09:08,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 518 transitions, 6153 flow [2025-04-29 11:09:08,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 518 transitions, 5993 flow, removed 53 selfloop flow, removed 3 redundant places. [2025-04-29 11:09:08,324 INFO L231 Difference]: Finished difference. Result has 360 places, 489 transitions, 5357 flow [2025-04-29 11:09:08,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=4975, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5357, PETRI_PLACES=360, PETRI_TRANSITIONS=489} [2025-04-29 11:09:08,325 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 241 predicate places. [2025-04-29 11:09:08,325 INFO L485 AbstractCegarLoop]: Abstraction has has 360 places, 489 transitions, 5357 flow [2025-04-29 11:09:08,325 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:08,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:08,325 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:08,325 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:09:08,325 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:08,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1055522251, now seen corresponding path program 15 times [2025-04-29 11:09:08,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:08,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165594194] [2025-04-29 11:09:08,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:09:08,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:08,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:09:08,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 119 statements. [2025-04-29 11:09:08,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:09:08,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:08,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:08,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165594194] [2025-04-29 11:09:08,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165594194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:08,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:08,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:08,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757606090] [2025-04-29 11:09:08,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:08,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:09:08,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:08,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:09:08,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:09:08,766 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:09:08,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 489 transitions, 5357 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:08,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:08,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:09:08,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:10,772 INFO L116 PetriNetUnfolderBase]: 3395/12720 cut-off events. [2025-04-29 11:09:10,772 INFO L117 PetriNetUnfolderBase]: For 58912/59873 co-relation queries the response was YES. [2025-04-29 11:09:10,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46774 conditions, 12720 events. 3395/12720 cut-off events. For 58912/59873 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 128713 event pairs, 377 based on Foata normal form. 117/12741 useless extension candidates. Maximal degree in co-relation 46460. Up to 1955 conditions per place. [2025-04-29 11:09:10,909 INFO L140 encePairwiseOnDemand]: 105/119 looper letters, 188 selfloop transitions, 65 changer transitions 0/524 dead transitions. [2025-04-29 11:09:10,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 524 transitions, 6294 flow [2025-04-29 11:09:10,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 928 transitions. [2025-04-29 11:09:10,910 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8664799253034547 [2025-04-29 11:09:10,910 INFO L175 Difference]: Start difference. First operand has 360 places, 489 transitions, 5357 flow. Second operand 9 states and 928 transitions. [2025-04-29 11:09:10,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 524 transitions, 6294 flow [2025-04-29 11:09:11,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 524 transitions, 6084 flow, removed 57 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:11,166 INFO L231 Difference]: Finished difference. Result has 366 places, 492 transitions, 5391 flow [2025-04-29 11:09:11,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=5105, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5391, PETRI_PLACES=366, PETRI_TRANSITIONS=492} [2025-04-29 11:09:11,167 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 247 predicate places. [2025-04-29 11:09:11,167 INFO L485 AbstractCegarLoop]: Abstraction has has 366 places, 492 transitions, 5391 flow [2025-04-29 11:09:11,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:11,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:11,167 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:11,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:09:11,167 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:11,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:11,168 INFO L85 PathProgramCache]: Analyzing trace with hash 355114769, now seen corresponding path program 16 times [2025-04-29 11:09:11,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:11,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622005857] [2025-04-29 11:09:11,168 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:09:11,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:11,175 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 119 statements into 2 equivalence classes. [2025-04-29 11:09:11,180 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 101 of 119 statements. [2025-04-29 11:09:11,180 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:09:11,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:11,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:11,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622005857] [2025-04-29 11:09:11,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622005857] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:11,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:11,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:09:11,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508558161] [2025-04-29 11:09:11,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:11,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:11,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:11,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:11,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:11,775 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:09:11,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 492 transitions, 5391 flow. Second operand has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 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) [2025-04-29 11:09:11,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:11,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:09:11,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:13,903 INFO L116 PetriNetUnfolderBase]: 3402/12788 cut-off events. [2025-04-29 11:09:13,903 INFO L117 PetriNetUnfolderBase]: For 59954/60928 co-relation queries the response was YES. [2025-04-29 11:09:13,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47128 conditions, 12788 events. 3402/12788 cut-off events. For 59954/60928 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 129855 event pairs, 354 based on Foata normal form. 123/12819 useless extension candidates. Maximal degree in co-relation 46811. Up to 1962 conditions per place. [2025-04-29 11:09:14,021 INFO L140 encePairwiseOnDemand]: 102/119 looper letters, 211 selfloop transitions, 60 changer transitions 0/542 dead transitions. [2025-04-29 11:09:14,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 542 transitions, 6699 flow [2025-04-29 11:09:14,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:09:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:09:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1022 transitions. [2025-04-29 11:09:14,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8588235294117647 [2025-04-29 11:09:14,022 INFO L175 Difference]: Start difference. First operand has 366 places, 492 transitions, 5391 flow. Second operand 10 states and 1022 transitions. [2025-04-29 11:09:14,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 542 transitions, 6699 flow [2025-04-29 11:09:14,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 542 transitions, 6496 flow, removed 40 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:14,265 INFO L231 Difference]: Finished difference. Result has 373 places, 501 transitions, 5558 flow [2025-04-29 11:09:14,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=5200, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5558, PETRI_PLACES=373, PETRI_TRANSITIONS=501} [2025-04-29 11:09:14,266 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 254 predicate places. [2025-04-29 11:09:14,266 INFO L485 AbstractCegarLoop]: Abstraction has has 373 places, 501 transitions, 5558 flow [2025-04-29 11:09:14,267 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 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) [2025-04-29 11:09:14,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:14,267 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:14,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:09:14,267 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:14,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash 68576971, now seen corresponding path program 17 times [2025-04-29 11:09:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:14,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767415349] [2025-04-29 11:09:14,268 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:09:14,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:14,275 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:09:14,280 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:09:14,280 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:09:14,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-04-29 11:09:14,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:14,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767415349] [2025-04-29 11:09:14,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767415349] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:14,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268966780] [2025-04-29 11:09:14,493 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:09:14,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:14,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:14,495 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:14,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:09:14,557 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:09:14,594 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:09:14,594 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:09:14,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:14,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:09:14,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:14,731 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:09:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:14,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:09:14,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268966780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:14,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:09:14,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-04-29 11:09:14,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576822983] [2025-04-29 11:09:14,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:14,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:14,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:14,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:14,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:09:15,071 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:09:15,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 501 transitions, 5558 flow. Second operand has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 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) [2025-04-29 11:09:15,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:15,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:09:15,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:17,338 INFO L116 PetriNetUnfolderBase]: 3390/12789 cut-off events. [2025-04-29 11:09:17,338 INFO L117 PetriNetUnfolderBase]: For 59828/60695 co-relation queries the response was YES. [2025-04-29 11:09:17,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47163 conditions, 12789 events. 3390/12789 cut-off events. For 59828/60695 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 129848 event pairs, 359 based on Foata normal form. 149/12854 useless extension candidates. Maximal degree in co-relation 46842. Up to 1958 conditions per place. [2025-04-29 11:09:17,447 INFO L140 encePairwiseOnDemand]: 103/119 looper letters, 207 selfloop transitions, 72 changer transitions 0/550 dead transitions. [2025-04-29 11:09:17,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 550 transitions, 6820 flow [2025-04-29 11:09:17,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:09:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:09:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1017 transitions. [2025-04-29 11:09:17,448 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8546218487394958 [2025-04-29 11:09:17,448 INFO L175 Difference]: Start difference. First operand has 373 places, 501 transitions, 5558 flow. Second operand 10 states and 1017 transitions. [2025-04-29 11:09:17,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 550 transitions, 6820 flow [2025-04-29 11:09:17,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 550 transitions, 6612 flow, removed 51 selfloop flow, removed 6 redundant places. [2025-04-29 11:09:17,715 INFO L231 Difference]: Finished difference. Result has 380 places, 509 transitions, 5758 flow [2025-04-29 11:09:17,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=5358, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5758, PETRI_PLACES=380, PETRI_TRANSITIONS=509} [2025-04-29 11:09:17,716 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 261 predicate places. [2025-04-29 11:09:17,716 INFO L485 AbstractCegarLoop]: Abstraction has has 380 places, 509 transitions, 5758 flow [2025-04-29 11:09:17,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 93.6) internal successors, (936), 10 states have internal predecessors, (936), 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) [2025-04-29 11:09:17,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:17,716 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:17,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:09:17,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:17,917 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:17,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:17,918 INFO L85 PathProgramCache]: Analyzing trace with hash -57509359, now seen corresponding path program 18 times [2025-04-29 11:09:17,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:17,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605102212] [2025-04-29 11:09:17,918 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:09:17,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:17,927 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:09:17,930 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 69 of 119 statements. [2025-04-29 11:09:17,930 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-29 11:09:17,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:18,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:18,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605102212] [2025-04-29 11:09:18,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605102212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:18,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:18,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:18,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933562213] [2025-04-29 11:09:18,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:18,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:09:18,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:18,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:09:18,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:09:18,299 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:09:18,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 509 transitions, 5758 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:18,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:18,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:09:18,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:20,495 INFO L116 PetriNetUnfolderBase]: 3117/11981 cut-off events. [2025-04-29 11:09:20,495 INFO L117 PetriNetUnfolderBase]: For 56278/57050 co-relation queries the response was YES. [2025-04-29 11:09:20,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44168 conditions, 11981 events. 3117/11981 cut-off events. For 56278/57050 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 119881 event pairs, 347 based on Foata normal form. 127/12029 useless extension candidates. Maximal degree in co-relation 43843. Up to 1797 conditions per place. [2025-04-29 11:09:20,646 INFO L140 encePairwiseOnDemand]: 103/119 looper letters, 210 selfloop transitions, 69 changer transitions 0/550 dead transitions. [2025-04-29 11:09:20,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 550 transitions, 6880 flow [2025-04-29 11:09:20,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 927 transitions. [2025-04-29 11:09:20,647 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.865546218487395 [2025-04-29 11:09:20,648 INFO L175 Difference]: Start difference. First operand has 380 places, 509 transitions, 5758 flow. Second operand 9 states and 927 transitions. [2025-04-29 11:09:20,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 550 transitions, 6880 flow [2025-04-29 11:09:20,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 550 transitions, 6718 flow, removed 51 selfloop flow, removed 4 redundant places. [2025-04-29 11:09:20,910 INFO L231 Difference]: Finished difference. Result has 387 places, 516 transitions, 5960 flow [2025-04-29 11:09:20,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=5572, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5960, PETRI_PLACES=387, PETRI_TRANSITIONS=516} [2025-04-29 11:09:20,910 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 268 predicate places. [2025-04-29 11:09:20,910 INFO L485 AbstractCegarLoop]: Abstraction has has 387 places, 516 transitions, 5960 flow [2025-04-29 11:09:20,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:20,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:20,911 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:20,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:09:20,911 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:20,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1822622725, now seen corresponding path program 19 times [2025-04-29 11:09:20,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:20,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385631696] [2025-04-29 11:09:20,912 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:09:20,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:20,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:09:20,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:09:20,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:20,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:21,051 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:21,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:21,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385631696] [2025-04-29 11:09:21,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385631696] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:21,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:21,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:21,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704386209] [2025-04-29 11:09:21,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:21,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:09:21,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:21,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:09:21,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:09:21,336 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:09:21,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 516 transitions, 5960 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:21,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:21,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:09:21,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:23,123 INFO L116 PetriNetUnfolderBase]: 2852/11129 cut-off events. [2025-04-29 11:09:23,123 INFO L117 PetriNetUnfolderBase]: For 52029/52923 co-relation queries the response was YES. [2025-04-29 11:09:23,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40907 conditions, 11129 events. 2852/11129 cut-off events. For 52029/52923 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 109415 event pairs, 336 based on Foata normal form. 138/11189 useless extension candidates. Maximal degree in co-relation 40580. Up to 1640 conditions per place. [2025-04-29 11:09:23,236 INFO L140 encePairwiseOnDemand]: 105/119 looper letters, 200 selfloop transitions, 83 changer transitions 0/554 dead transitions. [2025-04-29 11:09:23,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 554 transitions, 6973 flow [2025-04-29 11:09:23,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 922 transitions. [2025-04-29 11:09:23,237 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8608776844070962 [2025-04-29 11:09:23,237 INFO L175 Difference]: Start difference. First operand has 387 places, 516 transitions, 5960 flow. Second operand 9 states and 922 transitions. [2025-04-29 11:09:23,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 554 transitions, 6973 flow [2025-04-29 11:09:23,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 554 transitions, 6768 flow, removed 47 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:23,465 INFO L231 Difference]: Finished difference. Result has 393 places, 519 transitions, 6039 flow [2025-04-29 11:09:23,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=5714, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6039, PETRI_PLACES=393, PETRI_TRANSITIONS=519} [2025-04-29 11:09:23,466 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 274 predicate places. [2025-04-29 11:09:23,466 INFO L485 AbstractCegarLoop]: Abstraction has has 393 places, 519 transitions, 6039 flow [2025-04-29 11:09:23,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:23,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:23,467 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:23,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:09:23,467 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:23,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1892859207, now seen corresponding path program 20 times [2025-04-29 11:09:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:23,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880661363] [2025-04-29 11:09:23,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:23,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:23,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-04-29 11:09:23,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 119 statements. [2025-04-29 11:09:23,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:23,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:23,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:23,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880661363] [2025-04-29 11:09:23,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880661363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:23,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:23,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:23,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103601373] [2025-04-29 11:09:23,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:23,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:09:23,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:23,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:09:23,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:09:23,924 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:09:23,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 519 transitions, 6039 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:23,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:23,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:09:23,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:25,924 INFO L116 PetriNetUnfolderBase]: 3131/12158 cut-off events. [2025-04-29 11:09:25,924 INFO L117 PetriNetUnfolderBase]: For 56438/57193 co-relation queries the response was YES. [2025-04-29 11:09:26,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44730 conditions, 12158 events. 3131/12158 cut-off events. For 56438/57193 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 122160 event pairs, 320 based on Foata normal form. 113/12200 useless extension candidates. Maximal degree in co-relation 44400. Up to 1815 conditions per place. [2025-04-29 11:09:26,093 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 261 selfloop transitions, 52 changer transitions 2/586 dead transitions. [2025-04-29 11:09:26,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 586 transitions, 7575 flow [2025-04-29 11:09:26,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 928 transitions. [2025-04-29 11:09:26,095 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8664799253034547 [2025-04-29 11:09:26,095 INFO L175 Difference]: Start difference. First operand has 393 places, 519 transitions, 6039 flow. Second operand 9 states and 928 transitions. [2025-04-29 11:09:26,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 586 transitions, 7575 flow [2025-04-29 11:09:26,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 586 transitions, 7318 flow, removed 41 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:26,362 INFO L231 Difference]: Finished difference. Result has 400 places, 529 transitions, 6130 flow [2025-04-29 11:09:26,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=5810, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6130, PETRI_PLACES=400, PETRI_TRANSITIONS=529} [2025-04-29 11:09:26,363 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 281 predicate places. [2025-04-29 11:09:26,363 INFO L485 AbstractCegarLoop]: Abstraction has has 400 places, 529 transitions, 6130 flow [2025-04-29 11:09:26,363 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:26,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:26,363 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:26,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:09:26,364 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:09:26,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:26,365 INFO L85 PathProgramCache]: Analyzing trace with hash -239808863, now seen corresponding path program 21 times [2025-04-29 11:09:26,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:26,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655409301] [2025-04-29 11:09:26,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:09:26,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:26,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:09:26,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 119 statements. [2025-04-29 11:09:26,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:09:26,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:26,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:26,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655409301] [2025-04-29 11:09:26,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655409301] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:26,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:26,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:26,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849603640] [2025-04-29 11:09:26,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:26,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:09:26,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:26,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:09:26,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:09:26,751 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 119 [2025-04-29 11:09:26,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 529 transitions, 6130 flow. Second operand has 9 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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) [2025-04-29 11:09:26,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:26,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 119 [2025-04-29 11:09:26,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15