./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b4399e58ed3ca9c75e2a61372e91a4308548a0e79a3eb4428d85990bd71242f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:26:12,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:26:12,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:26:12,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:26:12,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:26:12,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:26:12,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:26:12,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:26:12,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:26:12,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:26:12,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:26:12,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:26:12,604 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:26:12,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:26:12,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:26:12,605 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:26:12,605 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:26:12,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:26:12,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:26:12,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:26:12,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:26:12,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:26:12,606 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:26:12,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:26:12,606 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:26:12,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:26:12,606 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:26:12,606 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:26:12,606 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:26:12,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:26:12,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:26:12,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:26:12,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:26:12,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:26:12,607 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:26:12,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:26:12,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:26:12,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:26:12,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:26:12,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:26:12,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:26:12,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:26:12,608 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-jdk21/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 -> b4399e58ed3ca9c75e2a61372e91a4308548a0e79a3eb4428d85990bd71242f7 [2025-02-06 09:26:12,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:26:12,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:26:12,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:26:12,840 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:26:12,840 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:26:12,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2025-02-06 09:26:13,928 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a4428256/65b5874acf8743928a63e41824562633/FLAGf7385ed1e [2025-02-06 09:26:14,232 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:26:14,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2025-02-06 09:26:14,247 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a4428256/65b5874acf8743928a63e41824562633/FLAGf7385ed1e [2025-02-06 09:26:14,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a4428256/65b5874acf8743928a63e41824562633 [2025-02-06 09:26:14,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:26:14,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:26:14,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:26:14,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:26:14,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:26:14,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:26:14" (1/1) ... [2025-02-06 09:26:14,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5381d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14, skipping insertion in model container [2025-02-06 09:26:14,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:26:14" (1/1) ... [2025-02-06 09:26:14,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:26:14,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:26:14,549 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:26:14,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:26:14,608 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:26:14,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14 WrapperNode [2025-02-06 09:26:14,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:26:14,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:26:14,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:26:14,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:26:14,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14" (1/1) ... [2025-02-06 09:26:14,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14" (1/1) ... [2025-02-06 09:26:14,641 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2025-02-06 09:26:14,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:26:14,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:26:14,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:26:14,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:26:14,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14" (1/1) ... [2025-02-06 09:26:14,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14" (1/1) ... [2025-02-06 09:26:14,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14" (1/1) ... [2025-02-06 09:26:14,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14" (1/1) ... [2025-02-06 09:26:14,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14" (1/1) ... [2025-02-06 09:26:14,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14" (1/1) ... [2025-02-06 09:26:14,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14" (1/1) ... [2025-02-06 09:26:14,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14" (1/1) ... [2025-02-06 09:26:14,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:26:14,667 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:26:14,667 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:26:14,667 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:26:14,672 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14" (1/1) ... [2025-02-06 09:26:14,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:26:14,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:26:14,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:26:14,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:26:14,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:26:14,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:26:14,727 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:26:14,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:26:14,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:26:14,728 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:26:14,728 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:26:14,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:26:14,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:26:14,728 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:26:14,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:26:14,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:26:14,729 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:26:14,832 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:26:14,834 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:26:15,073 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 09:26:15,074 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 09:26:15,147 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:26:15,148 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:26:15,190 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:26:15,193 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:26:15,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:26:15 BoogieIcfgContainer [2025-02-06 09:26:15,193 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:26:15,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:26:15,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:26:15,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:26:15,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:26:14" (1/3) ... [2025-02-06 09:26:15,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df565dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:26:15, skipping insertion in model container [2025-02-06 09:26:15,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:26:14" (2/3) ... [2025-02-06 09:26:15,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df565dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:26:15, skipping insertion in model container [2025-02-06 09:26:15,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:26:15" (3/3) ... [2025-02-06 09:26:15,201 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_61-invariant_racing.i [2025-02-06 09:26:15,215 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:26:15,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_61-invariant_racing.i that has 2 procedures, 178 locations, 1 initial locations, 9 loop locations, and 12 error locations. [2025-02-06 09:26:15,218 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:26:15,276 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:26:15,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 196 transitions, 399 flow [2025-02-06 09:26:15,378 INFO L124 PetriNetUnfolderBase]: 28/296 cut-off events. [2025-02-06 09:26:15,380 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:26:15,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 296 events. 28/296 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1161 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 165. Up to 6 conditions per place. [2025-02-06 09:26:15,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 196 transitions, 399 flow [2025-02-06 09:26:15,394 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 196 transitions, 399 flow [2025-02-06 09:26:15,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:26:15,410 INFO L333 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;@5195f0fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:26:15,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-02-06 09:26:15,426 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:26:15,430 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2025-02-06 09:26:15,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:26:15,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:15,431 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] [2025-02-06 09:26:15,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-06 09:26:15,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:15,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1009141281, now seen corresponding path program 1 times [2025-02-06 09:26:15,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:15,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263982944] [2025-02-06 09:26:15,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:15,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:15,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 09:26:15,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 09:26:15,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:15,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:15,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:15,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263982944] [2025-02-06 09:26:15,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263982944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:15,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:15,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:15,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93646670] [2025-02-06 09:26:15,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:15,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:15,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:15,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:15,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:15,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 196 [2025-02-06 09:26:15,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 196 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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-02-06 09:26:15,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:15,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 196 [2025-02-06 09:26:15,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:15,934 INFO L124 PetriNetUnfolderBase]: 121/1235 cut-off events. [2025-02-06 09:26:15,934 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:26:15,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1508 conditions, 1235 events. 121/1235 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8064 event pairs, 0 based on Foata normal form. 189/1308 useless extension candidates. Maximal degree in co-relation 1429. Up to 256 conditions per place. [2025-02-06 09:26:15,950 INFO L140 encePairwiseOnDemand]: 177/196 looper letters, 34 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-02-06 09:26:15,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 188 transitions, 455 flow [2025-02-06 09:26:15,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2025-02-06 09:26:15,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2025-02-06 09:26:15,971 INFO L175 Difference]: Start difference. First operand has 181 places, 196 transitions, 399 flow. Second operand 3 states and 518 transitions. [2025-02-06 09:26:15,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 188 transitions, 455 flow [2025-02-06 09:26:15,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 188 transitions, 455 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:26:15,981 INFO L231 Difference]: Finished difference. Result has 182 places, 178 transitions, 371 flow [2025-02-06 09:26:15,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=182, PETRI_TRANSITIONS=178} [2025-02-06 09:26:15,986 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 1 predicate places. [2025-02-06 09:26:15,986 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 178 transitions, 371 flow [2025-02-06 09:26:15,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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-02-06 09:26:15,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:15,986 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] [2025-02-06 09:26:15,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:26:15,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-06 09:26:15,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1855914058, now seen corresponding path program 1 times [2025-02-06 09:26:15,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:15,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311102013] [2025-02-06 09:26:15,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:15,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:16,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 09:26:16,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 09:26:16,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:16,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:16,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:16,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311102013] [2025-02-06 09:26:16,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311102013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:16,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:16,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:16,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089339348] [2025-02-06 09:26:16,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:16,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:26:16,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:16,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:26:16,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:26:16,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 196 [2025-02-06 09:26:16,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 178 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 0 states have call successors, (0), 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-02-06 09:26:16,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:16,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 196 [2025-02-06 09:26:16,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:16,826 INFO L124 PetriNetUnfolderBase]: 221/1323 cut-off events. [2025-02-06 09:26:16,826 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 09:26:16,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 1323 events. 221/1323 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9031 event pairs, 20 based on Foata normal form. 0/1221 useless extension candidates. Maximal degree in co-relation 1761. Up to 369 conditions per place. [2025-02-06 09:26:16,832 INFO L140 encePairwiseOnDemand]: 190/196 looper letters, 72 selfloop transitions, 5 changer transitions 0/217 dead transitions. [2025-02-06 09:26:16,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 217 transitions, 603 flow [2025-02-06 09:26:16,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:26:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:26:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 924 transitions. [2025-02-06 09:26:16,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7857142857142857 [2025-02-06 09:26:16,835 INFO L175 Difference]: Start difference. First operand has 182 places, 178 transitions, 371 flow. Second operand 6 states and 924 transitions. [2025-02-06 09:26:16,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 217 transitions, 603 flow [2025-02-06 09:26:16,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 217 transitions, 599 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:26:16,839 INFO L231 Difference]: Finished difference. Result has 184 places, 177 transitions, 375 flow [2025-02-06 09:26:16,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=184, PETRI_TRANSITIONS=177} [2025-02-06 09:26:16,839 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 3 predicate places. [2025-02-06 09:26:16,839 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 177 transitions, 375 flow [2025-02-06 09:26:16,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 0 states have call successors, (0), 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-02-06 09:26:16,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:16,840 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] [2025-02-06 09:26:16,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:26:16,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-06 09:26:16,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1128942982, now seen corresponding path program 1 times [2025-02-06 09:26:16,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:16,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846201539] [2025-02-06 09:26:16,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:16,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:16,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:26:16,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:26:16,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:16,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:16,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:16,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846201539] [2025-02-06 09:26:16,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846201539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:16,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:16,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:26:16,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956457958] [2025-02-06 09:26:16,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:16,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:16,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:16,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:16,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:16,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 196 [2025-02-06 09:26:16,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 177 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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-02-06 09:26:16,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:16,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 196 [2025-02-06 09:26:16,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:17,173 INFO L124 PetriNetUnfolderBase]: 423/2467 cut-off events. [2025-02-06 09:26:17,174 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:26:17,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3413 conditions, 2467 events. 423/2467 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 19023 event pairs, 160 based on Foata normal form. 0/2244 useless extension candidates. Maximal degree in co-relation 3351. Up to 544 conditions per place. [2025-02-06 09:26:17,183 INFO L140 encePairwiseOnDemand]: 174/196 looper letters, 61 selfloop transitions, 16 changer transitions 0/212 dead transitions. [2025-02-06 09:26:17,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 212 transitions, 602 flow [2025-02-06 09:26:17,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2025-02-06 09:26:17,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8401360544217688 [2025-02-06 09:26:17,185 INFO L175 Difference]: Start difference. First operand has 184 places, 177 transitions, 375 flow. Second operand 3 states and 494 transitions. [2025-02-06 09:26:17,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 212 transitions, 602 flow [2025-02-06 09:26:17,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 212 transitions, 592 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:26:17,189 INFO L231 Difference]: Finished difference. Result has 183 places, 193 transitions, 505 flow [2025-02-06 09:26:17,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=505, PETRI_PLACES=183, PETRI_TRANSITIONS=193} [2025-02-06 09:26:17,190 INFO L279 CegarLoopForPetriNet]: 181 programPoint places, 2 predicate places. [2025-02-06 09:26:17,190 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 193 transitions, 505 flow [2025-02-06 09:26:17,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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-02-06 09:26:17,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:17,190 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-02-06 09:26:17,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:26:17,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-02-06 09:26:17,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:17,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1498521959, now seen corresponding path program 1 times [2025-02-06 09:26:17,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:17,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973665922] [2025-02-06 09:26:17,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:17,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:17,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:26:17,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:26:17,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:17,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:17,216 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:26:17,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:26:17,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:26:17,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:17,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:17,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:26:17,246 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:26:17,247 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-02-06 09:26:17,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-02-06 09:26:17,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-02-06 09:26:17,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-02-06 09:26:17,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-02-06 09:26:17,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-02-06 09:26:17,248 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-02-06 09:26:17,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-02-06 09:26:17,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-02-06 09:26:17,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-02-06 09:26:17,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-02-06 09:26:17,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-02-06 09:26:17,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-02-06 09:26:17,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-02-06 09:26:17,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-02-06 09:26:17,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-02-06 09:26:17,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-02-06 09:26:17,249 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-02-06 09:26:17,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:26:17,250 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 09:26:17,251 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:26:17,251 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 09:26:17,274 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:26:17,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 260 transitions, 536 flow [2025-02-06 09:26:17,338 INFO L124 PetriNetUnfolderBase]: 47/487 cut-off events. [2025-02-06 09:26:17,338 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:26:17,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 487 events. 47/487 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2199 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 298. Up to 9 conditions per place. [2025-02-06 09:26:17,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 260 transitions, 536 flow [2025-02-06 09:26:17,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 260 transitions, 536 flow [2025-02-06 09:26:17,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:26:17,344 INFO L333 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;@5195f0fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:26:17,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-06 09:26:17,347 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:26:17,347 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2025-02-06 09:26:17,347 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:26:17,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:17,347 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] [2025-02-06 09:26:17,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:26:17,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash -711478557, now seen corresponding path program 1 times [2025-02-06 09:26:17,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:17,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073264738] [2025-02-06 09:26:17,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:17,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:17,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 09:26:17,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 09:26:17,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:17,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:17,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:17,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073264738] [2025-02-06 09:26:17,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073264738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:17,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:17,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:17,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362718723] [2025-02-06 09:26:17,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:17,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:17,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:17,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:17,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:17,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 260 [2025-02-06 09:26:17,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 260 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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-02-06 09:26:17,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:17,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 260 [2025-02-06 09:26:17,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:18,567 INFO L124 PetriNetUnfolderBase]: 3074/12886 cut-off events. [2025-02-06 09:26:18,568 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-02-06 09:26:18,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17603 conditions, 12886 events. 3074/12886 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 141708 event pairs, 2580 based on Foata normal form. 3066/14666 useless extension candidates. Maximal degree in co-relation 13072. Up to 4643 conditions per place. [2025-02-06 09:26:18,636 INFO L140 encePairwiseOnDemand]: 235/260 looper letters, 47 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2025-02-06 09:26:18,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 247 transitions, 608 flow [2025-02-06 09:26:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2025-02-06 09:26:18,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8653846153846154 [2025-02-06 09:26:18,640 INFO L175 Difference]: Start difference. First operand has 239 places, 260 transitions, 536 flow. Second operand 3 states and 675 transitions. [2025-02-06 09:26:18,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 247 transitions, 608 flow [2025-02-06 09:26:18,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 247 transitions, 608 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:26:18,645 INFO L231 Difference]: Finished difference. Result has 240 places, 237 transitions, 500 flow [2025-02-06 09:26:18,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=240, PETRI_TRANSITIONS=237} [2025-02-06 09:26:18,645 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places. [2025-02-06 09:26:18,646 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 237 transitions, 500 flow [2025-02-06 09:26:18,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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-02-06 09:26:18,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:18,646 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] [2025-02-06 09:26:18,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:26:18,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:26:18,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:18,649 INFO L85 PathProgramCache]: Analyzing trace with hash 730130490, now seen corresponding path program 1 times [2025-02-06 09:26:18,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:18,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639462114] [2025-02-06 09:26:18,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:18,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:18,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 09:26:18,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 09:26:18,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:18,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:18,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:18,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639462114] [2025-02-06 09:26:18,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639462114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:18,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:18,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:18,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159667595] [2025-02-06 09:26:18,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:18,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:26:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:18,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:26:18,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:26:19,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 260 [2025-02-06 09:26:19,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 237 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 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-02-06 09:26:19,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:19,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 260 [2025-02-06 09:26:19,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:20,946 INFO L124 PetriNetUnfolderBase]: 5301/19540 cut-off events. [2025-02-06 09:26:20,946 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-02-06 09:26:20,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28294 conditions, 19540 events. 5301/19540 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 228497 event pairs, 500 based on Foata normal form. 0/18095 useless extension candidates. Maximal degree in co-relation 9584. Up to 6346 conditions per place. [2025-02-06 09:26:21,021 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 124 selfloop transitions, 6 changer transitions 0/316 dead transitions. [2025-02-06 09:26:21,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 316 transitions, 918 flow [2025-02-06 09:26:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:26:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:26:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1252 transitions. [2025-02-06 09:26:21,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8025641025641026 [2025-02-06 09:26:21,029 INFO L175 Difference]: Start difference. First operand has 240 places, 237 transitions, 500 flow. Second operand 6 states and 1252 transitions. [2025-02-06 09:26:21,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 316 transitions, 918 flow [2025-02-06 09:26:21,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 316 transitions, 916 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:26:21,036 INFO L231 Difference]: Finished difference. Result has 243 places, 236 transitions, 508 flow [2025-02-06 09:26:21,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=243, PETRI_TRANSITIONS=236} [2025-02-06 09:26:21,037 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 4 predicate places. [2025-02-06 09:26:21,037 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 236 transitions, 508 flow [2025-02-06 09:26:21,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 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-02-06 09:26:21,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:21,038 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] [2025-02-06 09:26:21,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:26:21,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:26:21,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash 692025088, now seen corresponding path program 1 times [2025-02-06 09:26:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:21,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842202425] [2025-02-06 09:26:21,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:21,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:26:21,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:26:21,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:21,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:21,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:21,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842202425] [2025-02-06 09:26:21,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842202425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:21,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:21,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:26:21,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8723580] [2025-02-06 09:26:21,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:21,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:21,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:21,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:21,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:21,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 260 [2025-02-06 09:26:21,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 236 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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-02-06 09:26:21,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:21,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 260 [2025-02-06 09:26:21,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:26,200 INFO L124 PetriNetUnfolderBase]: 23170/72774 cut-off events. [2025-02-06 09:26:26,200 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2025-02-06 09:26:26,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110085 conditions, 72774 events. 23170/72774 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 1247. Compared 957935 event pairs, 8859 based on Foata normal form. 0/65689 useless extension candidates. Maximal degree in co-relation 89349. Up to 22148 conditions per place. [2025-02-06 09:26:26,586 INFO L140 encePairwiseOnDemand]: 227/260 looper letters, 96 selfloop transitions, 24 changer transitions 0/291 dead transitions. [2025-02-06 09:26:26,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 291 transitions, 869 flow [2025-02-06 09:26:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2025-02-06 09:26:26,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2025-02-06 09:26:26,588 INFO L175 Difference]: Start difference. First operand has 243 places, 236 transitions, 508 flow. Second operand 3 states and 645 transitions. [2025-02-06 09:26:26,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 291 transitions, 869 flow [2025-02-06 09:26:26,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 291 transitions, 857 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:26:26,597 INFO L231 Difference]: Finished difference. Result has 242 places, 260 transitions, 706 flow [2025-02-06 09:26:26,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=242, PETRI_TRANSITIONS=260} [2025-02-06 09:26:26,600 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 3 predicate places. [2025-02-06 09:26:26,600 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 260 transitions, 706 flow [2025-02-06 09:26:26,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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-02-06 09:26:26,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:26,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:26:26,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:26:26,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:26:26,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:26,601 INFO L85 PathProgramCache]: Analyzing trace with hash 446252214, now seen corresponding path program 1 times [2025-02-06 09:26:26,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:26,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739046806] [2025-02-06 09:26:26,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:26,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 09:26:26,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 09:26:26,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:26,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:26,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:26,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739046806] [2025-02-06 09:26:26,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739046806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:26,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:26,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:26,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863717953] [2025-02-06 09:26:26,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:26,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:26:26,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:26,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:26:26,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:26:26,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 260 [2025-02-06 09:26:26,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 260 transitions, 706 flow. Second operand has 5 states, 5 states have (on average 198.8) internal successors, (994), 5 states have internal predecessors, (994), 0 states have call successors, (0), 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-02-06 09:26:26,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:26,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 260 [2025-02-06 09:26:26,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:31,453 INFO L124 PetriNetUnfolderBase]: 14168/62151 cut-off events. [2025-02-06 09:26:31,454 INFO L125 PetriNetUnfolderBase]: For 4350/4828 co-relation queries the response was YES. [2025-02-06 09:26:31,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94089 conditions, 62151 events. 14168/62151 cut-off events. For 4350/4828 co-relation queries the response was YES. Maximal size of possible extension queue 1075. Compared 884487 event pairs, 5943 based on Foata normal form. 11/56264 useless extension candidates. Maximal degree in co-relation 22639. Up to 15112 conditions per place. [2025-02-06 09:26:31,778 INFO L140 encePairwiseOnDemand]: 255/260 looper letters, 88 selfloop transitions, 5 changer transitions 0/312 dead transitions. [2025-02-06 09:26:31,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 312 transitions, 996 flow [2025-02-06 09:26:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:26:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:26:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1276 transitions. [2025-02-06 09:26:31,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8179487179487179 [2025-02-06 09:26:31,782 INFO L175 Difference]: Start difference. First operand has 242 places, 260 transitions, 706 flow. Second operand 6 states and 1276 transitions. [2025-02-06 09:26:31,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 312 transitions, 996 flow [2025-02-06 09:26:31,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 312 transitions, 948 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:26:31,811 INFO L231 Difference]: Finished difference. Result has 248 places, 262 transitions, 684 flow [2025-02-06 09:26:31,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=684, PETRI_PLACES=248, PETRI_TRANSITIONS=262} [2025-02-06 09:26:31,813 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 9 predicate places. [2025-02-06 09:26:31,813 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 262 transitions, 684 flow [2025-02-06 09:26:31,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 198.8) internal successors, (994), 5 states have internal predecessors, (994), 0 states have call successors, (0), 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-02-06 09:26:31,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:31,814 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] [2025-02-06 09:26:31,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:26:31,814 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:26:31,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:31,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1445128051, now seen corresponding path program 1 times [2025-02-06 09:26:31,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:31,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885992661] [2025-02-06 09:26:31,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:31,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:31,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 09:26:31,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 09:26:31,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:31,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:31,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:31,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885992661] [2025-02-06 09:26:31,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885992661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:31,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:31,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:31,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200695100] [2025-02-06 09:26:31,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:31,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:31,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:31,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:31,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:31,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 260 [2025-02-06 09:26:31,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 262 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 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-02-06 09:26:31,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:31,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 260 [2025-02-06 09:26:31,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:37,318 INFO L124 PetriNetUnfolderBase]: 17542/68208 cut-off events. [2025-02-06 09:26:37,319 INFO L125 PetriNetUnfolderBase]: For 893/1673 co-relation queries the response was YES. [2025-02-06 09:26:37,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101997 conditions, 68208 events. 17542/68208 cut-off events. For 893/1673 co-relation queries the response was YES. Maximal size of possible extension queue 1379. Compared 970572 event pairs, 8623 based on Foata normal form. 24/60949 useless extension candidates. Maximal degree in co-relation 101874. Up to 17635 conditions per place. [2025-02-06 09:26:37,789 INFO L140 encePairwiseOnDemand]: 249/260 looper letters, 70 selfloop transitions, 9 changer transitions 0/296 dead transitions. [2025-02-06 09:26:37,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 296 transitions, 912 flow [2025-02-06 09:26:37,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-02-06 09:26:37,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-02-06 09:26:37,792 INFO L175 Difference]: Start difference. First operand has 248 places, 262 transitions, 684 flow. Second operand 3 states and 663 transitions. [2025-02-06 09:26:37,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 296 transitions, 912 flow [2025-02-06 09:26:37,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 296 transitions, 906 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 09:26:37,802 INFO L231 Difference]: Finished difference. Result has 249 places, 267 transitions, 738 flow [2025-02-06 09:26:37,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=249, PETRI_TRANSITIONS=267} [2025-02-06 09:26:37,803 INFO L279 CegarLoopForPetriNet]: 239 programPoint places, 10 predicate places. [2025-02-06 09:26:37,803 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 267 transitions, 738 flow [2025-02-06 09:26:37,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 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-02-06 09:26:37,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:37,804 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 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-02-06 09:26:37,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:26:37,805 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:26:37,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:37,805 INFO L85 PathProgramCache]: Analyzing trace with hash 437161843, now seen corresponding path program 1 times [2025-02-06 09:26:37,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:37,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770161729] [2025-02-06 09:26:37,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:37,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:37,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:26:37,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:26:37,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:37,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:37,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:26:37,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:26:37,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:26:37,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:37,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:26:37,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:26:37,864 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:26:37,864 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-02-06 09:26:37,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-02-06 09:26:37,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-02-06 09:26:37,864 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-02-06 09:26:37,865 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-02-06 09:26:37,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-02-06 09:26:37,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-02-06 09:26:37,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-02-06 09:26:37,866 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-02-06 09:26:37,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:26:37,866 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-06 09:26:37,866 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 09:26:37,867 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 09:26:37,896 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:26:37,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 297 places, 324 transitions, 675 flow [2025-02-06 09:26:37,964 INFO L124 PetriNetUnfolderBase]: 69/721 cut-off events. [2025-02-06 09:26:37,964 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 09:26:37,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 721 events. 69/721 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3470 event pairs, 1 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 495. Up to 12 conditions per place. [2025-02-06 09:26:37,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 297 places, 324 transitions, 675 flow [2025-02-06 09:26:37,976 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 297 places, 324 transitions, 675 flow [2025-02-06 09:26:37,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:26:37,977 INFO L333 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;@5195f0fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:26:37,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-02-06 09:26:37,980 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:26:37,980 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2025-02-06 09:26:37,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:26:37,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:37,980 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] [2025-02-06 09:26:37,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:26:37,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:37,981 INFO L85 PathProgramCache]: Analyzing trace with hash 55913511, now seen corresponding path program 1 times [2025-02-06 09:26:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:37,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381478207] [2025-02-06 09:26:37,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:37,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:37,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 09:26:37,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 09:26:37,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:37,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:38,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:38,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381478207] [2025-02-06 09:26:38,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381478207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:38,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:38,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:26:38,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261120731] [2025-02-06 09:26:38,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:38,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:26:38,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:38,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:26:38,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:26:38,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 324 [2025-02-06 09:26:38,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 324 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 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-02-06 09:26:38,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:38,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 324 [2025-02-06 09:26:38,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:26:52,924 INFO L124 PetriNetUnfolderBase]: 52098/160670 cut-off events. [2025-02-06 09:26:52,925 INFO L125 PetriNetUnfolderBase]: For 2152/2152 co-relation queries the response was YES. [2025-02-06 09:26:53,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231496 conditions, 160670 events. 52098/160670 cut-off events. For 2152/2152 co-relation queries the response was YES. Maximal size of possible extension queue 2887. Compared 2379339 event pairs, 32391 based on Foata normal form. 44787/190769 useless extension candidates. Maximal degree in co-relation 22610. Up to 69838 conditions per place. [2025-02-06 09:26:54,163 INFO L140 encePairwiseOnDemand]: 293/324 looper letters, 59 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2025-02-06 09:26:54,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 305 transitions, 759 flow [2025-02-06 09:26:54,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:26:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:26:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions. [2025-02-06 09:26:54,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8549382716049383 [2025-02-06 09:26:54,166 INFO L175 Difference]: Start difference. First operand has 297 places, 324 transitions, 675 flow. Second operand 3 states and 831 transitions. [2025-02-06 09:26:54,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 305 transitions, 759 flow [2025-02-06 09:26:54,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 305 transitions, 759 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:26:54,171 INFO L231 Difference]: Finished difference. Result has 298 places, 295 transitions, 627 flow [2025-02-06 09:26:54,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=298, PETRI_TRANSITIONS=295} [2025-02-06 09:26:54,171 INFO L279 CegarLoopForPetriNet]: 297 programPoint places, 1 predicate places. [2025-02-06 09:26:54,172 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 295 transitions, 627 flow [2025-02-06 09:26:54,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 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-02-06 09:26:54,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:26:54,172 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] [2025-02-06 09:26:54,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:26:54,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-02-06 09:26:54,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:26:54,173 INFO L85 PathProgramCache]: Analyzing trace with hash -540456706, now seen corresponding path program 1 times [2025-02-06 09:26:54,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:26:54,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994328987] [2025-02-06 09:26:54,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:26:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:26:54,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 09:26:54,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 09:26:54,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:26:54,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:26:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:26:54,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:26:54,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994328987] [2025-02-06 09:26:54,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994328987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:26:54,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:26:54,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:26:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759744090] [2025-02-06 09:26:54,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:26:54,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:26:54,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:26:54,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:26:54,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:26:54,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 324 [2025-02-06 09:26:54,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 295 transitions, 627 flow. Second operand has 6 states, 6 states have (on average 234.5) internal successors, (1407), 6 states have internal predecessors, (1407), 0 states have call successors, (0), 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-02-06 09:26:54,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:26:54,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 324 [2025-02-06 09:26:54,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand