./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.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_05-funloop_hard2.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 d2f3ffb11bb6a1c97782bfc90f78c45a4cc868a08116bba4c906711601e905bd --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:24,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:24,657 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:24,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:24,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:24,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:24,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:24,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:24,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:24,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:24,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:24,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:24,688 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:24,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:24,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:24,688 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:24,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:24,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:24,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:24,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:24,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:24,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:24,689 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:24,689 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:24,689 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:24,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:24,689 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:24,689 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:24,689 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:24,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:24,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:24,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:24,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:24,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:24,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:24,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:24,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:24,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:24,690 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:24,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:24,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:24,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:24,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:24,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:24,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:24,691 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 -> d2f3ffb11bb6a1c97782bfc90f78c45a4cc868a08116bba4c906711601e905bd [2025-04-29 11:08:24,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:24,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:24,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:24,913 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:24,913 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:24,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.c [2025-04-29 11:08:26,229 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0893e00c1/fb8af7067eab48b09e7f3b2bb8821a7c/FLAG0287dd0e8 [2025-04-29 11:08:26,411 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:26,411 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.c [2025-04-29 11:08:26,413 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:26,414 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:26,426 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0893e00c1/fb8af7067eab48b09e7f3b2bb8821a7c/FLAG0287dd0e8 [2025-04-29 11:08:27,230 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0893e00c1/fb8af7067eab48b09e7f3b2bb8821a7c [2025-04-29 11:08:27,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:27,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:27,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:27,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:27,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:27,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:27" (1/1) ... [2025-04-29 11:08:27,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a97d99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:27, skipping insertion in model container [2025-04-29 11:08:27,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:27" (1/1) ... [2025-04-29 11:08:27,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:27,390 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:27,405 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:27,428 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:27,442 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:27,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:27 WrapperNode [2025-04-29 11:08:27,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:27,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:27,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:27,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:27,448 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:27" (1/1) ... [2025-04-29 11:08:27,455 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:27" (1/1) ... [2025-04-29 11:08:27,484 INFO L138 Inliner]: procedures = 12, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 130 [2025-04-29 11:08:27,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:27,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:27,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:27,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:27,493 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:27" (1/1) ... [2025-04-29 11:08:27,494 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:27" (1/1) ... [2025-04-29 11:08:27,498 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:27" (1/1) ... [2025-04-29 11:08:27,499 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:27" (1/1) ... [2025-04-29 11:08:27,511 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:27" (1/1) ... [2025-04-29 11:08:27,512 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:27" (1/1) ... [2025-04-29 11:08:27,513 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:27" (1/1) ... [2025-04-29 11:08:27,514 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:27" (1/1) ... [2025-04-29 11:08:27,519 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:27" (1/1) ... [2025-04-29 11:08:27,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:27,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:27,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:27,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:27,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:27" (1/1) ... [2025-04-29 11:08:27,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:27,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:27,551 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:27,555 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:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:08:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:27,575 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:27,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:08:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:27,576 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:27,576 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:27,577 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:27,645 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:27,647 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:27,931 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:27,932 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:27,955 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:27,955 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:27,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:27 BoogieIcfgContainer [2025-04-29 11:08:27,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:27,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:27,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:27,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:27,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:27" (1/3) ... [2025-04-29 11:08:27,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2ab113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:27, skipping insertion in model container [2025-04-29 11:08:27,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:27" (2/3) ... [2025-04-29 11:08:27,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2ab113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:27, skipping insertion in model container [2025-04-29 11:08:27,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:27" (3/3) ... [2025-04-29 11:08:27,962 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.c [2025-04-29 11:08:27,972 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:27,973 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_05-funloop_hard2.c that has 2 procedures, 140 locations, 141 edges, 1 initial locations, 3 loop locations, and 6 error locations. [2025-04-29 11:08:27,974 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:28,044 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:08:28,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 142 transitions, 288 flow [2025-04-29 11:08:28,127 INFO L116 PetriNetUnfolderBase]: 3/141 cut-off events. [2025-04-29 11:08:28,128 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:28,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 228 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2025-04-29 11:08:28,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 142 transitions, 288 flow [2025-04-29 11:08:28,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 141 transitions, 285 flow [2025-04-29 11:08:28,142 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:28,150 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;@2224a85e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:28,151 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:08:28,171 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:28,172 INFO L116 PetriNetUnfolderBase]: 1/73 cut-off events. [2025-04-29 11:08:28,172 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:28,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:28,173 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] [2025-04-29 11:08:28,173 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:28,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:28,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1371932457, now seen corresponding path program 1 times [2025-04-29 11:08:28,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:28,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385112108] [2025-04-29 11:08:28,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:28,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:28,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:08:28,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:08:28,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:28,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:28,405 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:28,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:28,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385112108] [2025-04-29 11:08:28,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385112108] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:28,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:28,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:08:28,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692246260] [2025-04-29 11:08:28,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:28,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:28,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:28,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:28,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:28,464 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 142 [2025-04-29 11:08:28,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 141 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:28,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 142 [2025-04-29 11:08:28,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:28,548 INFO L116 PetriNetUnfolderBase]: 15/281 cut-off events. [2025-04-29 11:08:28,549 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:28,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 281 events. 15/281 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 901 event pairs, 10 based on Foata normal form. 1/261 useless extension candidates. Maximal degree in co-relation 266. Up to 36 conditions per place. [2025-04-29 11:08:28,552 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 12 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-04-29 11:08:28,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 142 transitions, 315 flow [2025-04-29 11:08:28,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2025-04-29 11:08:28,565 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9436619718309859 [2025-04-29 11:08:28,567 INFO L175 Difference]: Start difference. First operand has 142 places, 141 transitions, 285 flow. Second operand 3 states and 402 transitions. [2025-04-29 11:08:28,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 142 transitions, 315 flow [2025-04-29 11:08:28,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 142 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:28,577 INFO L231 Difference]: Finished difference. Result has 144 places, 142 transitions, 296 flow [2025-04-29 11:08:28,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=144, PETRI_TRANSITIONS=142} [2025-04-29 11:08:28,583 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2025-04-29 11:08:28,584 INFO L485 AbstractCegarLoop]: Abstraction has has 144 places, 142 transitions, 296 flow [2025-04-29 11:08:28,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:28,584 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] [2025-04-29 11:08:28,584 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:28,585 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:28,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1864010598, now seen corresponding path program 1 times [2025-04-29 11:08:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:28,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691445029] [2025-04-29 11:08:28,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:28,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:28,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:08:28,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:08:28,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:28,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:28,766 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:28,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:28,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691445029] [2025-04-29 11:08:28,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691445029] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:28,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859869992] [2025-04-29 11:08:28,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:28,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:28,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:28,768 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:28,771 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:28,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:08:28,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:08:28,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:28,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:28,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 11:08:28,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:08:28,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:28,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859869992] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:28,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:28,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-04-29 11:08:28,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114358852] [2025-04-29 11:08:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:28,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:28,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:28,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:28,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:28,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 142 [2025-04-29 11:08:28,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 142 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:28,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 142 [2025-04-29 11:08:28,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:28,938 INFO L116 PetriNetUnfolderBase]: 35/441 cut-off events. [2025-04-29 11:08:28,938 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:28,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 441 events. 35/441 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1727 event pairs, 10 based on Foata normal form. 3/410 useless extension candidates. Maximal degree in co-relation 481. Up to 51 conditions per place. [2025-04-29 11:08:28,941 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 16 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2025-04-29 11:08:28,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 147 transitions, 342 flow [2025-04-29 11:08:28,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2025-04-29 11:08:28,944 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9530516431924883 [2025-04-29 11:08:28,944 INFO L175 Difference]: Start difference. First operand has 144 places, 142 transitions, 296 flow. Second operand 3 states and 406 transitions. [2025-04-29 11:08:28,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 147 transitions, 342 flow [2025-04-29 11:08:28,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 147 transitions, 340 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:28,949 INFO L231 Difference]: Finished difference. Result has 146 places, 143 transitions, 306 flow [2025-04-29 11:08:28,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=146, PETRI_TRANSITIONS=143} [2025-04-29 11:08:28,950 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 4 predicate places. [2025-04-29 11:08:28,950 INFO L485 AbstractCegarLoop]: Abstraction has has 146 places, 143 transitions, 306 flow [2025-04-29 11:08:28,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:28,951 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:28,959 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:29,156 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:29,156 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:29,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:29,157 INFO L85 PathProgramCache]: Analyzing trace with hash -263506931, now seen corresponding path program 1 times [2025-04-29 11:08:29,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:29,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120786508] [2025-04-29 11:08:29,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:29,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:29,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:08:29,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:08:29,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:29,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:29,260 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:29,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:29,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120786508] [2025-04-29 11:08:29,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120786508] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:29,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934487297] [2025-04-29 11:08:29,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:29,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:29,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:29,263 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:29,265 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:29,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:08:29,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:08:29,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:29,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:29,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:08:29,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:29,363 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:29,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:29,401 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:29,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934487297] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:29,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:29,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:08:29,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340941897] [2025-04-29 11:08:29,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:29,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:29,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:29,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:29,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:29,448 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 142 [2025-04-29 11:08:29,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 306 flow. Second operand has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 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,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:29,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 142 [2025-04-29 11:08:29,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:29,558 INFO L116 PetriNetUnfolderBase]: 24/449 cut-off events. [2025-04-29 11:08:29,558 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:29,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 449 events. 24/449 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1544 event pairs, 14 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 458. Up to 51 conditions per place. [2025-04-29 11:08:29,560 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 16 selfloop transitions, 9 changer transitions 0/151 dead transitions. [2025-04-29 11:08:29,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 151 transitions, 374 flow [2025-04-29 11:08:29,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1161 transitions. [2025-04-29 11:08:29,562 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9084507042253521 [2025-04-29 11:08:29,562 INFO L175 Difference]: Start difference. First operand has 146 places, 143 transitions, 306 flow. Second operand 9 states and 1161 transitions. [2025-04-29 11:08:29,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 151 transitions, 374 flow [2025-04-29 11:08:29,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 151 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:29,564 INFO L231 Difference]: Finished difference. Result has 156 places, 149 transitions, 354 flow [2025-04-29 11:08:29,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=354, PETRI_PLACES=156, PETRI_TRANSITIONS=149} [2025-04-29 11:08:29,565 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 14 predicate places. [2025-04-29 11:08:29,565 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 149 transitions, 354 flow [2025-04-29 11:08:29,566 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 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,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:29,566 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:29,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:08:29,768 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,SelfDestructingSolverStorable2 [2025-04-29 11:08:29,769 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:29,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:29,769 INFO L85 PathProgramCache]: Analyzing trace with hash -488484179, now seen corresponding path program 2 times [2025-04-29 11:08:29,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:29,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795833880] [2025-04-29 11:08:29,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:29,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:29,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-04-29 11:08:29,785 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:29,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:29,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:30,069 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:30,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:30,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795833880] [2025-04-29 11:08:30,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795833880] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:30,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:30,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:30,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070374344] [2025-04-29 11:08:30,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:30,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:30,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:30,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:30,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:30,249 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:08:30,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 149 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:30,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:08:30,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:30,442 INFO L116 PetriNetUnfolderBase]: 333/1505 cut-off events. [2025-04-29 11:08:30,443 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:08:30,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 1505 events. 333/1505 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10095 event pairs, 160 based on Foata normal form. 0/1415 useless extension candidates. Maximal degree in co-relation 2144. Up to 544 conditions per place. [2025-04-29 11:08:30,465 INFO L140 encePairwiseOnDemand]: 131/142 looper letters, 36 selfloop transitions, 22 changer transitions 0/178 dead transitions. [2025-04-29 11:08:30,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 178 transitions, 528 flow [2025-04-29 11:08:30,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:30,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2025-04-29 11:08:30,467 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8650234741784038 [2025-04-29 11:08:30,467 INFO L175 Difference]: Start difference. First operand has 156 places, 149 transitions, 354 flow. Second operand 6 states and 737 transitions. [2025-04-29 11:08:30,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 178 transitions, 528 flow [2025-04-29 11:08:30,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 178 transitions, 522 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:30,470 INFO L231 Difference]: Finished difference. Result has 165 places, 170 transitions, 498 flow [2025-04-29 11:08:30,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=165, PETRI_TRANSITIONS=170} [2025-04-29 11:08:30,471 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 23 predicate places. [2025-04-29 11:08:30,471 INFO L485 AbstractCegarLoop]: Abstraction has has 165 places, 170 transitions, 498 flow [2025-04-29 11:08:30,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:30,471 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:30,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:08:30,472 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:30,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2101776327, now seen corresponding path program 1 times [2025-04-29 11:08:30,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:30,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616587088] [2025-04-29 11:08:30,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:30,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:30,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:08:30,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:08:30,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:30,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:30,558 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:30,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:30,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616587088] [2025-04-29 11:08:30,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616587088] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:30,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953432939] [2025-04-29 11:08:30,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:30,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:30,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:30,560 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:30,562 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:30,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:08:30,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:08:30,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:30,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:30,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:08:30,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:30,654 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:30,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:30,734 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:30,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953432939] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:30,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:30,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:08:30,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837968998] [2025-04-29 11:08:30,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:30,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:08:30,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:30,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:08:30,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:08:30,764 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 142 [2025-04-29 11:08:30,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 170 transitions, 498 flow. Second operand has 18 states, 18 states have (on average 128.0) internal successors, (2304), 18 states have internal predecessors, (2304), 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,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:30,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 142 [2025-04-29 11:08:30,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:31,055 INFO L116 PetriNetUnfolderBase]: 118/1069 cut-off events. [2025-04-29 11:08:31,055 INFO L117 PetriNetUnfolderBase]: For 77/83 co-relation queries the response was YES. [2025-04-29 11:08:31,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1069 events. 118/1069 cut-off events. For 77/83 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5893 event pairs, 24 based on Foata normal form. 4/999 useless extension candidates. Maximal degree in co-relation 1418. Up to 133 conditions per place. [2025-04-29 11:08:31,060 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 20 selfloop transitions, 21 changer transitions 0/188 dead transitions. [2025-04-29 11:08:31,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 188 transitions, 668 flow [2025-04-29 11:08:31,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:08:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:08:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2691 transitions. [2025-04-29 11:08:31,065 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9024144869215291 [2025-04-29 11:08:31,065 INFO L175 Difference]: Start difference. First operand has 165 places, 170 transitions, 498 flow. Second operand 21 states and 2691 transitions. [2025-04-29 11:08:31,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 188 transitions, 668 flow [2025-04-29 11:08:31,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 188 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:31,069 INFO L231 Difference]: Finished difference. Result has 190 places, 183 transitions, 628 flow [2025-04-29 11:08:31,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=628, PETRI_PLACES=190, PETRI_TRANSITIONS=183} [2025-04-29 11:08:31,070 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 48 predicate places. [2025-04-29 11:08:31,070 INFO L485 AbstractCegarLoop]: Abstraction has has 190 places, 183 transitions, 628 flow [2025-04-29 11:08:31,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 128.0) internal successors, (2304), 18 states have internal predecessors, (2304), 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,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:31,071 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:31,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:31,276 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:31,276 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:31,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash -840411783, now seen corresponding path program 2 times [2025-04-29 11:08:31,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:31,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508169341] [2025-04-29 11:08:31,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:31,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:31,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-04-29 11:08:31,295 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:31,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:31,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:31,484 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:31,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:31,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508169341] [2025-04-29 11:08:31,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508169341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:31,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:31,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:31,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108519219] [2025-04-29 11:08:31,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:31,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:31,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:31,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:31,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:31,631 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:08:31,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 183 transitions, 628 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:31,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:08:31,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:31,938 INFO L116 PetriNetUnfolderBase]: 505/2372 cut-off events. [2025-04-29 11:08:31,939 INFO L117 PetriNetUnfolderBase]: For 424/454 co-relation queries the response was YES. [2025-04-29 11:08:31,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4065 conditions, 2372 events. 505/2372 cut-off events. For 424/454 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 17723 event pairs, 194 based on Foata normal form. 5/2236 useless extension candidates. Maximal degree in co-relation 3909. Up to 824 conditions per place. [2025-04-29 11:08:31,950 INFO L140 encePairwiseOnDemand]: 127/142 looper letters, 61 selfloop transitions, 46 changer transitions 0/244 dead transitions. [2025-04-29 11:08:31,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 244 transitions, 1006 flow [2025-04-29 11:08:31,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 761 transitions. [2025-04-29 11:08:31,952 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8931924882629108 [2025-04-29 11:08:31,952 INFO L175 Difference]: Start difference. First operand has 190 places, 183 transitions, 628 flow. Second operand 6 states and 761 transitions. [2025-04-29 11:08:31,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 244 transitions, 1006 flow [2025-04-29 11:08:31,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 244 transitions, 982 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:08:31,958 INFO L231 Difference]: Finished difference. Result has 194 places, 228 transitions, 958 flow [2025-04-29 11:08:31,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=958, PETRI_PLACES=194, PETRI_TRANSITIONS=228} [2025-04-29 11:08:31,958 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 52 predicate places. [2025-04-29 11:08:31,958 INFO L485 AbstractCegarLoop]: Abstraction has has 194 places, 228 transitions, 958 flow [2025-04-29 11:08:31,959 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:31,959 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:31,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:08:31,959 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:31,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:31,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2021831782, now seen corresponding path program 1 times [2025-04-29 11:08:31,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:31,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562874338] [2025-04-29 11:08:31,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:31,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:31,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-29 11:08:31,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-29 11:08:31,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:31,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:32,199 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:32,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:32,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562874338] [2025-04-29 11:08:32,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562874338] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:32,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394063632] [2025-04-29 11:08:32,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:32,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:32,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:32,204 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:32,206 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:32,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-29 11:08:32,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-29 11:08:32,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:32,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:32,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:08:32,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:32,344 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:32,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:32,524 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:32,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394063632] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:32,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:32,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:08:32,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167485499] [2025-04-29 11:08:32,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:32,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:08:32,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:32,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:08:32,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:08:32,547 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 142 [2025-04-29 11:08:32,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 228 transitions, 958 flow. Second operand has 23 states, 23 states have (on average 128.08695652173913) internal successors, (2946), 23 states have internal predecessors, (2946), 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,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:32,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 142 [2025-04-29 11:08:32,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:32,943 INFO L116 PetriNetUnfolderBase]: 264/1698 cut-off events. [2025-04-29 11:08:32,943 INFO L117 PetriNetUnfolderBase]: For 633/662 co-relation queries the response was YES. [2025-04-29 11:08:32,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3123 conditions, 1698 events. 264/1698 cut-off events. For 633/662 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 11592 event pairs, 40 based on Foata normal form. 13/1627 useless extension candidates. Maximal degree in co-relation 2886. Up to 204 conditions per place. [2025-04-29 11:08:32,952 INFO L140 encePairwiseOnDemand]: 136/142 looper letters, 23 selfloop transitions, 30 changer transitions 0/245 dead transitions. [2025-04-29 11:08:32,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 245 transitions, 1186 flow [2025-04-29 11:08:32,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:08:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:08:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3836 transitions. [2025-04-29 11:08:32,961 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9004694835680751 [2025-04-29 11:08:32,962 INFO L175 Difference]: Start difference. First operand has 194 places, 228 transitions, 958 flow. Second operand 30 states and 3836 transitions. [2025-04-29 11:08:32,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 245 transitions, 1186 flow [2025-04-29 11:08:32,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 245 transitions, 1186 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:32,971 INFO L231 Difference]: Finished difference. Result has 227 places, 238 transitions, 1110 flow [2025-04-29 11:08:32,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1110, PETRI_PLACES=227, PETRI_TRANSITIONS=238} [2025-04-29 11:08:32,973 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 85 predicate places. [2025-04-29 11:08:32,973 INFO L485 AbstractCegarLoop]: Abstraction has has 227 places, 238 transitions, 1110 flow [2025-04-29 11:08:32,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 128.08695652173913) internal successors, (2946), 23 states have internal predecessors, (2946), 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,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:32,975 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:32,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:33,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:33,179 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:33,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:33,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2102077269, now seen corresponding path program 2 times [2025-04-29 11:08:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:33,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319003255] [2025-04-29 11:08:33,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:33,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:33,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-04-29 11:08:33,195 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:33,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:33,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:33,373 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:33,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:33,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319003255] [2025-04-29 11:08:33,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319003255] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:33,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:33,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:33,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631297669] [2025-04-29 11:08:33,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:33,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:33,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:33,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:33,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:33,471 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 142 [2025-04-29 11:08:33,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 238 transitions, 1110 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:33,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 142 [2025-04-29 11:08:33,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:33,909 INFO L116 PetriNetUnfolderBase]: 949/3269 cut-off events. [2025-04-29 11:08:33,909 INFO L117 PetriNetUnfolderBase]: For 1990/2085 co-relation queries the response was YES. [2025-04-29 11:08:33,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7499 conditions, 3269 events. 949/3269 cut-off events. For 1990/2085 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 23799 event pairs, 303 based on Foata normal form. 20/3132 useless extension candidates. Maximal degree in co-relation 7261. Up to 1634 conditions per place. [2025-04-29 11:08:33,923 INFO L140 encePairwiseOnDemand]: 127/142 looper letters, 102 selfloop transitions, 57 changer transitions 0/293 dead transitions. [2025-04-29 11:08:33,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 293 transitions, 1672 flow [2025-04-29 11:08:33,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 703 transitions. [2025-04-29 11:08:33,924 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8251173708920188 [2025-04-29 11:08:33,925 INFO L175 Difference]: Start difference. First operand has 227 places, 238 transitions, 1110 flow. Second operand 6 states and 703 transitions. [2025-04-29 11:08:33,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 293 transitions, 1672 flow [2025-04-29 11:08:33,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 293 transitions, 1626 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-29 11:08:33,936 INFO L231 Difference]: Finished difference. Result has 219 places, 285 transitions, 1562 flow [2025-04-29 11:08:33,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=219, PETRI_TRANSITIONS=285} [2025-04-29 11:08:33,937 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 77 predicate places. [2025-04-29 11:08:33,937 INFO L485 AbstractCegarLoop]: Abstraction has has 219 places, 285 transitions, 1562 flow [2025-04-29 11:08:33,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:33,938 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:33,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:08:33,938 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:33,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash 704355087, now seen corresponding path program 1 times [2025-04-29 11:08:33,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:33,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849511190] [2025-04-29 11:08:33,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:33,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:33,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-29 11:08:33,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-29 11:08:33,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:33,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:34,270 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,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:34,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849511190] [2025-04-29 11:08:34,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849511190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:34,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:34,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:34,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138757089] [2025-04-29 11:08:34,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:34,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:34,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:34,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:34,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:34,364 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 142 [2025-04-29 11:08:34,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 285 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:34,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 142 [2025-04-29 11:08:34,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:35,032 INFO L116 PetriNetUnfolderBase]: 1319/4515 cut-off events. [2025-04-29 11:08:35,032 INFO L117 PetriNetUnfolderBase]: For 4843/4974 co-relation queries the response was YES. [2025-04-29 11:08:35,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11594 conditions, 4515 events. 1319/4515 cut-off events. For 4843/4974 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 35687 event pairs, 341 based on Foata normal form. 40/4366 useless extension candidates. Maximal degree in co-relation 11373. Up to 2190 conditions per place. [2025-04-29 11:08:35,059 INFO L140 encePairwiseOnDemand]: 119/142 looper letters, 143 selfloop transitions, 103 changer transitions 4/386 dead transitions. [2025-04-29 11:08:35,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 386 transitions, 2528 flow [2025-04-29 11:08:35,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2025-04-29 11:08:35,062 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8720657276995305 [2025-04-29 11:08:35,062 INFO L175 Difference]: Start difference. First operand has 219 places, 285 transitions, 1562 flow. Second operand 6 states and 743 transitions. [2025-04-29 11:08:35,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 386 transitions, 2528 flow [2025-04-29 11:08:35,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 386 transitions, 2464 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:35,116 INFO L231 Difference]: Finished difference. Result has 229 places, 370 transitions, 2414 flow [2025-04-29 11:08:35,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2414, PETRI_PLACES=229, PETRI_TRANSITIONS=370} [2025-04-29 11:08:35,117 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 87 predicate places. [2025-04-29 11:08:35,117 INFO L485 AbstractCegarLoop]: Abstraction has has 229 places, 370 transitions, 2414 flow [2025-04-29 11:08:35,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:35,117 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:35,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:08:35,118 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:35,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:35,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1357130247, now seen corresponding path program 1 times [2025-04-29 11:08:35,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:35,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126256690] [2025-04-29 11:08:35,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:35,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:35,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:08:35,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:08:35,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:35,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:35,451 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:35,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:35,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126256690] [2025-04-29 11:08:35,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126256690] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:35,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:35,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:35,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101113449] [2025-04-29 11:08:35,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:35,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:35,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:35,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:35,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:36,124 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:08:36,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 370 transitions, 2414 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:36,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:08:36,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:36,924 INFO L116 PetriNetUnfolderBase]: 1222/4914 cut-off events. [2025-04-29 11:08:36,924 INFO L117 PetriNetUnfolderBase]: For 6228/6377 co-relation queries the response was YES. [2025-04-29 11:08:36,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13212 conditions, 4914 events. 1222/4914 cut-off events. For 6228/6377 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 42257 event pairs, 179 based on Foata normal form. 37/4878 useless extension candidates. Maximal degree in co-relation 12974. Up to 724 conditions per place. [2025-04-29 11:08:36,966 INFO L140 encePairwiseOnDemand]: 128/142 looper letters, 73 selfloop transitions, 15 changer transitions 0/428 dead transitions. [2025-04-29 11:08:36,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 428 transitions, 2706 flow [2025-04-29 11:08:36,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1107 transitions. [2025-04-29 11:08:36,969 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8661971830985915 [2025-04-29 11:08:36,969 INFO L175 Difference]: Start difference. First operand has 229 places, 370 transitions, 2414 flow. Second operand 9 states and 1107 transitions. [2025-04-29 11:08:36,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 428 transitions, 2706 flow [2025-04-29 11:08:37,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 428 transitions, 2592 flow, removed 57 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:37,004 INFO L231 Difference]: Finished difference. Result has 244 places, 384 transitions, 2412 flow [2025-04-29 11:08:37,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2412, PETRI_PLACES=244, PETRI_TRANSITIONS=384} [2025-04-29 11:08:37,005 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 102 predicate places. [2025-04-29 11:08:37,005 INFO L485 AbstractCegarLoop]: Abstraction has has 244 places, 384 transitions, 2412 flow [2025-04-29 11:08:37,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:37,006 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:37,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:08:37,006 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:37,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:37,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2017013181, now seen corresponding path program 2 times [2025-04-29 11:08:37,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:37,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634565962] [2025-04-29 11:08:37,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:37,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:37,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-04-29 11:08:37,022 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:37,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:37,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:37,249 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,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:37,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634565962] [2025-04-29 11:08:37,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634565962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:37,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:37,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:37,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901869269] [2025-04-29 11:08:37,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:37,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:37,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:37,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:37,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:37,914 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:08:37,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 384 transitions, 2412 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:37,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:08:37,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:39,094 INFO L116 PetriNetUnfolderBase]: 2479/9276 cut-off events. [2025-04-29 11:08:39,095 INFO L117 PetriNetUnfolderBase]: For 12619/12934 co-relation queries the response was YES. [2025-04-29 11:08:39,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26440 conditions, 9276 events. 2479/9276 cut-off events. For 12619/12934 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 88705 event pairs, 325 based on Foata normal form. 99/9233 useless extension candidates. Maximal degree in co-relation 26194. Up to 1468 conditions per place. [2025-04-29 11:08:39,149 INFO L140 encePairwiseOnDemand]: 128/142 looper letters, 119 selfloop transitions, 20 changer transitions 4/483 dead transitions. [2025-04-29 11:08:39,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 483 transitions, 3130 flow [2025-04-29 11:08:39,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1115 transitions. [2025-04-29 11:08:39,157 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8724569640062598 [2025-04-29 11:08:39,157 INFO L175 Difference]: Start difference. First operand has 244 places, 384 transitions, 2412 flow. Second operand 9 states and 1115 transitions. [2025-04-29 11:08:39,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 483 transitions, 3130 flow [2025-04-29 11:08:39,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 483 transitions, 3120 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:39,208 INFO L231 Difference]: Finished difference. Result has 258 places, 401 transitions, 2591 flow [2025-04-29 11:08:39,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=2410, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2591, PETRI_PLACES=258, PETRI_TRANSITIONS=401} [2025-04-29 11:08:39,209 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 116 predicate places. [2025-04-29 11:08:39,209 INFO L485 AbstractCegarLoop]: Abstraction has has 258 places, 401 transitions, 2591 flow [2025-04-29 11:08:39,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:39,210 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,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:08:39,210 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:39,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:39,210 INFO L85 PathProgramCache]: Analyzing trace with hash -237944655, now seen corresponding path program 3 times [2025-04-29 11:08:39,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:39,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645553039] [2025-04-29 11:08:39,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:08:39,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:39,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:08:39,230 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:39,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:08:39,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:39,415 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,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:39,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645553039] [2025-04-29 11:08:39,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645553039] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:39,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:39,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:39,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096495419] [2025-04-29 11:08:39,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:39,416 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:39,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:39,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:39,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:40,206 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:08:40,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 401 transitions, 2591 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:40,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:08:40,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:41,748 INFO L116 PetriNetUnfolderBase]: 2778/10487 cut-off events. [2025-04-29 11:08:41,748 INFO L117 PetriNetUnfolderBase]: For 16382/16808 co-relation queries the response was YES. [2025-04-29 11:08:41,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31059 conditions, 10487 events. 2778/10487 cut-off events. For 16382/16808 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 101881 event pairs, 352 based on Foata normal form. 106/10427 useless extension candidates. Maximal degree in co-relation 30805. Up to 1567 conditions per place. [2025-04-29 11:08:41,828 INFO L140 encePairwiseOnDemand]: 128/142 looper letters, 123 selfloop transitions, 22 changer transitions 0/485 dead transitions. [2025-04-29 11:08:41,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 485 transitions, 3379 flow [2025-04-29 11:08:41,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1112 transitions. [2025-04-29 11:08:41,830 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8701095461658842 [2025-04-29 11:08:41,830 INFO L175 Difference]: Start difference. First operand has 258 places, 401 transitions, 2591 flow. Second operand 9 states and 1112 transitions. [2025-04-29 11:08:41,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 485 transitions, 3379 flow [2025-04-29 11:08:41,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 485 transitions, 3341 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:42,047 INFO L231 Difference]: Finished difference. Result has 271 places, 413 transitions, 2760 flow [2025-04-29 11:08:42,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=2577, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2760, PETRI_PLACES=271, PETRI_TRANSITIONS=413} [2025-04-29 11:08:42,050 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 129 predicate places. [2025-04-29 11:08:42,050 INFO L485 AbstractCegarLoop]: Abstraction has has 271 places, 413 transitions, 2760 flow [2025-04-29 11:08:42,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:42,051 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:42,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:08:42,051 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:42,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1885630345, now seen corresponding path program 4 times [2025-04-29 11:08:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:42,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465200441] [2025-04-29 11:08:42,052 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:08:42,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:42,062 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 119 statements into 2 equivalence classes. [2025-04-29 11:08:42,075 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:42,076 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:08:42,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:42,402 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,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:42,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465200441] [2025-04-29 11:08:42,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465200441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:42,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:42,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:08:42,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849399071] [2025-04-29 11:08:42,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:42,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:42,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:42,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:42,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:43,034 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:08:43,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 413 transitions, 2760 flow. Second operand has 10 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 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:43,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:43,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:08:43,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:44,757 INFO L116 PetriNetUnfolderBase]: 3073/11355 cut-off events. [2025-04-29 11:08:44,757 INFO L117 PetriNetUnfolderBase]: For 20329/20856 co-relation queries the response was YES. [2025-04-29 11:08:44,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34784 conditions, 11355 events. 3073/11355 cut-off events. For 20329/20856 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 111222 event pairs, 346 based on Foata normal form. 119/11319 useless extension candidates. Maximal degree in co-relation 34524. Up to 1851 conditions per place. [2025-04-29 11:08:44,856 INFO L140 encePairwiseOnDemand]: 127/142 looper letters, 137 selfloop transitions, 28 changer transitions 4/509 dead transitions. [2025-04-29 11:08:44,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 509 transitions, 3745 flow [2025-04-29 11:08:44,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:08:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:08:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1231 transitions. [2025-04-29 11:08:44,858 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8669014084507042 [2025-04-29 11:08:44,858 INFO L175 Difference]: Start difference. First operand has 271 places, 413 transitions, 2760 flow. Second operand 10 states and 1231 transitions. [2025-04-29 11:08:44,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 509 transitions, 3745 flow [2025-04-29 11:08:44,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 509 transitions, 3666 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-29 11:08:44,960 INFO L231 Difference]: Finished difference. Result has 282 places, 425 transitions, 2941 flow [2025-04-29 11:08:44,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=2734, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2941, PETRI_PLACES=282, PETRI_TRANSITIONS=425} [2025-04-29 11:08:44,962 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 140 predicate places. [2025-04-29 11:08:44,962 INFO L485 AbstractCegarLoop]: Abstraction has has 282 places, 425 transitions, 2941 flow [2025-04-29 11:08:44,963 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 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,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:44,963 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,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:08:44,963 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:44,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:44,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1598448271, now seen corresponding path program 5 times [2025-04-29 11:08:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:44,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386614970] [2025-04-29 11:08:44,966 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:08:44,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:44,977 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:08:44,995 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:44,995 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:08:44,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:45,483 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:45,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:45,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386614970] [2025-04-29 11:08:45,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386614970] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:45,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953912726] [2025-04-29 11:08:45,484 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:08:45,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:45,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:45,486 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:45,488 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:45,538 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:08:45,584 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:45,584 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:08:45,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:45,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-29 11:08:45,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:45,774 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:45,883 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:45,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:45,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953912726] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:45,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:45,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-04-29 11:08:45,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702523661] [2025-04-29 11:08:45,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:45,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:45,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:45,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:45,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:08:46,492 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:08:46,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 425 transitions, 2941 flow. Second operand has 10 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 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:46,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:46,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:08:46,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:48,369 INFO L116 PetriNetUnfolderBase]: 3406/12701 cut-off events. [2025-04-29 11:08:48,369 INFO L117 PetriNetUnfolderBase]: For 25327/25885 co-relation queries the response was YES. [2025-04-29 11:08:48,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39476 conditions, 12701 events. 3406/12701 cut-off events. For 25327/25885 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 127041 event pairs, 383 based on Foata normal form. 112/12621 useless extension candidates. Maximal degree in co-relation 39210. Up to 1959 conditions per place. [2025-04-29 11:08:48,449 INFO L140 encePairwiseOnDemand]: 127/142 looper letters, 136 selfloop transitions, 30 changer transitions 0/506 dead transitions. [2025-04-29 11:08:48,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 506 transitions, 3924 flow [2025-04-29 11:08:48,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:08:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:08:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1228 transitions. [2025-04-29 11:08:48,451 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8647887323943662 [2025-04-29 11:08:48,451 INFO L175 Difference]: Start difference. First operand has 282 places, 425 transitions, 2941 flow. Second operand 10 states and 1228 transitions. [2025-04-29 11:08:48,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 506 transitions, 3924 flow [2025-04-29 11:08:48,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 506 transitions, 3831 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-04-29 11:08:48,548 INFO L231 Difference]: Finished difference. Result has 293 places, 440 transitions, 3179 flow [2025-04-29 11:08:48,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=2898, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3179, PETRI_PLACES=293, PETRI_TRANSITIONS=440} [2025-04-29 11:08:48,549 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 151 predicate places. [2025-04-29 11:08:48,549 INFO L485 AbstractCegarLoop]: Abstraction has has 293 places, 440 transitions, 3179 flow [2025-04-29 11:08:48,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 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:48,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:48,550 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:48,556 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:48,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-29 11:08:48,754 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:48,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:48,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1418829631, now seen corresponding path program 6 times [2025-04-29 11:08:48,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:48,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881498400] [2025-04-29 11:08:48,755 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:08:48,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:48,764 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:08:48,771 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:48,771 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-29 11:08:48,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:48,908 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:48,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:48,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881498400] [2025-04-29 11:08:48,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881498400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:48,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:48,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:48,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741995673] [2025-04-29 11:08:48,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:48,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:48,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:48,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:48,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:49,496 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:08:49,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 440 transitions, 3179 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:49,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:08:49,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:51,604 INFO L116 PetriNetUnfolderBase]: 3725/13687 cut-off events. [2025-04-29 11:08:51,605 INFO L117 PetriNetUnfolderBase]: For 31633/32311 co-relation queries the response was YES. [2025-04-29 11:08:51,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43903 conditions, 13687 events. 3725/13687 cut-off events. For 31633/32311 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 138906 event pairs, 381 based on Foata normal form. 120/13628 useless extension candidates. Maximal degree in co-relation 43631. Up to 2232 conditions per place. [2025-04-29 11:08:51,710 INFO L140 encePairwiseOnDemand]: 128/142 looper letters, 154 selfloop transitions, 34 changer transitions 2/530 dead transitions. [2025-04-29 11:08:51,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 530 transitions, 4330 flow [2025-04-29 11:08:51,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1119 transitions. [2025-04-29 11:08:51,712 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8755868544600939 [2025-04-29 11:08:51,712 INFO L175 Difference]: Start difference. First operand has 293 places, 440 transitions, 3179 flow. Second operand 9 states and 1119 transitions. [2025-04-29 11:08:51,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 530 transitions, 4330 flow [2025-04-29 11:08:51,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 530 transitions, 4232 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-04-29 11:08:51,842 INFO L231 Difference]: Finished difference. Result has 304 places, 455 transitions, 3424 flow [2025-04-29 11:08:51,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=3118, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3424, PETRI_PLACES=304, PETRI_TRANSITIONS=455} [2025-04-29 11:08:51,843 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 162 predicate places. [2025-04-29 11:08:51,843 INFO L485 AbstractCegarLoop]: Abstraction has has 304 places, 455 transitions, 3424 flow [2025-04-29 11:08:51,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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:51,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:51,844 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:51,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:08:51,844 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:51,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:51,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2105516915, now seen corresponding path program 7 times [2025-04-29 11:08:51,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:51,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429822884] [2025-04-29 11:08:51,845 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:08:51,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:51,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:08:51,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:08:51,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:51,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:52,109 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,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:52,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429822884] [2025-04-29 11:08:52,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429822884] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:52,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:52,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:52,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602754584] [2025-04-29 11:08:52,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:52,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:52,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:52,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:52,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:52,602 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:08:52,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 455 transitions, 3424 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:52,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:08:52,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:54,995 INFO L116 PetriNetUnfolderBase]: 4068/15064 cut-off events. [2025-04-29 11:08:54,996 INFO L117 PetriNetUnfolderBase]: For 40177/40936 co-relation queries the response was YES. [2025-04-29 11:08:55,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49314 conditions, 15064 events. 4068/15064 cut-off events. For 40177/40936 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 156067 event pairs, 484 based on Foata normal form. 107/14955 useless extension candidates. Maximal degree in co-relation 49037. Up to 2363 conditions per place. [2025-04-29 11:08:55,357 INFO L140 encePairwiseOnDemand]: 128/142 looper letters, 150 selfloop transitions, 36 changer transitions 0/526 dead transitions. [2025-04-29 11:08:55,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 526 transitions, 4526 flow [2025-04-29 11:08:55,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:55,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1117 transitions. [2025-04-29 11:08:55,359 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8740219092331768 [2025-04-29 11:08:55,359 INFO L175 Difference]: Start difference. First operand has 304 places, 455 transitions, 3424 flow. Second operand 9 states and 1117 transitions. [2025-04-29 11:08:55,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 526 transitions, 4526 flow [2025-04-29 11:08:55,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 526 transitions, 4426 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:55,509 INFO L231 Difference]: Finished difference. Result has 317 places, 474 transitions, 3775 flow [2025-04-29 11:08:55,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=3346, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3775, PETRI_PLACES=317, PETRI_TRANSITIONS=474} [2025-04-29 11:08:55,510 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 175 predicate places. [2025-04-29 11:08:55,510 INFO L485 AbstractCegarLoop]: Abstraction has has 317 places, 474 transitions, 3775 flow [2025-04-29 11:08:55,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:55,511 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,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:08:55,511 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:55,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:55,512 INFO L85 PathProgramCache]: Analyzing trace with hash 111121223, now seen corresponding path program 8 times [2025-04-29 11:08:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:55,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354450360] [2025-04-29 11:08:55,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:55,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-04-29 11:08:55,524 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:55,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:55,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:55,641 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:55,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:55,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354450360] [2025-04-29 11:08:55,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354450360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:55,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:55,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:55,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250125217] [2025-04-29 11:08:55,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:55,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:55,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:55,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:55,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:55,891 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:08:55,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 474 transitions, 3775 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:55,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:08:55,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:58,234 INFO L116 PetriNetUnfolderBase]: 4671/16912 cut-off events. [2025-04-29 11:08:58,234 INFO L117 PetriNetUnfolderBase]: For 51162/52004 co-relation queries the response was YES. [2025-04-29 11:08:58,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57019 conditions, 16912 events. 4671/16912 cut-off events. For 51162/52004 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 179727 event pairs, 474 based on Foata normal form. 137/16835 useless extension candidates. Maximal degree in co-relation 56735. Up to 2778 conditions per place. [2025-04-29 11:08:58,399 INFO L140 encePairwiseOnDemand]: 127/142 looper letters, 173 selfloop transitions, 45 changer transitions 0/558 dead transitions. [2025-04-29 11:08:58,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 558 transitions, 5092 flow [2025-04-29 11:08:58,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:08:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:08:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1121 transitions. [2025-04-29 11:08:58,401 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.877151799687011 [2025-04-29 11:08:58,401 INFO L175 Difference]: Start difference. First operand has 317 places, 474 transitions, 3775 flow. Second operand 9 states and 1121 transitions. [2025-04-29 11:08:58,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 558 transitions, 5092 flow [2025-04-29 11:08:58,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 558 transitions, 4988 flow, removed 52 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:58,845 INFO L231 Difference]: Finished difference. Result has 332 places, 492 transitions, 4129 flow [2025-04-29 11:08:58,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=3671, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4129, PETRI_PLACES=332, PETRI_TRANSITIONS=492} [2025-04-29 11:08:58,846 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 190 predicate places. [2025-04-29 11:08:58,846 INFO L485 AbstractCegarLoop]: Abstraction has has 332 places, 492 transitions, 4129 flow [2025-04-29 11:08:58,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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:58,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:58,847 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:58,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:08:58,847 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:08:58,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:58,848 INFO L85 PathProgramCache]: Analyzing trace with hash -868374783, now seen corresponding path program 9 times [2025-04-29 11:08:58,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:58,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372376505] [2025-04-29 11:08:58,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:08:58,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:58,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:08:58,861 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:58,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:08:58,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:59,015 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,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:59,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372376505] [2025-04-29 11:08:59,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372376505] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:59,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:59,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:08:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768167660] [2025-04-29 11:08:59,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:59,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:08:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:59,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:08:59,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:08:59,638 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:08:59,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 492 transitions, 4129 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:59,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:08:59,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:02,881 INFO L116 PetriNetUnfolderBase]: 4663/16993 cut-off events. [2025-04-29 11:09:02,881 INFO L117 PetriNetUnfolderBase]: For 57003/57936 co-relation queries the response was YES. [2025-04-29 11:09:02,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57988 conditions, 16993 events. 4663/16993 cut-off events. For 57003/57936 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 181352 event pairs, 449 based on Foata normal form. 217/17003 useless extension candidates. Maximal degree in co-relation 57696. Up to 2697 conditions per place. [2025-04-29 11:09:02,989 INFO L140 encePairwiseOnDemand]: 126/142 looper letters, 185 selfloop transitions, 58 changer transitions 0/583 dead transitions. [2025-04-29 11:09:02,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 583 transitions, 5455 flow [2025-04-29 11:09:02,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1110 transitions. [2025-04-29 11:09:02,990 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8685446009389671 [2025-04-29 11:09:02,990 INFO L175 Difference]: Start difference. First operand has 332 places, 492 transitions, 4129 flow. Second operand 9 states and 1110 transitions. [2025-04-29 11:09:02,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 583 transitions, 5455 flow [2025-04-29 11:09:03,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 583 transitions, 5367 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:03,189 INFO L231 Difference]: Finished difference. Result has 344 places, 504 transitions, 4369 flow [2025-04-29 11:09:03,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=4043, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4369, PETRI_PLACES=344, PETRI_TRANSITIONS=504} [2025-04-29 11:09:03,190 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 202 predicate places. [2025-04-29 11:09:03,190 INFO L485 AbstractCegarLoop]: Abstraction has has 344 places, 504 transitions, 4369 flow [2025-04-29 11:09:03,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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:03,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:03,190 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:03,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:09:03,191 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:09:03,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:03,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1581352101, now seen corresponding path program 10 times [2025-04-29 11:09:03,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:03,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326466985] [2025-04-29 11:09:03,191 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:09:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:03,199 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 119 statements into 2 equivalence classes. [2025-04-29 11:09:03,207 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:03,207 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:09:03,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:03,587 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:03,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:03,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326466985] [2025-04-29 11:09:03,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326466985] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:03,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:03,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:09:03,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522364378] [2025-04-29 11:09:03,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:03,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:03,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:03,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:03,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:04,133 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:09:04,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 504 transitions, 4369 flow. Second operand has 10 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 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:04,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:04,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:09:04,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:06,905 INFO L116 PetriNetUnfolderBase]: 4388/16193 cut-off events. [2025-04-29 11:09:06,905 INFO L117 PetriNetUnfolderBase]: For 58580/59417 co-relation queries the response was YES. [2025-04-29 11:09:06,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55956 conditions, 16193 events. 4388/16193 cut-off events. For 58580/59417 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 171163 event pairs, 428 based on Foata normal form. 203/16198 useless extension candidates. Maximal degree in co-relation 55659. Up to 2534 conditions per place. [2025-04-29 11:09:07,014 INFO L140 encePairwiseOnDemand]: 127/142 looper letters, 185 selfloop transitions, 55 changer transitions 0/580 dead transitions. [2025-04-29 11:09:07,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 580 transitions, 5583 flow [2025-04-29 11:09:07,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:09:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:09:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1221 transitions. [2025-04-29 11:09:07,016 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8598591549295774 [2025-04-29 11:09:07,016 INFO L175 Difference]: Start difference. First operand has 344 places, 504 transitions, 4369 flow. Second operand 10 states and 1221 transitions. [2025-04-29 11:09:07,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 580 transitions, 5583 flow [2025-04-29 11:09:07,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 580 transitions, 5401 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-04-29 11:09:07,243 INFO L231 Difference]: Finished difference. Result has 352 places, 507 transitions, 4403 flow [2025-04-29 11:09:07,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=4199, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4403, PETRI_PLACES=352, PETRI_TRANSITIONS=507} [2025-04-29 11:09:07,243 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 210 predicate places. [2025-04-29 11:09:07,243 INFO L485 AbstractCegarLoop]: Abstraction has has 352 places, 507 transitions, 4403 flow [2025-04-29 11:09:07,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 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:07,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:07,244 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:07,244 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:09:07,244 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:09:07,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:07,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1887053517, now seen corresponding path program 11 times [2025-04-29 11:09:07,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:07,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891580598] [2025-04-29 11:09:07,245 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:09:07,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:07,255 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:09:07,262 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:07,262 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:09:07,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:07,531 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:07,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:07,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891580598] [2025-04-29 11:09:07,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891580598] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:07,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700001354] [2025-04-29 11:09:07,532 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:09:07,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:07,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:07,534 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:07,535 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:07,598 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:09:07,647 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:07,647 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 11:09:07,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:07,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-29 11:09:07,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:07,823 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:07,870 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:07,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:09:07,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700001354] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:07,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:09:07,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-04-29 11:09:07,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578484848] [2025-04-29 11:09:07,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:07,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:07,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:07,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:07,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:09:08,451 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:09:08,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 507 transitions, 4403 flow. Second operand has 10 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 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,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:08,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:09:08,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:11,258 INFO L116 PetriNetUnfolderBase]: 4390/16271 cut-off events. [2025-04-29 11:09:11,259 INFO L117 PetriNetUnfolderBase]: For 56634/57495 co-relation queries the response was YES. [2025-04-29 11:09:11,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55952 conditions, 16271 events. 4390/16271 cut-off events. For 56634/57495 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 171893 event pairs, 467 based on Foata normal form. 175/16234 useless extension candidates. Maximal degree in co-relation 55651. Up to 2565 conditions per place. [2025-04-29 11:09:11,387 INFO L140 encePairwiseOnDemand]: 126/142 looper letters, 179 selfloop transitions, 61 changer transitions 0/580 dead transitions. [2025-04-29 11:09:11,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 580 transitions, 5567 flow [2025-04-29 11:09:11,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:09:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:09:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1224 transitions. [2025-04-29 11:09:11,388 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8619718309859155 [2025-04-29 11:09:11,388 INFO L175 Difference]: Start difference. First operand has 352 places, 507 transitions, 4403 flow. Second operand 10 states and 1224 transitions. [2025-04-29 11:09:11,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 580 transitions, 5567 flow [2025-04-29 11:09:11,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 580 transitions, 5449 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-04-29 11:09:11,604 INFO L231 Difference]: Finished difference. Result has 360 places, 518 transitions, 4655 flow [2025-04-29 11:09:11,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=4303, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4655, PETRI_PLACES=360, PETRI_TRANSITIONS=518} [2025-04-29 11:09:11,604 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 218 predicate places. [2025-04-29 11:09:11,604 INFO L485 AbstractCegarLoop]: Abstraction has has 360 places, 518 transitions, 4655 flow [2025-04-29 11:09:11,605 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 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,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:11,605 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,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:11,805 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:11,805 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:09:11,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1784202411, now seen corresponding path program 12 times [2025-04-29 11:09:11,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:11,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861695663] [2025-04-29 11:09:11,806 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:09:11,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:11,817 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:09:11,822 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:11,826 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-29 11:09:11,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:11,940 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,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:11,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861695663] [2025-04-29 11:09:11,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861695663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:11,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:11,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:11,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119694966] [2025-04-29 11:09:11,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:11,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:09:11,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:11,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:09:11,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:09:12,419 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:09:12,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 518 transitions, 4655 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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:12,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:12,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:09:12,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:15,410 INFO L116 PetriNetUnfolderBase]: 4679/17289 cut-off events. [2025-04-29 11:09:15,410 INFO L117 PetriNetUnfolderBase]: For 63899/64807 co-relation queries the response was YES. [2025-04-29 11:09:15,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60069 conditions, 17289 events. 4679/17289 cut-off events. For 63899/64807 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 185327 event pairs, 447 based on Foata normal form. 163/17239 useless extension candidates. Maximal degree in co-relation 59763. Up to 2744 conditions per place. [2025-04-29 11:09:15,540 INFO L140 encePairwiseOnDemand]: 127/142 looper letters, 203 selfloop transitions, 49 changer transitions 0/592 dead transitions. [2025-04-29 11:09:15,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 592 transitions, 5991 flow [2025-04-29 11:09:15,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:15,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1119 transitions. [2025-04-29 11:09:15,541 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8755868544600939 [2025-04-29 11:09:15,541 INFO L175 Difference]: Start difference. First operand has 360 places, 518 transitions, 4655 flow. Second operand 9 states and 1119 transitions. [2025-04-29 11:09:15,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 592 transitions, 5991 flow [2025-04-29 11:09:15,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 592 transitions, 5785 flow, removed 73 selfloop flow, removed 4 redundant places. [2025-04-29 11:09:15,797 INFO L231 Difference]: Finished difference. Result has 368 places, 528 transitions, 4835 flow [2025-04-29 11:09:15,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=4547, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4835, PETRI_PLACES=368, PETRI_TRANSITIONS=528} [2025-04-29 11:09:15,798 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 226 predicate places. [2025-04-29 11:09:15,798 INFO L485 AbstractCegarLoop]: Abstraction has has 368 places, 528 transitions, 4835 flow [2025-04-29 11:09:15,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:15,798 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:15,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:09:15,798 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:09:15,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:15,799 INFO L85 PathProgramCache]: Analyzing trace with hash 418033409, now seen corresponding path program 13 times [2025-04-29 11:09:15,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:15,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803209748] [2025-04-29 11:09:15,799 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 11:09:15,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:15,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:09:15,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:09:15,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:15,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:15,949 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:15,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:15,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803209748] [2025-04-29 11:09:15,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803209748] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:15,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:15,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:15,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101902413] [2025-04-29 11:09:15,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:15,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:09:15,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:15,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:09:15,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:09:16,317 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:09:16,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 528 transitions, 4835 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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:16,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:16,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:09:16,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:19,452 INFO L116 PetriNetUnfolderBase]: 4685/17359 cut-off events. [2025-04-29 11:09:19,452 INFO L117 PetriNetUnfolderBase]: For 63013/63941 co-relation queries the response was YES. [2025-04-29 11:09:19,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60239 conditions, 17359 events. 4685/17359 cut-off events. For 63013/63941 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 186499 event pairs, 453 based on Foata normal form. 184/17331 useless extension candidates. Maximal degree in co-relation 59930. Up to 2755 conditions per place. [2025-04-29 11:09:19,650 INFO L140 encePairwiseOnDemand]: 126/142 looper letters, 192 selfloop transitions, 66 changer transitions 0/598 dead transitions. [2025-04-29 11:09:19,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 598 transitions, 6048 flow [2025-04-29 11:09:19,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1113 transitions. [2025-04-29 11:09:19,652 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8708920187793427 [2025-04-29 11:09:19,652 INFO L175 Difference]: Start difference. First operand has 368 places, 528 transitions, 4835 flow. Second operand 9 states and 1113 transitions. [2025-04-29 11:09:19,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 598 transitions, 6048 flow [2025-04-29 11:09:19,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 598 transitions, 5951 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-04-29 11:09:19,957 INFO L231 Difference]: Finished difference. Result has 375 places, 537 transitions, 5063 flow [2025-04-29 11:09:19,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=4747, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5063, PETRI_PLACES=375, PETRI_TRANSITIONS=537} [2025-04-29 11:09:19,957 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 233 predicate places. [2025-04-29 11:09:19,957 INFO L485 AbstractCegarLoop]: Abstraction has has 375 places, 537 transitions, 5063 flow [2025-04-29 11:09:19,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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:19,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:19,958 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:19,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:09:19,958 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:09:19,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:19,959 INFO L85 PathProgramCache]: Analyzing trace with hash -21158093, now seen corresponding path program 14 times [2025-04-29 11:09:19,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:19,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395950633] [2025-04-29 11:09:19,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:19,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:19,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-04-29 11:09:19,972 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:19,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:19,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:20,121 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:20,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:20,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395950633] [2025-04-29 11:09:20,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395950633] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:20,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:20,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056731304] [2025-04-29 11:09:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:20,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:09:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:20,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:09:20,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:09:20,749 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:09:20,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 537 transitions, 5063 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:20,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:09:20,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:23,554 INFO L116 PetriNetUnfolderBase]: 4684/17367 cut-off events. [2025-04-29 11:09:23,555 INFO L117 PetriNetUnfolderBase]: For 64142/65055 co-relation queries the response was YES. [2025-04-29 11:09:23,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60464 conditions, 17367 events. 4684/17367 cut-off events. For 64142/65055 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 186558 event pairs, 451 based on Foata normal form. 181/17334 useless extension candidates. Maximal degree in co-relation 60152. Up to 2755 conditions per place. [2025-04-29 11:09:23,699 INFO L140 encePairwiseOnDemand]: 127/142 looper letters, 202 selfloop transitions, 62 changer transitions 0/604 dead transitions. [2025-04-29 11:09:23,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 604 transitions, 6273 flow [2025-04-29 11:09:23,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1114 transitions. [2025-04-29 11:09:23,700 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8716744913928013 [2025-04-29 11:09:23,700 INFO L175 Difference]: Start difference. First operand has 375 places, 537 transitions, 5063 flow. Second operand 9 states and 1114 transitions. [2025-04-29 11:09:23,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 604 transitions, 6273 flow [2025-04-29 11:09:23,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 604 transitions, 6141 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:23,963 INFO L231 Difference]: Finished difference. Result has 382 places, 545 transitions, 5261 flow [2025-04-29 11:09:23,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=4939, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5261, PETRI_PLACES=382, PETRI_TRANSITIONS=545} [2025-04-29 11:09:23,963 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 240 predicate places. [2025-04-29 11:09:23,963 INFO L485 AbstractCegarLoop]: Abstraction has has 382 places, 545 transitions, 5261 flow [2025-04-29 11:09:23,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:23,964 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,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:09:23,964 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:09:23,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash -876993365, now seen corresponding path program 15 times [2025-04-29 11:09:23,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:23,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004762054] [2025-04-29 11:09:23,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:09:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:23,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 11 equivalence classes. [2025-04-29 11:09:23,976 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:23,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:09:23,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:24,073 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:24,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:24,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004762054] [2025-04-29 11:09:24,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004762054] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:24,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:24,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:09:24,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367063652] [2025-04-29 11:09:24,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:24,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:09:24,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:24,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:09:24,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:09:24,422 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 142 [2025-04-29 11:09:24,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 545 transitions, 5261 flow. Second operand has 9 states, 9 states have (on average 114.77777777777777) internal successors, (1033), 9 states have internal predecessors, (1033), 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:24,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:24,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 142 [2025-04-29 11:09:24,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand