./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_18-nested_rc.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_18-nested_rc.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 bf117fc0bf8ae8b9ef4bb89156c7168763fcd2ba3d8567cd686924f85ad04dca --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:27:40,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:27:40,369 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,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:27:40,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:27:40,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:27:40,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:27:40,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:27:40,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:27:40,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:27:40,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:27:40,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:27:40,397 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:27:40,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:27:40,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:27:40,398 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:27:40,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:27:40,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:27:40,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:27:40,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:27:40,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:27:40,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:27:40,399 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:27:40,399 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:27:40,399 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:27:40,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:27:40,399 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:27:40,399 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:27:40,399 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:27:40,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:27:40,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:27:40,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:40,400 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:27:40,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:27:40,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:27:40,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:40,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:27:40,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:27:40,400 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:27:40,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:27:40,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:27:40,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:27:40,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:27:40,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:27:40,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:27:40,401 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 -> bf117fc0bf8ae8b9ef4bb89156c7168763fcd2ba3d8567cd686924f85ad04dca [2025-04-30 10:27:40,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:27:40,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:27:40,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:27:40,648 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:27:40,648 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:27:40,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_18-nested_rc.i [2025-04-30 10:27:41,938 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454d38897/b7ccdbbde4a84631a2c0eefc43dca914/FLAGa5f8c4ea5 [2025-04-30 10:27:42,213 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:27:42,216 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_18-nested_rc.i [2025-04-30 10:27:42,239 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454d38897/b7ccdbbde4a84631a2c0eefc43dca914/FLAGa5f8c4ea5 [2025-04-30 10:27:42,989 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/454d38897/b7ccdbbde4a84631a2c0eefc43dca914 [2025-04-30 10:27:42,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:27:42,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:27:42,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:27:42,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:27:42,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:27:42,996 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,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca58403 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,997 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:43,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:27:43,440 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:27:43,463 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:27:43,538 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:27:43,596 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:27:43,596 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,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:27:43,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:27:43,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:27:43,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:27:43,602 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,627 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,659 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 286 [2025-04-30 10:27:43,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:27:43,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:27:43,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:27:43,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:27:43,665 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,665 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,670 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,670 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,685 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,687 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,689 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,691 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,692 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,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:27:43,699 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:27:43,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:27:43,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:27:43,700 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,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:27:43,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:43,724 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,726 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,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-30 10:27:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-30 10:27:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:27:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:27:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:27:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:27:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:27:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:27:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-30 10:27:43,743 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:27:43,743 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:27:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:27:43,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:27:43,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:27:43,747 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,865 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:27:43,866 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:27:44,308 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:27:44,309 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:27:44,324 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:27:44,324 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:27:44,324 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,325 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:27:44,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:27:44,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:27:44,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:27:44,330 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,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116796bb 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,330 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,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116796bb 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,331 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,331 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_18-nested_rc.i [2025-04-30 10:27:44,341 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:27:44,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_18-nested_rc.i that has 2 procedures, 328 locations, 329 edges, 1 initial locations, 1 loop locations, and 18 error locations. [2025-04-30 10:27:44,345 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:27:44,423 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:27:44,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 330 transitions, 664 flow [2025-04-30 10:27:44,546 INFO L116 PetriNetUnfolderBase]: 3/329 cut-off events. [2025-04-30 10:27:44,548 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:44,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 329 events. 3/329 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 201. Up to 2 conditions per place. [2025-04-30 10:27:44,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 330 transitions, 664 flow [2025-04-30 10:27:44,575 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 329 transitions, 661 flow [2025-04-30 10:27:44,580 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:27:44,588 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;@7aaabdf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:27:44,588 INFO L341 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-04-30 10:27:44,609 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:27:44,609 INFO L116 PetriNetUnfolderBase]: 2/101 cut-off events. [2025-04-30 10:27:44,609 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:27:44,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:44,609 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] [2025-04-30 10:27:44,610 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:44,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1993980686, now seen corresponding path program 1 times [2025-04-30 10:27:44,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:44,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925834435] [2025-04-30 10:27:44,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:44,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:44,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-30 10:27:44,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-30 10:27:44,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:44,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:44,926 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,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:44,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925834435] [2025-04-30 10:27:44,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925834435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:44,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:44,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:27:44,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674338822] [2025-04-30 10:27:44,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:44,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:27:44,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:44,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:27:44,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:27:44,967 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 330 [2025-04-30 10:27:44,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 329 transitions, 661 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 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,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:44,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 330 [2025-04-30 10:27:44,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:45,049 INFO L116 PetriNetUnfolderBase]: 7/407 cut-off events. [2025-04-30 10:27:45,049 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:45,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 407 events. 7/407 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 400 event pairs, 6 based on Foata normal form. 5/382 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-04-30 10:27:45,054 INFO L140 encePairwiseOnDemand]: 325/330 looper letters, 10 selfloop transitions, 2 changer transitions 1/328 dead transitions. [2025-04-30 10:27:45,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 328 transitions, 683 flow [2025-04-30 10:27:45,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:27:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:27:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-04-30 10:27:45,070 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9757575757575757 [2025-04-30 10:27:45,072 INFO L175 Difference]: Start difference. First operand has 330 places, 329 transitions, 661 flow. Second operand 3 states and 966 transitions. [2025-04-30 10:27:45,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 328 transitions, 683 flow [2025-04-30 10:27:45,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 328 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:45,104 INFO L231 Difference]: Finished difference. Result has 332 places, 327 transitions, 666 flow [2025-04-30 10:27:45,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=332, PETRI_TRANSITIONS=327} [2025-04-30 10:27:45,109 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 2 predicate places. [2025-04-30 10:27:45,109 INFO L485 AbstractCegarLoop]: Abstraction has has 332 places, 327 transitions, 666 flow [2025-04-30 10:27:45,109 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 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,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:45,110 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] [2025-04-30 10:27:45,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:27:45,110 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:45,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:45,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1771344581, now seen corresponding path program 1 times [2025-04-30 10:27:45,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:45,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028847274] [2025-04-30 10:27:45,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:45,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:45,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-30 10:27:45,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-30 10:27:45,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:45,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:45,276 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,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:45,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028847274] [2025-04-30 10:27:45,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028847274] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:45,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591657301] [2025-04-30 10:27:45,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:45,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:45,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:45,279 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,280 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,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-30 10:27:45,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-30 10:27:45,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:45,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:45,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:27:45,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:45,433 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,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:45,479 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,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591657301] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:45,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:45,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:27:45,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005469142] [2025-04-30 10:27:45,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:45,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:27:45,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:45,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:27:45,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:27:45,529 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 330 [2025-04-30 10:27:45,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 327 transitions, 666 flow. Second operand has 10 states, 10 states have (on average 315.8) internal successors, (3158), 10 states have internal predecessors, (3158), 0 states have call successors, (0), 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,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:45,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 330 [2025-04-30 10:27:45,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:45,645 INFO L116 PetriNetUnfolderBase]: 7/413 cut-off events. [2025-04-30 10:27:45,646 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:27:45,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 413 events. 7/413 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 395 event pairs, 6 based on Foata normal form. 2/386 useless extension candidates. Maximal degree in co-relation 377. Up to 24 conditions per place. [2025-04-30 10:27:45,647 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 14 selfloop transitions, 9 changer transitions 0/335 dead transitions. [2025-04-30 10:27:45,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 335 transitions, 730 flow [2025-04-30 10:27:45,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-30 10:27:45,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-30 10:27:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2851 transitions. [2025-04-30 10:27:45,655 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.95993265993266 [2025-04-30 10:27:45,655 INFO L175 Difference]: Start difference. First operand has 332 places, 327 transitions, 666 flow. Second operand 9 states and 2851 transitions. [2025-04-30 10:27:45,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 335 transitions, 730 flow [2025-04-30 10:27:45,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 335 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:45,663 INFO L231 Difference]: Finished difference. Result has 341 places, 333 transitions, 714 flow [2025-04-30 10:27:45,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=714, PETRI_PLACES=341, PETRI_TRANSITIONS=333} [2025-04-30 10:27:45,664 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 11 predicate places. [2025-04-30 10:27:45,665 INFO L485 AbstractCegarLoop]: Abstraction has has 341 places, 333 transitions, 714 flow [2025-04-30 10:27:45,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 315.8) internal successors, (3158), 10 states have internal predecessors, (3158), 0 states have call successors, (0), 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,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:45,668 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] [2025-04-30 10:27:45,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:27:45,872 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,872 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:45,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash 153408613, now seen corresponding path program 2 times [2025-04-30 10:27:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:45,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687560850] [2025-04-30 10:27:45,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:45,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:45,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-30 10:27:45,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 95 of 110 statements. [2025-04-30 10:27:45,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:45,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:46,359 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,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:46,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687560850] [2025-04-30 10:27:46,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687560850] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:46,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:46,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:46,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961926236] [2025-04-30 10:27:46,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:46,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:46,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:46,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:46,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:46,780 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 330 [2025-04-30 10:27:46,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 333 transitions, 714 flow. Second operand has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 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,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:46,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 330 [2025-04-30 10:27:46,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:47,078 INFO L116 PetriNetUnfolderBase]: 365/1688 cut-off events. [2025-04-30 10:27:47,079 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:27:47,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2530 conditions, 1688 events. 365/1688 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9184 event pairs, 364 based on Foata normal form. 0/1563 useless extension candidates. Maximal degree in co-relation 2419. Up to 800 conditions per place. [2025-04-30 10:27:47,086 INFO L140 encePairwiseOnDemand]: 318/330 looper letters, 71 selfloop transitions, 10 changer transitions 0/331 dead transitions. [2025-04-30 10:27:47,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 331 transitions, 872 flow [2025-04-30 10:27:47,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1553 transitions. [2025-04-30 10:27:47,089 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7843434343434343 [2025-04-30 10:27:47,089 INFO L175 Difference]: Start difference. First operand has 341 places, 333 transitions, 714 flow. Second operand 6 states and 1553 transitions. [2025-04-30 10:27:47,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 331 transitions, 872 flow [2025-04-30 10:27:47,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 331 transitions, 866 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-30 10:27:47,096 INFO L231 Difference]: Finished difference. Result has 343 places, 331 transitions, 724 flow [2025-04-30 10:27:47,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=724, PETRI_PLACES=343, PETRI_TRANSITIONS=331} [2025-04-30 10:27:47,098 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 13 predicate places. [2025-04-30 10:27:47,098 INFO L485 AbstractCegarLoop]: Abstraction has has 343 places, 331 transitions, 724 flow [2025-04-30 10:27:47,099 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 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,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:47,099 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] [2025-04-30 10:27:47,099 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:27:47,100 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:47,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:47,101 INFO L85 PathProgramCache]: Analyzing trace with hash 604590754, now seen corresponding path program 1 times [2025-04-30 10:27:47,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:47,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370422413] [2025-04-30 10:27:47,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:47,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-30 10:27:47,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-30 10:27:47,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:47,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:47,255 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,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:47,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370422413] [2025-04-30 10:27:47,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370422413] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:47,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040544980] [2025-04-30 10:27:47,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:47,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:47,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:47,257 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,259 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,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-30 10:27:47,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-30 10:27:47,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:47,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:47,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:27:47,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:47,390 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,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:47,482 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,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040544980] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:47,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:47,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-30 10:27:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828980624] [2025-04-30 10:27:47,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:47,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:27:47,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:47,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:27:47,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:27:47,517 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 330 [2025-04-30 10:27:47,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 331 transitions, 724 flow. Second operand has 18 states, 18 states have (on average 315.8888888888889) internal successors, (5686), 18 states have internal predecessors, (5686), 0 states have call successors, (0), 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,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:47,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 330 [2025-04-30 10:27:47,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:47,735 INFO L116 PetriNetUnfolderBase]: 7/431 cut-off events. [2025-04-30 10:27:47,735 INFO L117 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-04-30 10:27:47,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 431 events. 7/431 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 399 event pairs, 6 based on Foata normal form. 4/408 useless extension candidates. Maximal degree in co-relation 363. Up to 24 conditions per place. [2025-04-30 10:27:47,737 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 18 selfloop transitions, 21 changer transitions 0/349 dead transitions. [2025-04-30 10:27:47,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 349 transitions, 890 flow [2025-04-30 10:27:47,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:27:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:27:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6637 transitions. [2025-04-30 10:27:47,746 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9577200577200577 [2025-04-30 10:27:47,746 INFO L175 Difference]: Start difference. First operand has 343 places, 331 transitions, 724 flow. Second operand 21 states and 6637 transitions. [2025-04-30 10:27:47,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 349 transitions, 890 flow [2025-04-30 10:27:47,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 349 transitions, 870 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:47,751 INFO L231 Difference]: Finished difference. Result has 363 places, 344 transitions, 834 flow [2025-04-30 10:27:47,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=834, PETRI_PLACES=363, PETRI_TRANSITIONS=344} [2025-04-30 10:27:47,752 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 33 predicate places. [2025-04-30 10:27:47,752 INFO L485 AbstractCegarLoop]: Abstraction has has 363 places, 344 transitions, 834 flow [2025-04-30 10:27:47,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 315.8888888888889) internal successors, (5686), 18 states have internal predecessors, (5686), 0 states have call successors, (0), 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,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:47,755 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] [2025-04-30 10:27:47,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:27:47,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-30 10:27:47,956 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:47,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:47,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1888748062, now seen corresponding path program 2 times [2025-04-30 10:27:47,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:47,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210551026] [2025-04-30 10:27:47,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:47,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:47,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 138 statements into 2 equivalence classes. [2025-04-30 10:27:47,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 103 of 138 statements. [2025-04-30 10:27:47,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:47,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:48,234 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,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:48,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210551026] [2025-04-30 10:27:48,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210551026] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:48,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:48,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:48,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5333312] [2025-04-30 10:27:48,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:48,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:48,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:48,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:48,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:48,616 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 330 [2025-04-30 10:27:48,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 344 transitions, 834 flow. Second operand has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 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,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:48,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 330 [2025-04-30 10:27:48,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:48,868 INFO L116 PetriNetUnfolderBase]: 365/1706 cut-off events. [2025-04-30 10:27:48,869 INFO L117 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-04-30 10:27:48,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 1706 events. 365/1706 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9181 event pairs, 364 based on Foata normal form. 0/1583 useless extension candidates. Maximal degree in co-relation 2421. Up to 800 conditions per place. [2025-04-30 10:27:48,876 INFO L140 encePairwiseOnDemand]: 318/330 looper letters, 71 selfloop transitions, 10 changer transitions 0/342 dead transitions. [2025-04-30 10:27:48,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 342 transitions, 992 flow [2025-04-30 10:27:48,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1553 transitions. [2025-04-30 10:27:48,879 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7843434343434343 [2025-04-30 10:27:48,879 INFO L175 Difference]: Start difference. First operand has 363 places, 344 transitions, 834 flow. Second operand 6 states and 1553 transitions. [2025-04-30 10:27:48,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 342 transitions, 992 flow [2025-04-30 10:27:48,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 342 transitions, 968 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-30 10:27:48,886 INFO L231 Difference]: Finished difference. Result has 360 places, 342 transitions, 826 flow [2025-04-30 10:27:48,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=360, PETRI_TRANSITIONS=342} [2025-04-30 10:27:48,888 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 30 predicate places. [2025-04-30 10:27:48,889 INFO L485 AbstractCegarLoop]: Abstraction has has 360 places, 342 transitions, 826 flow [2025-04-30 10:27:48,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 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,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:48,890 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] [2025-04-30 10:27:48,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:27:48,890 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:48,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2027570459, now seen corresponding path program 1 times [2025-04-30 10:27:48,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:48,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077856899] [2025-04-30 10:27:48,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:48,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:48,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-04-30 10:27:48,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-04-30 10:27:48,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:48,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:49,154 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,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:49,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077856899] [2025-04-30 10:27:49,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077856899] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:27:49,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693243661] [2025-04-30 10:27:49,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:49,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:49,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:27:49,157 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,159 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,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-04-30 10:27:49,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-04-30 10:27:49,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:49,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:49,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:27:49,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:27:49,348 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,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:27:49,513 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,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693243661] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:27:49,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:27:49,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-30 10:27:49,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547399086] [2025-04-30 10:27:49,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:27:49,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:27:49,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:49,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:27:49,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:27:49,545 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 330 [2025-04-30 10:27:49,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 342 transitions, 826 flow. Second operand has 23 states, 23 states have (on average 316.0) internal successors, (7268), 23 states have internal predecessors, (7268), 0 states have call successors, (0), 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,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:49,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 330 [2025-04-30 10:27:49,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:49,814 INFO L116 PetriNetUnfolderBase]: 7/444 cut-off events. [2025-04-30 10:27:49,814 INFO L117 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-04-30 10:27:49,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 444 events. 7/444 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 400 event pairs, 6 based on Foata normal form. 3/422 useless extension candidates. Maximal degree in co-relation 368. Up to 24 conditions per place. [2025-04-30 10:27:49,816 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 21 selfloop transitions, 30 changer transitions 0/359 dead transitions. [2025-04-30 10:27:49,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 359 transitions, 1050 flow [2025-04-30 10:27:49,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-30 10:27:49,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-30 10:27:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9474 transitions. [2025-04-30 10:27:49,829 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9569696969696969 [2025-04-30 10:27:49,829 INFO L175 Difference]: Start difference. First operand has 360 places, 342 transitions, 826 flow. Second operand 30 states and 9474 transitions. [2025-04-30 10:27:49,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 359 transitions, 1050 flow [2025-04-30 10:27:49,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 359 transitions, 1030 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:49,835 INFO L231 Difference]: Finished difference. Result has 388 places, 352 transitions, 958 flow [2025-04-30 10:27:49,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=958, PETRI_PLACES=388, PETRI_TRANSITIONS=352} [2025-04-30 10:27:49,837 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 58 predicate places. [2025-04-30 10:27:49,837 INFO L485 AbstractCegarLoop]: Abstraction has has 388 places, 352 transitions, 958 flow [2025-04-30 10:27:49,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 316.0) internal successors, (7268), 23 states have internal predecessors, (7268), 0 states have call successors, (0), 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,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:49,840 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] [2025-04-30 10:27:49,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:27:50,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:27:50,045 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:50,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:50,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1274500178, now seen corresponding path program 2 times [2025-04-30 10:27:50,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:50,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875453640] [2025-04-30 10:27:50,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:27:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:50,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 165 statements into 2 equivalence classes. [2025-04-30 10:27:50,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 115 of 165 statements. [2025-04-30 10:27:50,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:27:50,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:50,363 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,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:50,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875453640] [2025-04-30 10:27:50,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875453640] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:50,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:50,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:50,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742929149] [2025-04-30 10:27:50,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:50,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:50,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:50,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:50,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:50,983 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 330 [2025-04-30 10:27:50,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 352 transitions, 958 flow. Second operand has 6 states, 6 states have (on average 243.83333333333334) internal successors, (1463), 6 states have internal predecessors, (1463), 0 states have call successors, (0), 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,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:50,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 330 [2025-04-30 10:27:50,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:51,240 INFO L116 PetriNetUnfolderBase]: 417/1901 cut-off events. [2025-04-30 10:27:51,240 INFO L117 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-04-30 10:27:51,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 1901 events. 417/1901 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10610 event pairs, 416 based on Foata normal form. 0/1768 useless extension candidates. Maximal degree in co-relation 2714. Up to 914 conditions per place. [2025-04-30 10:27:51,246 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 81 selfloop transitions, 5 changer transitions 0/351 dead transitions. [2025-04-30 10:27:51,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 351 transitions, 1128 flow [2025-04-30 10:27:51,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1533 transitions. [2025-04-30 10:27:51,249 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7742424242424243 [2025-04-30 10:27:51,249 INFO L175 Difference]: Start difference. First operand has 388 places, 352 transitions, 958 flow. Second operand 6 states and 1533 transitions. [2025-04-30 10:27:51,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 351 transitions, 1128 flow [2025-04-30 10:27:51,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 351 transitions, 1082 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-30 10:27:51,255 INFO L231 Difference]: Finished difference. Result has 374 places, 351 transitions, 920 flow [2025-04-30 10:27:51,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=920, PETRI_PLACES=374, PETRI_TRANSITIONS=351} [2025-04-30 10:27:51,256 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 44 predicate places. [2025-04-30 10:27:51,256 INFO L485 AbstractCegarLoop]: Abstraction has has 374 places, 351 transitions, 920 flow [2025-04-30 10:27:51,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.83333333333334) internal successors, (1463), 6 states have internal predecessors, (1463), 0 states have call successors, (0), 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,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:51,257 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] [2025-04-30 10:27:51,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:27:51,258 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:51,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1222192318, now seen corresponding path program 1 times [2025-04-30 10:27:51,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:51,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209873994] [2025-04-30 10:27:51,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:51,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-04-30 10:27:51,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-04-30 10:27:51,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:51,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:51,761 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:51,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:51,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209873994] [2025-04-30 10:27:51,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209873994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:51,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:51,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:51,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673600982] [2025-04-30 10:27:51,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:51,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:51,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:51,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:52,332 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 330 [2025-04-30 10:27:52,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 351 transitions, 920 flow. Second operand has 6 states, 6 states have (on average 266.8333333333333) internal successors, (1601), 6 states have internal predecessors, (1601), 0 states have call successors, (0), 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,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:52,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 330 [2025-04-30 10:27:52,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:52,718 INFO L116 PetriNetUnfolderBase]: 257/1749 cut-off events. [2025-04-30 10:27:52,718 INFO L117 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-04-30 10:27:52,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 1749 events. 257/1749 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10045 event pairs, 34 based on Foata normal form. 0/1620 useless extension candidates. Maximal degree in co-relation 2231. Up to 436 conditions per place. [2025-04-30 10:27:52,724 INFO L140 encePairwiseOnDemand]: 301/330 looper letters, 68 selfloop transitions, 75 changer transitions 0/428 dead transitions. [2025-04-30 10:27:52,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 428 transitions, 1360 flow [2025-04-30 10:27:52,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1717 transitions. [2025-04-30 10:27:52,726 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8671717171717171 [2025-04-30 10:27:52,727 INFO L175 Difference]: Start difference. First operand has 374 places, 351 transitions, 920 flow. Second operand 6 states and 1717 transitions. [2025-04-30 10:27:52,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 428 transitions, 1360 flow [2025-04-30 10:27:52,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 428 transitions, 1350 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:52,734 INFO L231 Difference]: Finished difference. Result has 378 places, 419 transitions, 1390 flow [2025-04-30 10:27:52,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1390, PETRI_PLACES=378, PETRI_TRANSITIONS=419} [2025-04-30 10:27:52,737 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 48 predicate places. [2025-04-30 10:27:52,737 INFO L485 AbstractCegarLoop]: Abstraction has has 378 places, 419 transitions, 1390 flow [2025-04-30 10:27:52,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 266.8333333333333) internal successors, (1601), 6 states have internal predecessors, (1601), 0 states have call successors, (0), 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,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:52,738 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] [2025-04-30 10:27:52,738 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:27:52,738 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:52,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash -716255676, now seen corresponding path program 1 times [2025-04-30 10:27:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:52,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755113089] [2025-04-30 10:27:52,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:52,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-04-30 10:27:52,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-04-30 10:27:52,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:52,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:53,129 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,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:53,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755113089] [2025-04-30 10:27:53,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755113089] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:53,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:53,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:53,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748932199] [2025-04-30 10:27:53,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:53,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:53,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:53,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:53,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:53,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 330 [2025-04-30 10:27:53,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 419 transitions, 1390 flow. Second operand has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 0 states have call successors, (0), 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,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:53,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 330 [2025-04-30 10:27:53,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:53,668 INFO L116 PetriNetUnfolderBase]: 224/1639 cut-off events. [2025-04-30 10:27:53,668 INFO L117 PetriNetUnfolderBase]: For 477/499 co-relation queries the response was YES. [2025-04-30 10:27:53,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 1639 events. 224/1639 cut-off events. For 477/499 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8637 event pairs, 53 based on Foata normal form. 0/1524 useless extension candidates. Maximal degree in co-relation 2525. Up to 336 conditions per place. [2025-04-30 10:27:53,677 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 117 selfloop transitions, 5 changer transitions 0/418 dead transitions. [2025-04-30 10:27:53,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 418 transitions, 1632 flow [2025-04-30 10:27:53,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1673 transitions. [2025-04-30 10:27:53,680 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8449494949494949 [2025-04-30 10:27:53,680 INFO L175 Difference]: Start difference. First operand has 378 places, 419 transitions, 1390 flow. Second operand 6 states and 1673 transitions. [2025-04-30 10:27:53,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 418 transitions, 1632 flow [2025-04-30 10:27:53,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 418 transitions, 1632 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:53,689 INFO L231 Difference]: Finished difference. Result has 382 places, 418 transitions, 1398 flow [2025-04-30 10:27:53,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1398, PETRI_PLACES=382, PETRI_TRANSITIONS=418} [2025-04-30 10:27:53,691 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 52 predicate places. [2025-04-30 10:27:53,691 INFO L485 AbstractCegarLoop]: Abstraction has has 382 places, 418 transitions, 1398 flow [2025-04-30 10:27:53,693 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 0 states have call successors, (0), 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,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:53,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] [2025-04-30 10:27:53,693 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:27:53,694 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:53,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:53,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1836383304, now seen corresponding path program 1 times [2025-04-30 10:27:53,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:53,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388191109] [2025-04-30 10:27:53,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:53,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:53,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-04-30 10:27:53,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-04-30 10:27:53,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:53,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-04-30 10:27:54,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:54,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388191109] [2025-04-30 10:27:54,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388191109] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:54,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:54,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809053368] [2025-04-30 10:27:54,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:54,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:54,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:54,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:54,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:54,306 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 330 [2025-04-30 10:27:54,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 418 transitions, 1398 flow. Second operand has 6 states, 6 states have (on average 249.16666666666666) internal successors, (1495), 6 states have internal predecessors, (1495), 0 states have call successors, (0), 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,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:54,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 330 [2025-04-30 10:27:54,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:54,700 INFO L116 PetriNetUnfolderBase]: 717/2984 cut-off events. [2025-04-30 10:27:54,700 INFO L117 PetriNetUnfolderBase]: For 935/996 co-relation queries the response was YES. [2025-04-30 10:27:54,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5756 conditions, 2984 events. 717/2984 cut-off events. For 935/996 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 19894 event pairs, 399 based on Foata normal form. 0/2763 useless extension candidates. Maximal degree in co-relation 5505. Up to 1485 conditions per place. [2025-04-30 10:27:54,717 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 146 selfloop transitions, 5 changer transitions 0/417 dead transitions. [2025-04-30 10:27:54,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 417 transitions, 1698 flow [2025-04-30 10:27:54,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1543 transitions. [2025-04-30 10:27:54,719 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7792929292929293 [2025-04-30 10:27:54,719 INFO L175 Difference]: Start difference. First operand has 382 places, 418 transitions, 1398 flow. Second operand 6 states and 1543 transitions. [2025-04-30 10:27:54,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 417 transitions, 1698 flow [2025-04-30 10:27:54,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 417 transitions, 1688 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:54,727 INFO L231 Difference]: Finished difference. Result has 381 places, 417 transitions, 1396 flow [2025-04-30 10:27:54,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1396, PETRI_PLACES=381, PETRI_TRANSITIONS=417} [2025-04-30 10:27:54,729 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 51 predicate places. [2025-04-30 10:27:54,729 INFO L485 AbstractCegarLoop]: Abstraction has has 381 places, 417 transitions, 1396 flow [2025-04-30 10:27:54,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 249.16666666666666) internal successors, (1495), 6 states have internal predecessors, (1495), 0 states have call successors, (0), 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,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:54,729 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] [2025-04-30 10:27:54,730 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:27:54,730 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:54,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:54,731 INFO L85 PathProgramCache]: Analyzing trace with hash 631503785, now seen corresponding path program 1 times [2025-04-30 10:27:54,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:54,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194484538] [2025-04-30 10:27:54,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:54,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:54,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-04-30 10:27:54,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-04-30 10:27:54,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:54,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-04-30 10:27:55,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:55,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194484538] [2025-04-30 10:27:55,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194484538] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:55,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:55,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:55,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126120672] [2025-04-30 10:27:55,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:55,113 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:55,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:55,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:55,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:55,361 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 330 [2025-04-30 10:27:55,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 417 transitions, 1396 flow. Second operand has 6 states, 6 states have (on average 250.66666666666666) internal successors, (1504), 6 states have internal predecessors, (1504), 0 states have call successors, (0), 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,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:55,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 330 [2025-04-30 10:27:55,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:55,882 INFO L116 PetriNetUnfolderBase]: 717/2983 cut-off events. [2025-04-30 10:27:55,882 INFO L117 PetriNetUnfolderBase]: For 937/998 co-relation queries the response was YES. [2025-04-30 10:27:55,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 2983 events. 717/2983 cut-off events. For 937/998 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 19954 event pairs, 399 based on Foata normal form. 0/2763 useless extension candidates. Maximal degree in co-relation 5503. Up to 1484 conditions per place. [2025-04-30 10:27:55,898 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 145 selfloop transitions, 5 changer transitions 0/416 dead transitions. [2025-04-30 10:27:55,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 416 transitions, 1694 flow [2025-04-30 10:27:55,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1548 transitions. [2025-04-30 10:27:55,900 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7818181818181819 [2025-04-30 10:27:55,901 INFO L175 Difference]: Start difference. First operand has 381 places, 417 transitions, 1396 flow. Second operand 6 states and 1548 transitions. [2025-04-30 10:27:55,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 416 transitions, 1694 flow [2025-04-30 10:27:55,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 416 transitions, 1684 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:55,908 INFO L231 Difference]: Finished difference. Result has 380 places, 416 transitions, 1394 flow [2025-04-30 10:27:55,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1394, PETRI_PLACES=380, PETRI_TRANSITIONS=416} [2025-04-30 10:27:55,909 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 50 predicate places. [2025-04-30 10:27:55,909 INFO L485 AbstractCegarLoop]: Abstraction has has 380 places, 416 transitions, 1394 flow [2025-04-30 10:27:55,909 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 250.66666666666666) internal successors, (1504), 6 states have internal predecessors, (1504), 0 states have call successors, (0), 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,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:55,909 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] [2025-04-30 10:27:55,910 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:27:55,910 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:55,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:55,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1113619206, now seen corresponding path program 1 times [2025-04-30 10:27:55,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:55,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91332563] [2025-04-30 10:27:55,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:55,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:55,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-04-30 10:27:55,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-04-30 10:27:55,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:55,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-04-30 10:27:56,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:56,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91332563] [2025-04-30 10:27:56,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91332563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:56,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:56,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:56,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322323134] [2025-04-30 10:27:56,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:56,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:56,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:56,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:56,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:56,590 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 330 [2025-04-30 10:27:56,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 416 transitions, 1394 flow. Second operand has 6 states, 6 states have (on average 275.1666666666667) internal successors, (1651), 6 states have internal predecessors, (1651), 0 states have call successors, (0), 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,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:56,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 330 [2025-04-30 10:27:56,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:56,954 INFO L116 PetriNetUnfolderBase]: 545/2555 cut-off events. [2025-04-30 10:27:56,955 INFO L117 PetriNetUnfolderBase]: For 952/1054 co-relation queries the response was YES. [2025-04-30 10:27:56,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4772 conditions, 2555 events. 545/2555 cut-off events. For 952/1054 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16111 event pairs, 93 based on Foata normal form. 16/2406 useless extension candidates. Maximal degree in co-relation 4520. Up to 813 conditions per place. [2025-04-30 10:27:56,966 INFO L140 encePairwiseOnDemand]: 307/330 looper letters, 131 selfloop transitions, 130 changer transitions 0/553 dead transitions. [2025-04-30 10:27:56,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 553 transitions, 2566 flow [2025-04-30 10:27:56,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1751 transitions. [2025-04-30 10:27:56,968 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8843434343434343 [2025-04-30 10:27:56,968 INFO L175 Difference]: Start difference. First operand has 380 places, 416 transitions, 1394 flow. Second operand 6 states and 1751 transitions. [2025-04-30 10:27:56,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 553 transitions, 2566 flow [2025-04-30 10:27:56,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 553 transitions, 2556 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:27:56,976 INFO L231 Difference]: Finished difference. Result has 385 places, 545 transitions, 2612 flow [2025-04-30 10:27:56,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2612, PETRI_PLACES=385, PETRI_TRANSITIONS=545} [2025-04-30 10:27:56,977 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 55 predicate places. [2025-04-30 10:27:56,977 INFO L485 AbstractCegarLoop]: Abstraction has has 385 places, 545 transitions, 2612 flow [2025-04-30 10:27:56,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.1666666666667) internal successors, (1651), 6 states have internal predecessors, (1651), 0 states have call successors, (0), 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,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:56,978 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:56,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:27:56,978 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:56,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:56,979 INFO L85 PathProgramCache]: Analyzing trace with hash -688618297, now seen corresponding path program 1 times [2025-04-30 10:27:56,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:56,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152676563] [2025-04-30 10:27:56,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:56,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:57,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-04-30 10:27:57,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-04-30 10:27:57,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:57,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:57,385 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:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:57,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152676563] [2025-04-30 10:27:57,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152676563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:57,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:57,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:57,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446177139] [2025-04-30 10:27:57,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:57,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:57,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:57,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:57,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:57,651 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 330 [2025-04-30 10:27:57,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 545 transitions, 2612 flow. Second operand has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 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,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:57,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 330 [2025-04-30 10:27:57,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:58,081 INFO L116 PetriNetUnfolderBase]: 821/3321 cut-off events. [2025-04-30 10:27:58,081 INFO L117 PetriNetUnfolderBase]: For 3328/3581 co-relation queries the response was YES. [2025-04-30 10:27:58,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7646 conditions, 3321 events. 821/3321 cut-off events. For 3328/3581 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22316 event pairs, 74 based on Foata normal form. 76/3222 useless extension candidates. Maximal degree in co-relation 7390. Up to 1071 conditions per place. [2025-04-30 10:27:58,095 INFO L140 encePairwiseOnDemand]: 307/330 looper letters, 251 selfloop transitions, 131 changer transitions 5/683 dead transitions. [2025-04-30 10:27:58,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 683 transitions, 4286 flow [2025-04-30 10:27:58,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1752 transitions. [2025-04-30 10:27:58,096 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8848484848484849 [2025-04-30 10:27:58,096 INFO L175 Difference]: Start difference. First operand has 385 places, 545 transitions, 2612 flow. Second operand 6 states and 1752 transitions. [2025-04-30 10:27:58,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 683 transitions, 4286 flow [2025-04-30 10:27:58,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 683 transitions, 4286 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:58,109 INFO L231 Difference]: Finished difference. Result has 395 places, 673 transitions, 4092 flow [2025-04-30 10:27:58,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=2612, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4092, PETRI_PLACES=395, PETRI_TRANSITIONS=673} [2025-04-30 10:27:58,110 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 65 predicate places. [2025-04-30 10:27:58,110 INFO L485 AbstractCegarLoop]: Abstraction has has 395 places, 673 transitions, 4092 flow [2025-04-30 10:27:58,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 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,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:58,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:58,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:27:58,114 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:58,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:58,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1284666501, now seen corresponding path program 1 times [2025-04-30 10:27:58,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:58,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782059636] [2025-04-30 10:27:58,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:58,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:58,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-04-30 10:27:58,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-04-30 10:27:58,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:58,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:27:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-04-30 10:27:58,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:27:58,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782059636] [2025-04-30 10:27:58,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782059636] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:27:58,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:27:58,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:27:58,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130935819] [2025-04-30 10:27:58,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:27:58,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:27:58,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:27:58,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:27:58,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:27:58,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 330 [2025-04-30 10:27:58,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 673 transitions, 4092 flow. Second operand has 6 states, 6 states have (on average 255.66666666666666) internal successors, (1534), 6 states have internal predecessors, (1534), 0 states have call successors, (0), 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,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:27:58,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 330 [2025-04-30 10:27:58,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:27:59,488 INFO L116 PetriNetUnfolderBase]: 1308/4650 cut-off events. [2025-04-30 10:27:59,488 INFO L117 PetriNetUnfolderBase]: For 4870/4927 co-relation queries the response was YES. [2025-04-30 10:27:59,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12215 conditions, 4650 events. 1308/4650 cut-off events. For 4870/4927 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33860 event pairs, 369 based on Foata normal form. 11/4416 useless extension candidates. Maximal degree in co-relation 11955. Up to 2225 conditions per place. [2025-04-30 10:27:59,510 INFO L140 encePairwiseOnDemand]: 311/330 looper letters, 316 selfloop transitions, 84 changer transitions 0/752 dead transitions. [2025-04-30 10:27:59,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 752 transitions, 5290 flow [2025-04-30 10:27:59,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:27:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:27:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1630 transitions. [2025-04-30 10:27:59,511 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8232323232323232 [2025-04-30 10:27:59,511 INFO L175 Difference]: Start difference. First operand has 395 places, 673 transitions, 4092 flow. Second operand 6 states and 1630 transitions. [2025-04-30 10:27:59,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 752 transitions, 5290 flow [2025-04-30 10:27:59,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 752 transitions, 5036 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-04-30 10:27:59,532 INFO L231 Difference]: Finished difference. Result has 404 places, 744 transitions, 4628 flow [2025-04-30 10:27:59,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=3844, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4628, PETRI_PLACES=404, PETRI_TRANSITIONS=744} [2025-04-30 10:27:59,533 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 74 predicate places. [2025-04-30 10:27:59,534 INFO L485 AbstractCegarLoop]: Abstraction has has 404 places, 744 transitions, 4628 flow [2025-04-30 10:27:59,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.66666666666666) internal successors, (1534), 6 states have internal predecessors, (1534), 0 states have call successors, (0), 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,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:27:59,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:27:59,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:27:59,534 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:27:59,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:27:59,535 INFO L85 PathProgramCache]: Analyzing trace with hash -666793962, now seen corresponding path program 1 times [2025-04-30 10:27:59,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:27:59,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174563945] [2025-04-30 10:27:59,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:27:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:27:59,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-04-30 10:27:59,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-04-30 10:27:59,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:27:59,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:00,464 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-04-30 10:28:00,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:00,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174563945] [2025-04-30 10:28:00,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174563945] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:00,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348103785] [2025-04-30 10:28:00,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:00,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:00,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:00,467 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:28:00,468 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:28:00,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-04-30 10:28:00,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-04-30 10:28:00,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:00,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:00,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-30 10:28:00,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:01,011 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:01,011 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:01,119 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:01,120 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:01,327 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:28:01,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:28:01,368 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-30 10:28:01,389 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 27 [2025-04-30 10:28:01,418 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:01,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 40 treesize of output 42 [2025-04-30 10:28:01,455 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:01,456 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-04-30 10:28:01,492 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 56 treesize of output 45 [2025-04-30 10:28:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-04-30 10:28:01,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:28:01,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348103785] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:01,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:28:01,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2025-04-30 10:28:01,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189159377] [2025-04-30 10:28:01,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:01,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:28:01,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:01,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:28:01,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:28:03,210 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 330 [2025-04-30 10:28:03,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 744 transitions, 4628 flow. Second operand has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 0 states have call successors, (0), 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:03,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:03,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 330 [2025-04-30 10:28:03,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:04,176 INFO L116 PetriNetUnfolderBase]: 1045/3958 cut-off events. [2025-04-30 10:28:04,176 INFO L117 PetriNetUnfolderBase]: For 6244/6519 co-relation queries the response was YES. [2025-04-30 10:28:04,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11618 conditions, 3958 events. 1045/3958 cut-off events. For 6244/6519 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 27643 event pairs, 80 based on Foata normal form. 74/3887 useless extension candidates. Maximal degree in co-relation 11350. Up to 892 conditions per place. [2025-04-30 10:28:04,207 INFO L140 encePairwiseOnDemand]: 307/330 looper letters, 401 selfloop transitions, 143 changer transitions 1/869 dead transitions. [2025-04-30 10:28:04,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 869 transitions, 6652 flow [2025-04-30 10:28:04,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:28:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-30 10:28:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4514 transitions. [2025-04-30 10:28:04,214 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8046345811051694 [2025-04-30 10:28:04,214 INFO L175 Difference]: Start difference. First operand has 404 places, 744 transitions, 4628 flow. Second operand 17 states and 4514 transitions. [2025-04-30 10:28:04,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 869 transitions, 6652 flow [2025-04-30 10:28:04,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 869 transitions, 6580 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:04,246 INFO L231 Difference]: Finished difference. Result has 431 places, 801 transitions, 5574 flow [2025-04-30 10:28:04,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4574, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5574, PETRI_PLACES=431, PETRI_TRANSITIONS=801} [2025-04-30 10:28:04,247 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 101 predicate places. [2025-04-30 10:28:04,247 INFO L485 AbstractCegarLoop]: Abstraction has has 431 places, 801 transitions, 5574 flow [2025-04-30 10:28:04,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 0 states have call successors, (0), 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,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:04,248 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:04,255 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:28:04,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:28:04,452 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:04,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:04,453 INFO L85 PathProgramCache]: Analyzing trace with hash -681370692, now seen corresponding path program 2 times [2025-04-30 10:28:04,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:04,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210219429] [2025-04-30 10:28:04,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:28:04,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:04,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 269 statements into 2 equivalence classes. [2025-04-30 10:28:04,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-04-30 10:28:04,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:28:04,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-04-30 10:28:06,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:06,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210219429] [2025-04-30 10:28:06,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210219429] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:06,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824816461] [2025-04-30 10:28:06,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:28:06,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:06,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:06,705 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:28:06,707 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:28:06,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 269 statements into 2 equivalence classes. [2025-04-30 10:28:07,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-04-30 10:28:07,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:28:07,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:07,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-30 10:28:07,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:07,644 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:07,644 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:07,786 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-30 10:28:07,786 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-30 10:28:08,111 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-30 10:28:08,139 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 24 [2025-04-30 10:28:08,171 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:08,171 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 38 [2025-04-30 10:28:08,208 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:08,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2025-04-30 10:28:08,266 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:28:08,266 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:28:08,386 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:08,386 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 55 [2025-04-30 10:28:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-04-30 10:28:08,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:28:08,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824816461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:08,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:28:08,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 21 [2025-04-30 10:28:08,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864120394] [2025-04-30 10:28:08,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:08,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:28:08,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:08,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:28:08,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:28:10,001 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 330 [2025-04-30 10:28:10,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 801 transitions, 5574 flow. Second operand has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 0 states have call successors, (0), 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,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:10,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 330 [2025-04-30 10:28:10,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:11,069 INFO L116 PetriNetUnfolderBase]: 1506/5671 cut-off events. [2025-04-30 10:28:11,069 INFO L117 PetriNetUnfolderBase]: For 13305/13714 co-relation queries the response was YES. [2025-04-30 10:28:11,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17746 conditions, 5671 events. 1506/5671 cut-off events. For 13305/13714 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 45332 event pairs, 98 based on Foata normal form. 215/5692 useless extension candidates. Maximal degree in co-relation 17464. Up to 1301 conditions per place. [2025-04-30 10:28:11,118 INFO L140 encePairwiseOnDemand]: 296/330 looper letters, 419 selfloop transitions, 261 changer transitions 4/1008 dead transitions. [2025-04-30 10:28:11,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1008 transitions, 8770 flow [2025-04-30 10:28:11,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:28:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:28:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3007 transitions. [2025-04-30 10:28:11,121 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8283746556473829 [2025-04-30 10:28:11,121 INFO L175 Difference]: Start difference. First operand has 431 places, 801 transitions, 5574 flow. Second operand 11 states and 3007 transitions. [2025-04-30 10:28:11,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1008 transitions, 8770 flow [2025-04-30 10:28:11,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 1008 transitions, 8724 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-30 10:28:11,177 INFO L231 Difference]: Finished difference. Result has 442 places, 902 transitions, 7765 flow [2025-04-30 10:28:11,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=5550, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7765, PETRI_PLACES=442, PETRI_TRANSITIONS=902} [2025-04-30 10:28:11,179 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 112 predicate places. [2025-04-30 10:28:11,180 INFO L485 AbstractCegarLoop]: Abstraction has has 442 places, 902 transitions, 7765 flow [2025-04-30 10:28:11,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 0 states have call successors, (0), 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:11,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:11,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:11,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:28:11,381 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,SelfDestructingSolverStorable15 [2025-04-30 10:28:11,382 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:11,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1052150456, now seen corresponding path program 3 times [2025-04-30 10:28:11,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:11,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677265061] [2025-04-30 10:28:11,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:28:11,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:11,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 269 statements into 11 equivalence classes. [2025-04-30 10:28:11,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 229 of 269 statements. [2025-04-30 10:28:11,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:28:11,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-04-30 10:28:13,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:13,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677265061] [2025-04-30 10:28:13,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677265061] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:13,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948387412] [2025-04-30 10:28:13,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:28:13,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:13,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:13,779 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:13,781 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:13,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 269 statements into 11 equivalence classes. [2025-04-30 10:28:14,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 229 of 269 statements. [2025-04-30 10:28:14,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-30 10:28:14,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:14,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-30 10:28:14,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:15,113 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:15,113 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:15,290 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:15,291 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:15,595 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:28:15,595 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:28:15,634 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-30 10:28:15,686 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 27 [2025-04-30 10:28:15,723 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:15,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 40 treesize of output 42 [2025-04-30 10:28:15,761 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:15,761 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-04-30 10:28:15,826 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 56 treesize of output 45 [2025-04-30 10:28:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-04-30 10:28:15,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:28:15,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948387412] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:15,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:28:15,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 25 [2025-04-30 10:28:15,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258396002] [2025-04-30 10:28:15,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:15,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:28:15,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:15,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:28:15,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2025-04-30 10:28:18,578 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 330 [2025-04-30 10:28:18,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 902 transitions, 7765 flow. Second operand has 14 states, 14 states have (on average 254.07142857142858) internal successors, (3557), 14 states have internal predecessors, (3557), 0 states have call successors, (0), 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:18,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:18,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 330 [2025-04-30 10:28:18,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:20,498 INFO L116 PetriNetUnfolderBase]: 2323/8710 cut-off events. [2025-04-30 10:28:20,498 INFO L117 PetriNetUnfolderBase]: For 29969/30535 co-relation queries the response was YES. [2025-04-30 10:28:20,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28881 conditions, 8710 events. 2323/8710 cut-off events. For 29969/30535 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 80529 event pairs, 144 based on Foata normal form. 135/8529 useless extension candidates. Maximal degree in co-relation 28593. Up to 1942 conditions per place. [2025-04-30 10:28:20,552 INFO L140 encePairwiseOnDemand]: 294/330 looper letters, 572 selfloop transitions, 344 changer transitions 2/1236 dead transitions. [2025-04-30 10:28:20,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 1236 transitions, 13364 flow [2025-04-30 10:28:20,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:28:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:28:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5451 transitions. [2025-04-30 10:28:20,555 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7865800865800866 [2025-04-30 10:28:20,555 INFO L175 Difference]: Start difference. First operand has 442 places, 902 transitions, 7765 flow. Second operand 21 states and 5451 transitions. [2025-04-30 10:28:20,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 1236 transitions, 13364 flow [2025-04-30 10:28:20,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 1236 transitions, 13248 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:20,628 INFO L231 Difference]: Finished difference. Result has 468 places, 1065 transitions, 11419 flow [2025-04-30 10:28:20,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=7681, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=902, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=11419, PETRI_PLACES=468, PETRI_TRANSITIONS=1065} [2025-04-30 10:28:20,630 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 138 predicate places. [2025-04-30 10:28:20,630 INFO L485 AbstractCegarLoop]: Abstraction has has 468 places, 1065 transitions, 11419 flow [2025-04-30 10:28:20,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 254.07142857142858) internal successors, (3557), 14 states have internal predecessors, (3557), 0 states have call successors, (0), 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:20,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:20,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:20,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:28:20,831 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:20,831 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-30 10:28:20,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:20,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1864313352, now seen corresponding path program 4 times [2025-04-30 10:28:20,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:20,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219990119] [2025-04-30 10:28:20,833 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:28:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:20,854 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-04-30 10:28:20,891 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-04-30 10:28:20,891 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:28:20,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-04-30 10:28:22,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:22,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219990119] [2025-04-30 10:28:22,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219990119] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:28:22,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222806495] [2025-04-30 10:28:22,093 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:28:22,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:28:22,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:22,095 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:22,097 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:22,229 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-04-30 10:28:23,745 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-04-30 10:28:23,745 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:28:23,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:23,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-30 10:28:23,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:28:23,987 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:23,988 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:24,057 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-30 10:28:24,058 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:24,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-30 10:28:24,207 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 27 [2025-04-30 10:28:24,217 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:24,217 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 40 treesize of output 42 [2025-04-30 10:28:24,235 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:28:24,235 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-30 10:28:24,261 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:24,261 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-04-30 10:28:24,291 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 56 treesize of output 45 [2025-04-30 10:28:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-04-30 10:28:24,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:28:24,324 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2637) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2637) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0 1)) 0)) (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2637) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2637) |c_~#c~0.base|) (+ 3 |c_~#c~0.offset| .cse0)) 0)))) is different from false [2025-04-30 10:28:24,352 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ 3 |c_~#c~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (select |c_#race| |c_~#c~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2637) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2637) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2637) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2637) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1 1)) 0)))))) is different from false [2025-04-30 10:28:24,371 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ 3 |c_~#c~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (select |c_#race| |c_~#c~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2637) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2637) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2637) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2637) |c_~#c~0.base|) .cse2) 0)))))) is different from false [2025-04-30 10:28:24,607 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:24,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2025-04-30 10:28:24,615 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:28:24,615 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2025-04-30 10:28:24,621 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:28:24,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-04-30 10:28:24,625 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:28:24,625 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2025-04-30 10:28:24,630 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-30 10:28:24,630 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-04-30 10:28:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 1 not checked. [2025-04-30 10:28:33,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222806495] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:28:33,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:28:33,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2025-04-30 10:28:33,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024017599] [2025-04-30 10:28:33,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:28:33,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:28:33,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:33,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:28:33,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=232, Unknown=13, NotChecked=102, Total=420 [2025-04-30 10:28:33,437 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 330 [2025-04-30 10:28:33,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 1065 transitions, 11419 flow. Second operand has 21 states, 21 states have (on average 138.28571428571428) internal successors, (2904), 21 states have internal predecessors, (2904), 0 states have call successors, (0), 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:33,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:33,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 330 [2025-04-30 10:28:33,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:39,859 INFO L116 PetriNetUnfolderBase]: 7335/19878 cut-off events. [2025-04-30 10:28:39,859 INFO L117 PetriNetUnfolderBase]: For 78321/78531 co-relation queries the response was YES. [2025-04-30 10:28:40,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72792 conditions, 19878 events. 7335/19878 cut-off events. For 78321/78531 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 191423 event pairs, 1978 based on Foata normal form. 118/19146 useless extension candidates. Maximal degree in co-relation 72421. Up to 5821 conditions per place. [2025-04-30 10:28:40,117 INFO L140 encePairwiseOnDemand]: 292/330 looper letters, 959 selfloop transitions, 424 changer transitions 8/1545 dead transitions. [2025-04-30 10:28:40,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 1545 transitions, 18638 flow [2025-04-30 10:28:40,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:28:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-30 10:28:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2356 transitions. [2025-04-30 10:28:40,119 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47595959595959597 [2025-04-30 10:28:40,119 INFO L175 Difference]: Start difference. First operand has 468 places, 1065 transitions, 11419 flow. Second operand 15 states and 2356 transitions. [2025-04-30 10:28:40,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 1545 transitions, 18638 flow Killed by 15