./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.i --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/09-regions_19-nested_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:27:40,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:27:40,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:27:40,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:27:40,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:27:40,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:27:40,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:27:40,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:27:40,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:27:40,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:27:40,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:27:40,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:27:40,324 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:27:40,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:27:40,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:27:40,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:27:40,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:27:40,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:27:40,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:27:40,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:27:40,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:27:40,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:27:40,325 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:27:40,325 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:27:40,325 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:27:40,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:27:40,325 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:27:40,325 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:27:40,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:27:40,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:27:40,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:27:40,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:40,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:27:40,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:27:40,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:27:40,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:40,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:27:40,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:27:40,326 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:27:40,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:27:40,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:27:40,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:27:40,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:27:40,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:27:40,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:27:40,327 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 -> e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a [2025-04-30 10:27:40,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:27:40,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:27:40,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:27:40,545 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:27:40,545 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:27:40,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.i [2025-04-30 10:27:41,842 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56914b92f/c99ba13513da4613bf3329f81c106a72/FLAG2b51058d2 [2025-04-30 10:27:42,109 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:27:42,111 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_19-nested_nr.i [2025-04-30 10:27:42,129 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56914b92f/c99ba13513da4613bf3329f81c106a72/FLAG2b51058d2 [2025-04-30 10:27:42,843 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56914b92f/c99ba13513da4613bf3329f81c106a72 [2025-04-30 10:27:42,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:27:42,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:27:42,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:27:42,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:27:42,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:27:42,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:42,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308131ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:42, skipping insertion in model container [2025-04-30 10:27:42,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:27:42" (1/1) ... [2025-04-30 10:27:42,884 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:27:43,297 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:27:43,324 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:27:43,408 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:27:43,460 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:27:43,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43 WrapperNode [2025-04-30 10:27:43,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:27:43,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:27:43,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:27:43,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:27:43,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43" (1/1) ... [2025-04-30 10:27:43,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43" (1/1) ... [2025-04-30 10:27:43,515 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 292 [2025-04-30 10:27:43,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:27:43,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:27:43,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:27:43,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:27:43,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43" (1/1) ... [2025-04-30 10:27:43,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43" (1/1) ... [2025-04-30 10:27:43,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43" (1/1) ... [2025-04-30 10:27:43,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43" (1/1) ... [2025-04-30 10:27:43,545 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43" (1/1) ... [2025-04-30 10:27:43,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43" (1/1) ... [2025-04-30 10:27:43,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43" (1/1) ... [2025-04-30 10:27:43,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43" (1/1) ... [2025-04-30 10:27:43,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43" (1/1) ... [2025-04-30 10:27:43,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:27:43,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:27:43,562 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:27:43,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:27:43,563 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43" (1/1) ... [2025-04-30 10:27:43,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:43,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:43,586 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-30 10:27:43,588 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-30 10:27:43,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-30 10:27:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-30 10:27:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:27:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:27:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:27:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:27:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:27:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:27:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-30 10:27:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:27:43,605 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:27:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:27:43,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:27:43,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:27:43,606 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:27:43,725 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:27:43,727 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:27:44,150 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:27:44,150 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:27:44,165 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:27:44,165 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:27:44,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:27:44 BoogieIcfgContainer [2025-04-30 10:27:44,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:27:44,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:27:44,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:27:44,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:27:44,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:27:42" (1/3) ... [2025-04-30 10:27:44,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280b3766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:27:44, skipping insertion in model container [2025-04-30 10:27:44,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:27:43" (2/3) ... [2025-04-30 10:27:44,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280b3766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:27:44, skipping insertion in model container [2025-04-30 10:27:44,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:27:44" (3/3) ... [2025-04-30 10:27:44,174 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr.i [2025-04-30 10:27:44,183 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:27:44,186 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_19-nested_nr.i that has 2 procedures, 334 locations, 336 edges, 1 initial locations, 2 loop locations, and 18 error locations. [2025-04-30 10:27:44,186 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:27:44,251 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:27:44,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 337 places, 337 transitions, 678 flow [2025-04-30 10:27:44,394 INFO L116 PetriNetUnfolderBase]: 4/336 cut-off events. [2025-04-30 10:27:44,396 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:44,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 336 events. 4/336 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 398 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 208. Up to 2 conditions per place. [2025-04-30 10:27:44,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 337 places, 337 transitions, 678 flow [2025-04-30 10:27:44,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 336 places, 336 transitions, 675 flow [2025-04-30 10:27:44,416 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:27:44,428 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;@e10725, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:27:44,429 INFO L341 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-04-30 10:27:44,452 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:27:44,452 INFO L116 PetriNetUnfolderBase]: 3/129 cut-off events. [2025-04-30 10:27:44,452 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:44,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:44,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:44,453 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:44,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:44,458 INFO L85 PathProgramCache]: Analyzing trace with hash 106993482, now seen corresponding path program 1 times [2025-04-30 10:27:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:44,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586645503] [2025-04-30 10:27:44,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:44,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:44,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-04-30 10:27:44,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-04-30 10:27:44,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:44,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:44,805 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-30 10:27:44,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:44,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586645503] [2025-04-30 10:27:44,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586645503] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:44,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:44,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:27:44,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732260588] [2025-04-30 10:27:44,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:44,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:44,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:44,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:44,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:44,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 337 [2025-04-30 10:27:44,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 336 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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-30 10:27:44,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:44,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 337 [2025-04-30 10:27:44,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:44,948 INFO L116 PetriNetUnfolderBase]: 8/414 cut-off events. [2025-04-30 10:27:44,948 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:44,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 414 events. 8/414 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 869 event pairs, 6 based on Foata normal form. 5/388 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-04-30 10:27:44,952 INFO L140 encePairwiseOnDemand]: 332/337 looper letters, 10 selfloop transitions, 2 changer transitions 1/335 dead transitions. [2025-04-30 10:27:44,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 335 transitions, 697 flow [2025-04-30 10:27:44,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:44,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 987 transitions. [2025-04-30 10:27:44,993 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9762611275964391 [2025-04-30 10:27:44,994 INFO L175 Difference]: Start difference. First operand has 336 places, 336 transitions, 675 flow. Second operand 3 states and 987 transitions. [2025-04-30 10:27:44,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 335 transitions, 697 flow [2025-04-30 10:27:44,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 335 transitions, 696 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:45,006 INFO L231 Difference]: Finished difference. Result has 338 places, 334 transitions, 680 flow [2025-04-30 10:27:45,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=338, PETRI_TRANSITIONS=334} [2025-04-30 10:27:45,012 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 2 predicate places. [2025-04-30 10:27:45,013 INFO L485 AbstractCegarLoop]: Abstraction has has 338 places, 334 transitions, 680 flow [2025-04-30 10:27:45,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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-30 10:27:45,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:45,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:45,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:27:45,014 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:45,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:45,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1141151438, now seen corresponding path program 1 times [2025-04-30 10:27:45,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:45,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122098243] [2025-04-30 10:27:45,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:45,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:45,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-04-30 10:27:45,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-04-30 10:27:45,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:45,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:45,250 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-30 10:27:45,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:45,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122098243] [2025-04-30 10:27:45,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122098243] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:45,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034619611] [2025-04-30 10:27:45,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:45,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:45,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:45,252 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-30 10:27:45,254 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-30 10:27:45,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-04-30 10:27:45,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-04-30 10:27:45,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:45,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:45,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:27:45,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:45,422 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-30 10:27:45,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:45,461 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-30 10:27:45,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034619611] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:45,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:45,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:27:45,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180122510] [2025-04-30 10:27:45,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:45,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:45,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:45,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:45,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:45,496 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-04-30 10:27:45,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 334 transitions, 680 flow. Second operand has 10 states, 10 states have (on average 322.8) internal successors, (3228), 10 states have internal predecessors, (3228), 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-30 10:27:45,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:45,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-04-30 10:27:45,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:45,626 INFO L116 PetriNetUnfolderBase]: 8/420 cut-off events. [2025-04-30 10:27:45,626 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:45,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 420 events. 8/420 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 862 event pairs, 6 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 384. Up to 24 conditions per place. [2025-04-30 10:27:45,628 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 14 selfloop transitions, 9 changer transitions 0/342 dead transitions. [2025-04-30 10:27:45,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 342 transitions, 744 flow [2025-04-30 10:27:45,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2914 transitions. [2025-04-30 10:27:45,633 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9607649192218926 [2025-04-30 10:27:45,633 INFO L175 Difference]: Start difference. First operand has 338 places, 334 transitions, 680 flow. Second operand 9 states and 2914 transitions. [2025-04-30 10:27:45,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 342 transitions, 744 flow [2025-04-30 10:27:45,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 342 transitions, 742 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:45,644 INFO L231 Difference]: Finished difference. Result has 347 places, 340 transitions, 728 flow [2025-04-30 10:27:45,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=728, PETRI_PLACES=347, PETRI_TRANSITIONS=340} [2025-04-30 10:27:45,646 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 11 predicate places. [2025-04-30 10:27:45,646 INFO L485 AbstractCegarLoop]: Abstraction has has 347 places, 340 transitions, 728 flow [2025-04-30 10:27:45,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 322.8) internal successors, (3228), 10 states have internal predecessors, (3228), 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-30 10:27:45,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:45,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:45,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:27:45,850 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-30 10:27:45,850 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:45,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2066027598, now seen corresponding path program 2 times [2025-04-30 10:27:45,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:45,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971182165] [2025-04-30 10:27:45,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:45,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:45,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-04-30 10:27:45,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 112 statements. [2025-04-30 10:27:45,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:45,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:46,383 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-30 10:27:46,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:46,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971182165] [2025-04-30 10:27:46,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971182165] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:46,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:46,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:46,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30377028] [2025-04-30 10:27:46,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:46,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:46,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:46,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:46,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:46,860 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 337 [2025-04-30 10:27:46,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 340 transitions, 728 flow. Second operand has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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-30 10:27:46,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:46,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 337 [2025-04-30 10:27:46,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:47,212 INFO L116 PetriNetUnfolderBase]: 366/1704 cut-off events. [2025-04-30 10:27:47,213 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:27:47,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2546 conditions, 1704 events. 366/1704 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10127 event pairs, 364 based on Foata normal form. 0/1578 useless extension candidates. Maximal degree in co-relation 2435. Up to 800 conditions per place. [2025-04-30 10:27:47,223 INFO L140 encePairwiseOnDemand]: 325/337 looper letters, 71 selfloop transitions, 10 changer transitions 0/338 dead transitions. [2025-04-30 10:27:47,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 338 transitions, 886 flow [2025-04-30 10:27:47,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1595 transitions. [2025-04-30 10:27:47,229 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7888229475766568 [2025-04-30 10:27:47,229 INFO L175 Difference]: Start difference. First operand has 347 places, 340 transitions, 728 flow. Second operand 6 states and 1595 transitions. [2025-04-30 10:27:47,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 338 transitions, 886 flow [2025-04-30 10:27:47,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 338 transitions, 880 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:47,235 INFO L231 Difference]: Finished difference. Result has 349 places, 338 transitions, 738 flow [2025-04-30 10:27:47,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=738, PETRI_PLACES=349, PETRI_TRANSITIONS=338} [2025-04-30 10:27:47,237 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 13 predicate places. [2025-04-30 10:27:47,237 INFO L485 AbstractCegarLoop]: Abstraction has has 349 places, 338 transitions, 738 flow [2025-04-30 10:27:47,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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-30 10:27:47,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:47,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:47,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:27:47,238 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:47,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:47,239 INFO L85 PathProgramCache]: Analyzing trace with hash 291569409, now seen corresponding path program 1 times [2025-04-30 10:27:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:47,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16719332] [2025-04-30 10:27:47,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:47,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:47,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-04-30 10:27:47,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-04-30 10:27:47,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:47,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:47,308 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-30 10:27:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:47,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16719332] [2025-04-30 10:27:47,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16719332] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:47,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:47,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:27:47,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144499600] [2025-04-30 10:27:47,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:47,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:47,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:47,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:47,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:47,342 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 337 [2025-04-30 10:27:47,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 338 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 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-30 10:27:47,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:47,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 337 [2025-04-30 10:27:47,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:47,398 INFO L116 PetriNetUnfolderBase]: 8/529 cut-off events. [2025-04-30 10:27:47,399 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:27:47,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 529 events. 8/529 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 860 event pairs, 6 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 494. Up to 24 conditions per place. [2025-04-30 10:27:47,401 INFO L140 encePairwiseOnDemand]: 334/337 looper letters, 10 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2025-04-30 10:27:47,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 339 transitions, 764 flow [2025-04-30 10:27:47,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2025-04-30 10:27:47,404 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9742828882294757 [2025-04-30 10:27:47,404 INFO L175 Difference]: Start difference. First operand has 349 places, 338 transitions, 738 flow. Second operand 3 states and 985 transitions. [2025-04-30 10:27:47,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 339 transitions, 764 flow [2025-04-30 10:27:47,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 339 transitions, 744 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:47,409 INFO L231 Difference]: Finished difference. Result has 347 places, 339 transitions, 730 flow [2025-04-30 10:27:47,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=347, PETRI_TRANSITIONS=339} [2025-04-30 10:27:47,411 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 11 predicate places. [2025-04-30 10:27:47,411 INFO L485 AbstractCegarLoop]: Abstraction has has 347 places, 339 transitions, 730 flow [2025-04-30 10:27:47,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 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-30 10:27:47,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:47,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:47,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:27:47,412 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:47,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:47,413 INFO L85 PathProgramCache]: Analyzing trace with hash 681722666, now seen corresponding path program 1 times [2025-04-30 10:27:47,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:47,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300005635] [2025-04-30 10:27:47,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:47,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:47,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-04-30 10:27:47,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-04-30 10:27:47,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:47,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:47,589 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-30 10:27:47,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:47,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300005635] [2025-04-30 10:27:47,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300005635] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:47,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526014142] [2025-04-30 10:27:47,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:47,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:47,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:47,593 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-30 10:27:47,595 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-30 10:27:47,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-04-30 10:27:47,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-04-30 10:27:47,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:47,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:47,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:27:47,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:47,737 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-30 10:27:47,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:47,825 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-30 10:27:47,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526014142] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:47,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:47,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-30 10:27:47,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000872097] [2025-04-30 10:27:47,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:47,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:27:47,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:47,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:27:47,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:27:47,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-04-30 10:27:47,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 339 transitions, 730 flow. Second operand has 18 states, 18 states have (on average 322.8888888888889) internal successors, (5812), 18 states have internal predecessors, (5812), 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-30 10:27:47,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:47,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-04-30 10:27:47,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:48,094 INFO L116 PetriNetUnfolderBase]: 8/549 cut-off events. [2025-04-30 10:27:48,095 INFO L117 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-04-30 10:27:48,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 549 events. 8/549 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 861 event pairs, 6 based on Foata normal form. 4/519 useless extension candidates. Maximal degree in co-relation 476. Up to 24 conditions per place. [2025-04-30 10:27:48,098 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 18 selfloop transitions, 21 changer transitions 0/357 dead transitions. [2025-04-30 10:27:48,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 357 transitions, 896 flow [2025-04-30 10:27:48,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:27:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:27:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6784 transitions. [2025-04-30 10:27:48,107 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9585982761056945 [2025-04-30 10:27:48,108 INFO L175 Difference]: Start difference. First operand has 347 places, 339 transitions, 730 flow. Second operand 21 states and 6784 transitions. [2025-04-30 10:27:48,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 357 transitions, 896 flow [2025-04-30 10:27:48,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 357 transitions, 894 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:48,113 INFO L231 Difference]: Finished difference. Result has 371 places, 352 transitions, 858 flow [2025-04-30 10:27:48,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=858, PETRI_PLACES=371, PETRI_TRANSITIONS=352} [2025-04-30 10:27:48,115 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 35 predicate places. [2025-04-30 10:27:48,115 INFO L485 AbstractCegarLoop]: Abstraction has has 371 places, 352 transitions, 858 flow [2025-04-30 10:27:48,118 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 322.8888888888889) internal successors, (5812), 18 states have internal predecessors, (5812), 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-30 10:27:48,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:48,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:48,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:27:48,320 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:48,320 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:48,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:48,321 INFO L85 PathProgramCache]: Analyzing trace with hash -799826390, now seen corresponding path program 2 times [2025-04-30 10:27:48,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:48,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493554987] [2025-04-30 10:27:48,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:48,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:48,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes. [2025-04-30 10:27:48,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 105 of 140 statements. [2025-04-30 10:27:48,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:48,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:48,646 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-30 10:27:48,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:48,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493554987] [2025-04-30 10:27:48,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493554987] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:48,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:48,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:48,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276119989] [2025-04-30 10:27:48,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:48,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:48,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:48,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:48,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:49,023 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 337 [2025-04-30 10:27:49,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 352 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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-30 10:27:49,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:49,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 337 [2025-04-30 10:27:49,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:49,356 INFO L116 PetriNetUnfolderBase]: 366/1831 cut-off events. [2025-04-30 10:27:49,356 INFO L117 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-04-30 10:27:49,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 1831 events. 366/1831 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10073 event pairs, 364 based on Foata normal form. 0/1703 useless extension candidates. Maximal degree in co-relation 2590. Up to 830 conditions per place. [2025-04-30 10:27:49,365 INFO L140 encePairwiseOnDemand]: 325/337 looper letters, 71 selfloop transitions, 10 changer transitions 0/350 dead transitions. [2025-04-30 10:27:49,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 350 transitions, 1016 flow [2025-04-30 10:27:49,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1595 transitions. [2025-04-30 10:27:49,369 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7888229475766568 [2025-04-30 10:27:49,369 INFO L175 Difference]: Start difference. First operand has 371 places, 352 transitions, 858 flow. Second operand 6 states and 1595 transitions. [2025-04-30 10:27:49,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 350 transitions, 1016 flow [2025-04-30 10:27:49,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 350 transitions, 992 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:27:49,375 INFO L231 Difference]: Finished difference. Result has 368 places, 350 transitions, 850 flow [2025-04-30 10:27:49,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=850, PETRI_PLACES=368, PETRI_TRANSITIONS=350} [2025-04-30 10:27:49,376 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 32 predicate places. [2025-04-30 10:27:49,376 INFO L485 AbstractCegarLoop]: Abstraction has has 368 places, 350 transitions, 850 flow [2025-04-30 10:27:49,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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-30 10:27:49,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:49,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:49,377 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:27:49,377 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:49,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:49,378 INFO L85 PathProgramCache]: Analyzing trace with hash -183571133, now seen corresponding path program 1 times [2025-04-30 10:27:49,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:49,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469891710] [2025-04-30 10:27:49,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:49,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:49,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-04-30 10:27:49,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-04-30 10:27:49,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:49,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:49,667 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-30 10:27:49,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:49,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469891710] [2025-04-30 10:27:49,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469891710] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:49,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312665] [2025-04-30 10:27:49,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:49,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:49,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:49,670 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-30 10:27:49,671 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-30 10:27:49,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-04-30 10:27:49,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-04-30 10:27:49,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:49,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:49,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:27:49,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:49,857 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-30 10:27:49,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:50,050 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-30 10:27:50,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312665] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:50,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:50,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-30 10:27:50,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291673259] [2025-04-30 10:27:50,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:50,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:27:50,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:50,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:27:50,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:27:50,081 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-04-30 10:27:50,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 350 transitions, 850 flow. Second operand has 23 states, 23 states have (on average 323.0) internal successors, (7429), 23 states have internal predecessors, (7429), 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-30 10:27:50,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:50,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-04-30 10:27:50,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:50,433 INFO L116 PetriNetUnfolderBase]: 8/560 cut-off events. [2025-04-30 10:27:50,433 INFO L117 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-04-30 10:27:50,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 560 events. 8/560 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 851 event pairs, 6 based on Foata normal form. 3/533 useless extension candidates. Maximal degree in co-relation 498. Up to 24 conditions per place. [2025-04-30 10:27:50,435 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 21 selfloop transitions, 30 changer transitions 0/367 dead transitions. [2025-04-30 10:27:50,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 367 transitions, 1074 flow [2025-04-30 10:27:50,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:27:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-30 10:27:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9684 transitions. [2025-04-30 10:27:50,452 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9578635014836795 [2025-04-30 10:27:50,452 INFO L175 Difference]: Start difference. First operand has 368 places, 350 transitions, 850 flow. Second operand 30 states and 9684 transitions. [2025-04-30 10:27:50,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 367 transitions, 1074 flow [2025-04-30 10:27:50,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 367 transitions, 1054 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:50,459 INFO L231 Difference]: Finished difference. Result has 396 places, 360 transitions, 982 flow [2025-04-30 10:27:50,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=982, PETRI_PLACES=396, PETRI_TRANSITIONS=360} [2025-04-30 10:27:50,460 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 60 predicate places. [2025-04-30 10:27:50,460 INFO L485 AbstractCegarLoop]: Abstraction has has 396 places, 360 transitions, 982 flow [2025-04-30 10:27:50,463 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 323.0) internal successors, (7429), 23 states have internal predecessors, (7429), 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-30 10:27:50,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:50,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:50,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:27:50,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:50,668 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:50,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:50,669 INFO L85 PathProgramCache]: Analyzing trace with hash -15000641, now seen corresponding path program 2 times [2025-04-30 10:27:50,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:50,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076920132] [2025-04-30 10:27:50,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:50,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:50,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 167 statements into 2 equivalence classes. [2025-04-30 10:27:50,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 117 of 167 statements. [2025-04-30 10:27:50,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:50,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:50,991 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-30 10:27:50,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:50,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076920132] [2025-04-30 10:27:50,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076920132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:50,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:50,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:50,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062971213] [2025-04-30 10:27:50,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:50,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:50,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:50,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:50,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:51,506 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 337 [2025-04-30 10:27:51,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 360 transitions, 982 flow. Second operand has 6 states, 6 states have (on average 249.83333333333334) internal successors, (1499), 6 states have internal predecessors, (1499), 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-30 10:27:51,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:51,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 337 [2025-04-30 10:27:51,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:51,773 INFO L116 PetriNetUnfolderBase]: 392/1933 cut-off events. [2025-04-30 10:27:51,774 INFO L117 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-04-30 10:27:51,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3010 conditions, 1933 events. 392/1933 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10877 event pairs, 390 based on Foata normal form. 0/1802 useless extension candidates. Maximal degree in co-relation 2740. Up to 899 conditions per place. [2025-04-30 10:27:51,781 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 83 selfloop transitions, 5 changer transitions 0/359 dead transitions. [2025-04-30 10:27:51,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 359 transitions, 1156 flow [2025-04-30 10:27:51,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1570 transitions. [2025-04-30 10:27:51,784 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7764589515331355 [2025-04-30 10:27:51,784 INFO L175 Difference]: Start difference. First operand has 396 places, 360 transitions, 982 flow. Second operand 6 states and 1570 transitions. [2025-04-30 10:27:51,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 359 transitions, 1156 flow [2025-04-30 10:27:51,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 359 transitions, 1110 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-30 10:27:51,790 INFO L231 Difference]: Finished difference. Result has 382 places, 359 transitions, 944 flow [2025-04-30 10:27:51,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=944, PETRI_PLACES=382, PETRI_TRANSITIONS=359} [2025-04-30 10:27:51,793 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 46 predicate places. [2025-04-30 10:27:51,793 INFO L485 AbstractCegarLoop]: Abstraction has has 382 places, 359 transitions, 944 flow [2025-04-30 10:27:51,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 249.83333333333334) internal successors, (1499), 6 states have internal predecessors, (1499), 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-30 10:27:51,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:51,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:51,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:27:51,794 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:51,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:51,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1003869220, now seen corresponding path program 1 times [2025-04-30 10:27:51,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:51,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609959349] [2025-04-30 10:27:51,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:51,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:51,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-04-30 10:27:51,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-04-30 10:27:51,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:51,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:52,282 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-30 10:27:52,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:52,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609959349] [2025-04-30 10:27:52,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609959349] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:52,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:52,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:52,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934872850] [2025-04-30 10:27:52,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:52,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:52,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:52,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:52,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:52,933 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 337 [2025-04-30 10:27:52,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 359 transitions, 944 flow. Second operand has 6 states, 6 states have (on average 277.8333333333333) internal successors, (1667), 6 states have internal predecessors, (1667), 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-30 10:27:52,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:52,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 337 [2025-04-30 10:27:52,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:53,068 INFO L116 PetriNetUnfolderBase]: 56/799 cut-off events. [2025-04-30 10:27:53,068 INFO L117 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-04-30 10:27:53,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 799 events. 56/799 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2628 event pairs, 54 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 911. Up to 195 conditions per place. [2025-04-30 10:27:53,072 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 57 selfloop transitions, 5 changer transitions 0/358 dead transitions. [2025-04-30 10:27:53,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 358 transitions, 1066 flow [2025-04-30 10:27:53,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1700 transitions. [2025-04-30 10:27:53,075 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8407517309594461 [2025-04-30 10:27:53,075 INFO L175 Difference]: Start difference. First operand has 382 places, 359 transitions, 944 flow. Second operand 6 states and 1700 transitions. [2025-04-30 10:27:53,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 358 transitions, 1066 flow [2025-04-30 10:27:53,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 358 transitions, 1056 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:53,080 INFO L231 Difference]: Finished difference. Result has 381 places, 358 transitions, 942 flow [2025-04-30 10:27:53,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=381, PETRI_TRANSITIONS=358} [2025-04-30 10:27:53,081 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 45 predicate places. [2025-04-30 10:27:53,081 INFO L485 AbstractCegarLoop]: Abstraction has has 381 places, 358 transitions, 942 flow [2025-04-30 10:27:53,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 277.8333333333333) internal successors, (1667), 6 states have internal predecessors, (1667), 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-30 10:27:53,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:53,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:53,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:27:53,082 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:53,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:53,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1238634258, now seen corresponding path program 1 times [2025-04-30 10:27:53,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:53,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457476310] [2025-04-30 10:27:53,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:53,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:53,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-04-30 10:27:53,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-04-30 10:27:53,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:53,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:53,476 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-30 10:27:53,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:53,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457476310] [2025-04-30 10:27:53,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457476310] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:53,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:53,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:53,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243494683] [2025-04-30 10:27:53,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:53,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:53,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:53,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:53,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:53,850 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-04-30 10:27:53,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 358 transitions, 942 flow. Second operand has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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-30 10:27:53,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:53,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-04-30 10:27:53,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:53,932 INFO L116 PetriNetUnfolderBase]: 38/714 cut-off events. [2025-04-30 10:27:53,932 INFO L117 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-04-30 10:27:53,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 714 events. 38/714 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2100 event pairs, 36 based on Foata normal form. 0/675 useless extension candidates. Maximal degree in co-relation 791. Up to 158 conditions per place. [2025-04-30 10:27:53,935 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 53 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2025-04-30 10:27:53,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 357 transitions, 1056 flow [2025-04-30 10:27:53,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1715 transitions. [2025-04-30 10:27:53,937 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8481701285855588 [2025-04-30 10:27:53,937 INFO L175 Difference]: Start difference. First operand has 381 places, 358 transitions, 942 flow. Second operand 6 states and 1715 transitions. [2025-04-30 10:27:53,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 357 transitions, 1056 flow [2025-04-30 10:27:53,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 357 transitions, 1046 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:53,943 INFO L231 Difference]: Finished difference. Result has 380 places, 357 transitions, 940 flow [2025-04-30 10:27:53,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=940, PETRI_PLACES=380, PETRI_TRANSITIONS=357} [2025-04-30 10:27:53,945 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 44 predicate places. [2025-04-30 10:27:53,945 INFO L485 AbstractCegarLoop]: Abstraction has has 380 places, 357 transitions, 940 flow [2025-04-30 10:27:53,945 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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-30 10:27:53,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:53,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:53,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:27:53,946 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:53,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:53,947 INFO L85 PathProgramCache]: Analyzing trace with hash -142078714, now seen corresponding path program 1 times [2025-04-30 10:27:53,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:53,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523950880] [2025-04-30 10:27:53,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:53,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:53,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-04-30 10:27:53,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-04-30 10:27:53,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:53,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:54,371 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-30 10:27:54,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:54,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523950880] [2025-04-30 10:27:54,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523950880] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:54,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:54,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:54,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779500588] [2025-04-30 10:27:54,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:54,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:54,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:54,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:54,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:54,600 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 337 [2025-04-30 10:27:54,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 357 transitions, 940 flow. Second operand has 6 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 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-30 10:27:54,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:54,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 337 [2025-04-30 10:27:54,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:54,797 INFO L116 PetriNetUnfolderBase]: 366/1838 cut-off events. [2025-04-30 10:27:54,797 INFO L117 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-04-30 10:27:54,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 1838 events. 366/1838 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10038 event pairs, 364 based on Foata normal form. 0/1718 useless extension candidates. Maximal degree in co-relation 2603. Up to 846 conditions per place. [2025-04-30 10:27:54,805 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 79 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-04-30 10:27:54,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 356 transitions, 1106 flow [2025-04-30 10:27:54,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1585 transitions. [2025-04-30 10:27:54,810 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7838773491592482 [2025-04-30 10:27:54,810 INFO L175 Difference]: Start difference. First operand has 380 places, 357 transitions, 940 flow. Second operand 6 states and 1585 transitions. [2025-04-30 10:27:54,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 356 transitions, 1106 flow [2025-04-30 10:27:54,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 356 transitions, 1096 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:54,817 INFO L231 Difference]: Finished difference. Result has 379 places, 356 transitions, 938 flow [2025-04-30 10:27:54,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=938, PETRI_PLACES=379, PETRI_TRANSITIONS=356} [2025-04-30 10:27:54,818 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 43 predicate places. [2025-04-30 10:27:54,819 INFO L485 AbstractCegarLoop]: Abstraction has has 379 places, 356 transitions, 938 flow [2025-04-30 10:27:54,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 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-30 10:27:54,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:54,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:54,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:27:54,820 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:54,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:54,821 INFO L85 PathProgramCache]: Analyzing trace with hash -48707043, now seen corresponding path program 1 times [2025-04-30 10:27:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:54,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933466711] [2025-04-30 10:27:54,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:54,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:54,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-04-30 10:27:54,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-04-30 10:27:54,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:54,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-04-30 10:27:55,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:55,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933466711] [2025-04-30 10:27:55,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933466711] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:55,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:55,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:55,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989234475] [2025-04-30 10:27:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:55,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:55,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:55,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:55,476 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 337 [2025-04-30 10:27:55,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 356 transitions, 938 flow. Second operand has 6 states, 6 states have (on average 257.6666666666667) internal successors, (1546), 6 states have internal predecessors, (1546), 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-30 10:27:55,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:55,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 337 [2025-04-30 10:27:55,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:55,675 INFO L116 PetriNetUnfolderBase]: 366/1836 cut-off events. [2025-04-30 10:27:55,675 INFO L117 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-04-30 10:27:55,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2846 conditions, 1836 events. 366/1836 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10063 event pairs, 364 based on Foata normal form. 0/1718 useless extension candidates. Maximal degree in co-relation 2599. Up to 844 conditions per place. [2025-04-30 10:27:55,684 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 78 selfloop transitions, 5 changer transitions 0/355 dead transitions. [2025-04-30 10:27:55,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 355 transitions, 1102 flow [2025-04-30 10:27:55,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1590 transitions. [2025-04-30 10:27:55,685 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7863501483679525 [2025-04-30 10:27:55,685 INFO L175 Difference]: Start difference. First operand has 379 places, 356 transitions, 938 flow. Second operand 6 states and 1590 transitions. [2025-04-30 10:27:55,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 355 transitions, 1102 flow [2025-04-30 10:27:55,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 355 transitions, 1092 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:55,691 INFO L231 Difference]: Finished difference. Result has 378 places, 355 transitions, 936 flow [2025-04-30 10:27:55,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=936, PETRI_PLACES=378, PETRI_TRANSITIONS=355} [2025-04-30 10:27:55,693 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 42 predicate places. [2025-04-30 10:27:55,693 INFO L485 AbstractCegarLoop]: Abstraction has has 378 places, 355 transitions, 936 flow [2025-04-30 10:27:55,693 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.6666666666667) internal successors, (1546), 6 states have internal predecessors, (1546), 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-30 10:27:55,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:55,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:55,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:27:55,694 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:55,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:55,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1583322363, now seen corresponding path program 1 times [2025-04-30 10:27:55,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:55,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079878643] [2025-04-30 10:27:55,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:55,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:55,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-04-30 10:27:55,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-04-30 10:27:55,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:55,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:55,829 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-04-30 10:27:55,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:55,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079878643] [2025-04-30 10:27:55,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079878643] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:55,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395210064] [2025-04-30 10:27:55,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:55,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:55,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:55,832 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-30 10:27:55,833 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-30 10:27:55,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-04-30 10:27:56,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-04-30 10:27:56,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:56,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:56,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:27:56,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:56,202 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-04-30 10:27:56,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-04-30 10:27:56,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395210064] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:56,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:56,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:27:56,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295466798] [2025-04-30 10:27:56,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:56,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:56,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:56,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:56,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:56,440 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-04-30 10:27:56,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 355 transitions, 936 flow. Second operand has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 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-30 10:27:56,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:56,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-04-30 10:27:56,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:56,567 INFO L116 PetriNetUnfolderBase]: 8/657 cut-off events. [2025-04-30 10:27:56,567 INFO L117 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-04-30 10:27:56,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 657 events. 8/657 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 389 event pairs, 6 based on Foata normal form. 2/639 useless extension candidates. Maximal degree in co-relation 607. Up to 24 conditions per place. [2025-04-30 10:27:56,569 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 14 selfloop transitions, 9 changer transitions 0/363 dead transitions. [2025-04-30 10:27:56,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 363 transitions, 1000 flow [2025-04-30 10:27:56,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2914 transitions. [2025-04-30 10:27:56,572 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9607649192218926 [2025-04-30 10:27:56,573 INFO L175 Difference]: Start difference. First operand has 378 places, 355 transitions, 936 flow. Second operand 9 states and 2914 transitions. [2025-04-30 10:27:56,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 363 transitions, 1000 flow [2025-04-30 10:27:56,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 363 transitions, 990 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:56,579 INFO L231 Difference]: Finished difference. Result has 384 places, 361 transitions, 976 flow [2025-04-30 10:27:56,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=976, PETRI_PLACES=384, PETRI_TRANSITIONS=361} [2025-04-30 10:27:56,580 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 48 predicate places. [2025-04-30 10:27:56,580 INFO L485 AbstractCegarLoop]: Abstraction has has 384 places, 361 transitions, 976 flow [2025-04-30 10:27:56,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 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-30 10:27:56,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:56,582 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:56,596 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-30 10:27:56,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:56,782 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:56,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:56,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2121428933, now seen corresponding path program 2 times [2025-04-30 10:27:56,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:56,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565119033] [2025-04-30 10:27:56,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:56,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:56,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 463 statements into 2 equivalence classes. [2025-04-30 10:27:56,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 463 statements. [2025-04-30 10:27:56,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:56,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-04-30 10:27:56,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:56,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565119033] [2025-04-30 10:27:56,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565119033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:56,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:56,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:56,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354235916] [2025-04-30 10:27:56,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:56,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:56,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:56,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:56,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:57,545 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-04-30 10:27:57,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 361 transitions, 976 flow. Second operand has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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-30 10:27:57,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:57,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-04-30 10:27:57,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:57,990 INFO L116 PetriNetUnfolderBase]: 258/1984 cut-off events. [2025-04-30 10:27:57,990 INFO L117 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-04-30 10:27:57,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 1984 events. 258/1984 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10265 event pairs, 36 based on Foata normal form. 0/1858 useless extension candidates. Maximal degree in co-relation 2536. Up to 491 conditions per place. [2025-04-30 10:27:57,999 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 67 selfloop transitions, 70 changer transitions 0/439 dead transitions. [2025-04-30 10:27:58,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 439 transitions, 1406 flow [2025-04-30 10:27:58,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:58,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1794 transitions. [2025-04-30 10:27:58,001 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.887240356083086 [2025-04-30 10:27:58,001 INFO L175 Difference]: Start difference. First operand has 384 places, 361 transitions, 976 flow. Second operand 6 states and 1794 transitions. [2025-04-30 10:27:58,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 439 transitions, 1406 flow [2025-04-30 10:27:58,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 439 transitions, 1400 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:58,009 INFO L231 Difference]: Finished difference. Result has 393 places, 430 transitions, 1432 flow [2025-04-30 10:27:58,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1432, PETRI_PLACES=393, PETRI_TRANSITIONS=430} [2025-04-30 10:27:58,010 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 57 predicate places. [2025-04-30 10:27:58,010 INFO L485 AbstractCegarLoop]: Abstraction has has 393 places, 430 transitions, 1432 flow [2025-04-30 10:27:58,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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-30 10:27:58,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:58,011 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:58,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:27:58,011 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:58,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1412189735, now seen corresponding path program 1 times [2025-04-30 10:27:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:58,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959716188] [2025-04-30 10:27:58,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:58,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-04-30 10:27:58,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-04-30 10:27:58,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:58,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-04-30 10:27:58,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:58,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959716188] [2025-04-30 10:27:58,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959716188] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:58,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563779131] [2025-04-30 10:27:58,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:58,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:58,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:58,382 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-30 10:27:58,384 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-30 10:27:58,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-04-30 10:27:58,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-04-30 10:27:58,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:58,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:58,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:27:58,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-04-30 10:27:58,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-04-30 10:27:59,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563779131] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:59,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:59,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-30 10:27:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67047689] [2025-04-30 10:27:59,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:59,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:27:59,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:59,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:27:59,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:27:59,434 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-04-30 10:27:59,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 430 transitions, 1432 flow. Second operand has 18 states, 18 states have (on average 323.0) internal successors, (5814), 18 states have internal predecessors, (5814), 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-30 10:27:59,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:59,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-04-30 10:27:59,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:59,852 INFO L116 PetriNetUnfolderBase]: 166/2109 cut-off events. [2025-04-30 10:27:59,852 INFO L117 PetriNetUnfolderBase]: For 309/316 co-relation queries the response was YES. [2025-04-30 10:27:59,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 2109 events. 166/2109 cut-off events. For 309/316 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7473 event pairs, 23 based on Foata normal form. 4/2027 useless extension candidates. Maximal degree in co-relation 2731. Up to 207 conditions per place. [2025-04-30 10:27:59,860 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 19 selfloop transitions, 21 changer transitions 0/448 dead transitions. [2025-04-30 10:27:59,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 448 transitions, 1600 flow [2025-04-30 10:27:59,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:27:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:27:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6784 transitions. [2025-04-30 10:27:59,864 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9585982761056945 [2025-04-30 10:27:59,864 INFO L175 Difference]: Start difference. First operand has 393 places, 430 transitions, 1432 flow. Second operand 21 states and 6784 transitions. [2025-04-30 10:27:59,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 448 transitions, 1600 flow [2025-04-30 10:27:59,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 448 transitions, 1600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:59,871 INFO L231 Difference]: Finished difference. Result has 418 places, 443 transitions, 1562 flow [2025-04-30 10:27:59,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1562, PETRI_PLACES=418, PETRI_TRANSITIONS=443} [2025-04-30 10:27:59,872 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 82 predicate places. [2025-04-30 10:27:59,872 INFO L485 AbstractCegarLoop]: Abstraction has has 418 places, 443 transitions, 1562 flow [2025-04-30 10:27:59,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 323.0) internal successors, (5814), 18 states have internal predecessors, (5814), 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-30 10:27:59,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:59,874 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:27:59,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:28:00,074 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,SelfDestructingSolverStorable14 [2025-04-30 10:28:00,075 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:00,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1854043303, now seen corresponding path program 2 times [2025-04-30 10:28:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:00,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551729327] [2025-04-30 10:28:00,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:28:00,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:00,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 889 statements into 2 equivalence classes. [2025-04-30 10:28:00,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 889 statements. [2025-04-30 10:28:00,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:28:00,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3182 trivial. 0 not checked. [2025-04-30 10:28:00,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:00,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551729327] [2025-04-30 10:28:00,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551729327] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:00,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:00,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:00,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149186897] [2025-04-30 10:28:00,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:00,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:00,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:00,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:00,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:00,602 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-04-30 10:28:00,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 443 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 282.1666666666667) internal successors, (1693), 6 states have internal predecessors, (1693), 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-30 10:28:00,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:00,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-04-30 10:28:00,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:01,362 INFO L116 PetriNetUnfolderBase]: 531/3178 cut-off events. [2025-04-30 10:28:01,362 INFO L117 PetriNetUnfolderBase]: For 966/1050 co-relation queries the response was YES. [2025-04-30 10:28:01,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5624 conditions, 3178 events. 531/3178 cut-off events. For 966/1050 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16143 event pairs, 93 based on Foata normal form. 16/3029 useless extension candidates. Maximal degree in co-relation 5364. Up to 981 conditions per place. [2025-04-30 10:28:01,376 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 131 selfloop transitions, 130 changer transitions 0/580 dead transitions. [2025-04-30 10:28:01,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 580 transitions, 2734 flow [2025-04-30 10:28:01,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:01,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1793 transitions. [2025-04-30 10:28:01,378 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8867457962413452 [2025-04-30 10:28:01,378 INFO L175 Difference]: Start difference. First operand has 418 places, 443 transitions, 1562 flow. Second operand 6 states and 1793 transitions. [2025-04-30 10:28:01,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 580 transitions, 2734 flow [2025-04-30 10:28:01,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 580 transitions, 2710 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:28:01,388 INFO L231 Difference]: Finished difference. Result has 422 places, 572 transitions, 2766 flow [2025-04-30 10:28:01,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2766, PETRI_PLACES=422, PETRI_TRANSITIONS=572} [2025-04-30 10:28:01,389 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 86 predicate places. [2025-04-30 10:28:01,389 INFO L485 AbstractCegarLoop]: Abstraction has has 422 places, 572 transitions, 2766 flow [2025-04-30 10:28:01,389 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.1666666666667) internal successors, (1693), 6 states have internal predecessors, (1693), 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-30 10:28:01,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:01,390 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:28:01,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:28:01,390 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:01,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:01,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1633501827, now seen corresponding path program 1 times [2025-04-30 10:28:01,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:01,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422374241] [2025-04-30 10:28:01,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:01,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:01,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 899 statements into 1 equivalence classes. [2025-04-30 10:28:01,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 899 of 899 statements. [2025-04-30 10:28:01,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:01,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-04-30 10:28:02,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:02,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422374241] [2025-04-30 10:28:02,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422374241] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:02,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87371798] [2025-04-30 10:28:02,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:02,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:02,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:02,634 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-30 10:28:02,635 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-30 10:28:02,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 899 statements into 1 equivalence classes. [2025-04-30 10:28:03,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 899 of 899 statements. [2025-04-30 10:28:03,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:03,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:03,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 3333 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:28:03,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-04-30 10:28:03,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:28:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-04-30 10:28:04,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87371798] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:28:04,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:28:04,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-30 10:28:04,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894669189] [2025-04-30 10:28:04,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:28:04,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:28:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:04,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:28:04,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:28:04,745 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-04-30 10:28:04,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 572 transitions, 2766 flow. Second operand has 23 states, 23 states have (on average 323.0869565217391) internal successors, (7431), 23 states have internal predecessors, (7431), 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-30 10:28:04,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:04,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-04-30 10:28:04,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:05,687 INFO L116 PetriNetUnfolderBase]: 413/3183 cut-off events. [2025-04-30 10:28:05,688 INFO L117 PetriNetUnfolderBase]: For 1293/1328 co-relation queries the response was YES. [2025-04-30 10:28:05,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5527 conditions, 3183 events. 413/3183 cut-off events. For 1293/1328 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13450 event pairs, 39 based on Foata normal form. 7/3082 useless extension candidates. Maximal degree in co-relation 5262. Up to 468 conditions per place. [2025-04-30 10:28:05,700 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 22 selfloop transitions, 30 changer transitions 0/589 dead transitions. [2025-04-30 10:28:05,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 589 transitions, 2992 flow [2025-04-30 10:28:05,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:28:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-30 10:28:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9684 transitions. [2025-04-30 10:28:05,705 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9578635014836795 [2025-04-30 10:28:05,705 INFO L175 Difference]: Start difference. First operand has 422 places, 572 transitions, 2766 flow. Second operand 30 states and 9684 transitions. [2025-04-30 10:28:05,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 589 transitions, 2992 flow [2025-04-30 10:28:05,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 589 transitions, 2992 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:05,717 INFO L231 Difference]: Finished difference. Result has 455 places, 582 transitions, 2918 flow [2025-04-30 10:28:05,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=2766, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2918, PETRI_PLACES=455, PETRI_TRANSITIONS=582} [2025-04-30 10:28:05,718 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 119 predicate places. [2025-04-30 10:28:05,718 INFO L485 AbstractCegarLoop]: Abstraction has has 455 places, 582 transitions, 2918 flow [2025-04-30 10:28:05,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 323.0869565217391) internal successors, (7431), 23 states have internal predecessors, (7431), 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-30 10:28:05,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:05,720 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:28:05,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:28:05,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-30 10:28:05,921 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:05,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash 254546311, now seen corresponding path program 2 times [2025-04-30 10:28:05,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:05,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334172711] [2025-04-30 10:28:05,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:28:05,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:06,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1214 statements into 2 equivalence classes. [2025-04-30 10:28:06,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 1214 statements. [2025-04-30 10:28:06,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:28:06,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6470 trivial. 0 not checked. [2025-04-30 10:28:06,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:06,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334172711] [2025-04-30 10:28:06,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334172711] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:06,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:06,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:06,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885226278] [2025-04-30 10:28:06,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:06,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:06,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:06,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:06,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:06,514 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-04-30 10:28:06,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 582 transitions, 2918 flow. Second operand has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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-30 10:28:06,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:06,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-04-30 10:28:06,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:07,615 INFO L116 PetriNetUnfolderBase]: 807/4259 cut-off events. [2025-04-30 10:28:07,615 INFO L117 PetriNetUnfolderBase]: For 3407/3642 co-relation queries the response was YES. [2025-04-30 10:28:07,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8971 conditions, 4259 events. 807/4259 cut-off events. For 3407/3642 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22410 event pairs, 74 based on Foata normal form. 76/4160 useless extension candidates. Maximal degree in co-relation 8702. Up to 1323 conditions per place. [2025-04-30 10:28:07,632 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 251 selfloop transitions, 131 changer transitions 5/720 dead transitions. [2025-04-30 10:28:07,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 720 transitions, 4592 flow [2025-04-30 10:28:07,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1794 transitions. [2025-04-30 10:28:07,634 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.887240356083086 [2025-04-30 10:28:07,634 INFO L175 Difference]: Start difference. First operand has 455 places, 582 transitions, 2918 flow. Second operand 6 states and 1794 transitions. [2025-04-30 10:28:07,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 720 transitions, 4592 flow [2025-04-30 10:28:07,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 720 transitions, 4546 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-30 10:28:07,650 INFO L231 Difference]: Finished difference. Result has 447 places, 710 transitions, 4352 flow [2025-04-30 10:28:07,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=2872, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4352, PETRI_PLACES=447, PETRI_TRANSITIONS=710} [2025-04-30 10:28:07,651 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 111 predicate places. [2025-04-30 10:28:07,651 INFO L485 AbstractCegarLoop]: Abstraction has has 447 places, 710 transitions, 4352 flow [2025-04-30 10:28:07,652 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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-30 10:28:07,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:07,652 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:28:07,652 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:28:07,652 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:07,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:07,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1996385328, now seen corresponding path program 1 times [2025-04-30 10:28:07,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:07,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259623653] [2025-04-30 10:28:07,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:07,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:07,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1215 statements into 1 equivalence classes. [2025-04-30 10:28:07,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1215 of 1215 statements. [2025-04-30 10:28:07,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:07,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6470 trivial. 0 not checked. [2025-04-30 10:28:10,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:10,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259623653] [2025-04-30 10:28:10,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259623653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:10,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:10,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:10,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131659111] [2025-04-30 10:28:10,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:10,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:10,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:10,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:10,781 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 337 [2025-04-30 10:28:10,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 710 transitions, 4352 flow. Second operand has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 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-30 10:28:10,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:10,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 337 [2025-04-30 10:28:10,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:12,658 INFO L116 PetriNetUnfolderBase]: 1309/5603 cut-off events. [2025-04-30 10:28:12,658 INFO L117 PetriNetUnfolderBase]: For 4990/5047 co-relation queries the response was YES. [2025-04-30 10:28:12,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13619 conditions, 5603 events. 1309/5603 cut-off events. For 4990/5047 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33834 event pairs, 369 based on Foata normal form. 11/5369 useless extension candidates. Maximal degree in co-relation 13346. Up to 2549 conditions per place. [2025-04-30 10:28:12,683 INFO L140 encePairwiseOnDemand]: 318/337 looper letters, 316 selfloop transitions, 84 changer transitions 0/789 dead transitions. [2025-04-30 10:28:12,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 789 transitions, 5550 flow [2025-04-30 10:28:12,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1672 transitions. [2025-04-30 10:28:12,685 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8269040553907022 [2025-04-30 10:28:12,685 INFO L175 Difference]: Start difference. First operand has 447 places, 710 transitions, 4352 flow. Second operand 6 states and 1672 transitions. [2025-04-30 10:28:12,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 789 transitions, 5550 flow [2025-04-30 10:28:12,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 789 transitions, 5296 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:12,706 INFO L231 Difference]: Finished difference. Result has 456 places, 781 transitions, 4888 flow [2025-04-30 10:28:12,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=4104, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4888, PETRI_PLACES=456, PETRI_TRANSITIONS=781} [2025-04-30 10:28:12,707 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 120 predicate places. [2025-04-30 10:28:12,707 INFO L485 AbstractCegarLoop]: Abstraction has has 456 places, 781 transitions, 4888 flow [2025-04-30 10:28:12,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 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-30 10:28:12,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:12,708 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:28:12,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:28:12,708 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:12,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash -733044952, now seen corresponding path program 1 times [2025-04-30 10:28:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:12,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698423858] [2025-04-30 10:28:12,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:12,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:12,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-04-30 10:28:14,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-04-30 10:28:14,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:14,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 1906 proven. 4073 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2025-04-30 10:28:37,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:37,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698423858] [2025-04-30 10:28:37,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698423858] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:37,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50869] [2025-04-30 10:28:37,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:37,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:37,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:37,152 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:28:37,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:28:37,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-04-30 10:28:38,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-04-30 10:28:38,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:38,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:38,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 4602 conjuncts, 152 conjuncts are in the unsatisfiable core [2025-04-30 10:28:38,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:39,130 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:39,131 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:28:39,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-30 10:28:39,661 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:39,661 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:28:39,785 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2025-04-30 10:28:39,873 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2025-04-30 10:28:40,037 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-04-30 10:28:40,357 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:40,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-30 10:28:40,543 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-30 10:28:40,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-30 10:28:41,474 INFO L325 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-04-30 10:28:41,474 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 Killed by 15