./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/floating_read-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/floating_read-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f28efd84e1dbcbcea7683bca483f8f3b9fbdd333eb36f517b9f12d5bccb885d --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:27:09,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:27:10,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:27:10,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:27:10,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:27:10,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:27:10,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:27:10,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:27:10,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:27:10,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:27:10,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:27:10,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:27:10,047 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:27:10,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:27:10,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:27:10,047 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:27:10,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:27:10,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:27:10,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:27:10,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:27:10,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:27:10,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:27:10,048 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:27:10,048 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:27:10,048 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:27:10,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:27:10,048 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:27:10,048 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:27:10,048 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:27:10,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:27:10,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:27:10,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:27:10,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:27:10,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:27:10,049 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:27:10,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:27:10,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:27:10,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:27:10,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:27:10,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:27:10,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:27:10,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:27:10,049 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f28efd84e1dbcbcea7683bca483f8f3b9fbdd333eb36f517b9f12d5bccb885d [2025-03-13 22:27:10,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:27:10,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:27:10,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:27:10,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:27:10,285 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:27:10,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/floating_read-5.i [2025-03-13 22:27:11,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca70ea44/1229137b463245338122a40499886cfd/FLAGd6c31567b [2025-03-13 22:27:11,608 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:27:11,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/floating_read-5.i [2025-03-13 22:27:11,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca70ea44/1229137b463245338122a40499886cfd/FLAGd6c31567b [2025-03-13 22:27:11,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca70ea44/1229137b463245338122a40499886cfd [2025-03-13 22:27:11,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:27:11,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:27:11,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:27:11,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:27:11,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:27:11,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:27:11" (1/1) ... [2025-03-13 22:27:11,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502a9161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:11, skipping insertion in model container [2025-03-13 22:27:11,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:27:11" (1/1) ... [2025-03-13 22:27:11,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:27:12,147 WARN L1731 CHandler]: Possible shadowing of function thread [2025-03-13 22:27:12,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:27:12,167 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:27:12,203 WARN L1731 CHandler]: Possible shadowing of function thread [2025-03-13 22:27:12,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:27:12,238 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:27:12,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:12 WrapperNode [2025-03-13 22:27:12,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:27:12,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:27:12,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:27:12,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:27:12,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:12" (1/1) ... [2025-03-13 22:27:12,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:12" (1/1) ... [2025-03-13 22:27:12,269 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2025-03-13 22:27:12,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:27:12,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:27:12,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:27:12,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:27:12,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:12" (1/1) ... [2025-03-13 22:27:12,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:12" (1/1) ... [2025-03-13 22:27:12,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:12" (1/1) ... [2025-03-13 22:27:12,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:12" (1/1) ... [2025-03-13 22:27:12,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:12" (1/1) ... [2025-03-13 22:27:12,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:12" (1/1) ... [2025-03-13 22:27:12,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:12" (1/1) ... [2025-03-13 22:27:12,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:12" (1/1) ... [2025-03-13 22:27:12,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:27:12,286 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:27:12,286 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:27:12,286 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:27:12,287 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:12" (1/1) ... [2025-03-13 22:27:12,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:27:12,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:27:12,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:27:12,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:27:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:27:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:27:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:27:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:27:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:27:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:27:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:27:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-13 22:27:12,330 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-13 22:27:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:27:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:27:12,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:27:12,331 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:27:12,409 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:27:12,411 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:27:12,560 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L719: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-13 22:27:12,560 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-13 22:27:12,576 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:27:12,578 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:27:12,579 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:27:12,600 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:27:12,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:27:12 BoogieIcfgContainer [2025-03-13 22:27:12,601 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:27:12,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:27:12,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:27:12,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:27:12,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:27:11" (1/3) ... [2025-03-13 22:27:12,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62128c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:27:12, skipping insertion in model container [2025-03-13 22:27:12,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:27:12" (2/3) ... [2025-03-13 22:27:12,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62128c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:27:12, skipping insertion in model container [2025-03-13 22:27:12,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:27:12" (3/3) ... [2025-03-13 22:27:12,610 INFO L128 eAbstractionObserver]: Analyzing ICFG floating_read-5.i [2025-03-13 22:27:12,622 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:27:12,624 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG floating_read-5.i that has 2 procedures, 70 locations, 1 initial locations, 2 loop locations, and 5 error locations. [2025-03-13 22:27:12,625 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:27:12,660 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:27:12,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 73 transitions, 153 flow [2025-03-13 22:27:12,723 INFO L124 PetriNetUnfolderBase]: 5/115 cut-off events. [2025-03-13 22:27:12,726 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:27:12,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 115 events. 5/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 228 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2025-03-13 22:27:12,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 73 transitions, 153 flow [2025-03-13 22:27:12,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 73 transitions, 153 flow [2025-03-13 22:27:12,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:27:12,747 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;@3bd7dcf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:27:12,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 22:27:12,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:27:12,755 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-13 22:27:12,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:27:12,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:12,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:12,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-13 22:27:12,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2044961978, now seen corresponding path program 1 times [2025-03-13 22:27:12,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:12,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7704066] [2025-03-13 22:27:12,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:12,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 22:27:12,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 22:27:12,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:12,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:12,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7704066] [2025-03-13 22:27:12,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7704066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:12,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:27:12,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599521119] [2025-03-13 22:27:12,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:12,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:27:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:12,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:27:12,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:27:12,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 73 [2025-03-13 22:27:12,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 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-03-13 22:27:12,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:12,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 73 [2025-03-13 22:27:12,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:12,938 INFO L124 PetriNetUnfolderBase]: 1/105 cut-off events. [2025-03-13 22:27:12,938 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-13 22:27:12,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 1/105 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 197 event pairs, 0 based on Foata normal form. 4/97 useless extension candidates. Maximal degree in co-relation 3. Up to 5 conditions per place. [2025-03-13 22:27:12,940 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 4 selfloop transitions, 0 changer transitions 12/67 dead transitions. [2025-03-13 22:27:12,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 149 flow [2025-03-13 22:27:12,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:27:12,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:27:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 136 transitions. [2025-03-13 22:27:12,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9315068493150684 [2025-03-13 22:27:12,950 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 153 flow. Second operand 2 states and 136 transitions. [2025-03-13 22:27:12,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 149 flow [2025-03-13 22:27:12,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 149 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:12,955 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 117 flow [2025-03-13 22:27:12,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=117, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2025-03-13 22:27:12,959 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2025-03-13 22:27:12,959 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 117 flow [2025-03-13 22:27:12,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 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-03-13 22:27:12,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:12,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:12,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:27:12,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-13 22:27:12,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:12,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1555464897, now seen corresponding path program 1 times [2025-03-13 22:27:12,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:12,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352142794] [2025-03-13 22:27:12,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:12,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:12,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:27:12,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:27:12,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:12,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:13,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:13,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:13,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352142794] [2025-03-13 22:27:13,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352142794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:13,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:13,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:27:13,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550982660] [2025-03-13 22:27:13,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:13,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:13,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:13,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:13,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:13,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 73 [2025-03-13 22:27:13,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-03-13 22:27:13,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:13,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 73 [2025-03-13 22:27:13,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:13,123 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2025-03-13 22:27:13,123 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:27:13,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 97 events. 3/97 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 2 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 115. Up to 13 conditions per place. [2025-03-13 22:27:13,124 INFO L140 encePairwiseOnDemand]: 70/73 looper letters, 8 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-03-13 22:27:13,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 139 flow [2025-03-13 22:27:13,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2025-03-13 22:27:13,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8447488584474886 [2025-03-13 22:27:13,126 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 117 flow. Second operand 3 states and 185 transitions. [2025-03-13 22:27:13,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 139 flow [2025-03-13 22:27:13,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 139 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:13,128 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 125 flow [2025-03-13 22:27:13,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2025-03-13 22:27:13,129 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2025-03-13 22:27:13,129 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 125 flow [2025-03-13 22:27:13,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-03-13 22:27:13,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:13,129 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] [2025-03-13 22:27:13,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:27:13,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-13 22:27:13,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:13,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1482560346, now seen corresponding path program 1 times [2025-03-13 22:27:13,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:13,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633419347] [2025-03-13 22:27:13,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:13,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:13,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:27:13,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:27:13,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:13,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:13,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:13,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633419347] [2025-03-13 22:27:13,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633419347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:13,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:13,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:13,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995540083] [2025-03-13 22:27:13,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:13,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:13,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:13,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:13,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:13,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 73 [2025-03-13 22:27:13,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 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-03-13 22:27:13,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:13,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 73 [2025-03-13 22:27:13,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:13,729 INFO L124 PetriNetUnfolderBase]: 12/107 cut-off events. [2025-03-13 22:27:13,730 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:27:13,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 107 events. 12/107 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 239 event pairs, 6 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 169. Up to 32 conditions per place. [2025-03-13 22:27:13,730 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 18 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2025-03-13 22:27:13,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 177 flow [2025-03-13 22:27:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 300 transitions. [2025-03-13 22:27:13,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.684931506849315 [2025-03-13 22:27:13,734 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 125 flow. Second operand 6 states and 300 transitions. [2025-03-13 22:27:13,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 58 transitions, 177 flow [2025-03-13 22:27:13,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:13,735 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 129 flow [2025-03-13 22:27:13,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-03-13 22:27:13,736 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2025-03-13 22:27:13,736 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 129 flow [2025-03-13 22:27:13,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 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-03-13 22:27:13,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:13,736 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-03-13 22:27:13,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:27:13,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-13 22:27:13,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash -677989434, now seen corresponding path program 1 times [2025-03-13 22:27:13,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:13,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136971631] [2025-03-13 22:27:13,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:13,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:13,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:27:13,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:27:13,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:13,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:13,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:13,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136971631] [2025-03-13 22:27:13,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136971631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:13,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:13,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:13,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424515073] [2025-03-13 22:27:13,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:13,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:27:13,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:13,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:27:13,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:27:13,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 73 [2025-03-13 22:27:13,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 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-03-13 22:27:13,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:13,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 73 [2025-03-13 22:27:13,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:13,865 INFO L124 PetriNetUnfolderBase]: 3/62 cut-off events. [2025-03-13 22:27:13,865 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:27:13,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 62 events. 3/62 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 2/64 useless extension candidates. Maximal degree in co-relation 94. Up to 4 conditions per place. [2025-03-13 22:27:13,865 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 7 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2025-03-13 22:27:13,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 114 flow [2025-03-13 22:27:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 348 transitions. [2025-03-13 22:27:13,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7945205479452054 [2025-03-13 22:27:13,867 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 129 flow. Second operand 6 states and 348 transitions. [2025-03-13 22:27:13,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 114 flow [2025-03-13 22:27:13,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 102 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 22:27:13,868 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 82 flow [2025-03-13 22:27:13,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2025-03-13 22:27:13,868 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, -29 predicate places. [2025-03-13 22:27:13,868 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 82 flow [2025-03-13 22:27:13,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 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-03-13 22:27:13,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:13,869 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] [2025-03-13 22:27:13,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:27:13,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-03-13 22:27:13,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:13,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1568729041, now seen corresponding path program 1 times [2025-03-13 22:27:13,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:13,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930144289] [2025-03-13 22:27:13,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:13,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:13,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 22:27:13,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 22:27:13,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:13,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:13,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:27:13,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 22:27:13,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 22:27:13,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:13,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:13,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:27:13,921 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:27:13,922 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-13 22:27:13,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-13 22:27:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-13 22:27:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-13 22:27:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-13 22:27:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-13 22:27:13,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-13 22:27:13,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:27:13,925 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-13 22:27:13,927 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:27:13,927 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:27:13,945 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:27:13,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 178 flow [2025-03-13 22:27:13,966 INFO L124 PetriNetUnfolderBase]: 9/193 cut-off events. [2025-03-13 22:27:13,966 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:27:13,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 193 events. 9/193 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 439 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 117. Up to 6 conditions per place. [2025-03-13 22:27:13,967 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 81 transitions, 178 flow [2025-03-13 22:27:13,968 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 81 transitions, 178 flow [2025-03-13 22:27:13,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:27:13,969 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;@3bd7dcf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:27:13,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-13 22:27:13,970 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:27:13,970 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-13 22:27:13,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:27:13,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:13,971 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:13,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:13,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:13,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1390887834, now seen corresponding path program 1 times [2025-03-13 22:27:13,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:13,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32608646] [2025-03-13 22:27:13,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:13,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:13,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 22:27:13,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 22:27:13,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:13,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:13,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:13,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32608646] [2025-03-13 22:27:13,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32608646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:13,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:13,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:27:13,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290702625] [2025-03-13 22:27:13,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:13,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:27:13,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:13,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:27:13,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:27:13,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 81 [2025-03-13 22:27:13,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 178 flow. Second operand has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 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-03-13 22:27:13,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:13,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 81 [2025-03-13 22:27:13,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:14,018 INFO L124 PetriNetUnfolderBase]: 7/212 cut-off events. [2025-03-13 22:27:14,018 INFO L125 PetriNetUnfolderBase]: For 26/35 co-relation queries the response was YES. [2025-03-13 22:27:14,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 212 events. 7/212 cut-off events. For 26/35 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 557 event pairs, 4 based on Foata normal form. 6/193 useless extension candidates. Maximal degree in co-relation 111. Up to 18 conditions per place. [2025-03-13 22:27:14,020 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 7 selfloop transitions, 0 changer transitions 0/74 dead transitions. [2025-03-13 22:27:14,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 178 flow [2025-03-13 22:27:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:27:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:27:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 148 transitions. [2025-03-13 22:27:14,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9135802469135802 [2025-03-13 22:27:14,021 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 178 flow. Second operand 2 states and 148 transitions. [2025-03-13 22:27:14,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 178 flow [2025-03-13 22:27:14,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 74 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:14,024 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 164 flow [2025-03-13 22:27:14,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=164, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-03-13 22:27:14,026 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -4 predicate places. [2025-03-13 22:27:14,026 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 164 flow [2025-03-13 22:27:14,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 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-03-13 22:27:14,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:14,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:14,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:27:14,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:14,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash -836850702, now seen corresponding path program 1 times [2025-03-13 22:27:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:14,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472058668] [2025-03-13 22:27:14,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:14,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:27:14,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:27:14,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:14,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:14,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:14,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472058668] [2025-03-13 22:27:14,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472058668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:14,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:14,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:27:14,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376986179] [2025-03-13 22:27:14,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:14,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:14,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:14,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:14,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:14,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 81 [2025-03-13 22:27:14,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-03-13 22:27:14,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:14,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 81 [2025-03-13 22:27:14,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:14,114 INFO L124 PetriNetUnfolderBase]: 28/370 cut-off events. [2025-03-13 22:27:14,115 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-13 22:27:14,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 370 events. 28/370 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1741 event pairs, 24 based on Foata normal form. 1/334 useless extension candidates. Maximal degree in co-relation 451. Up to 65 conditions per place. [2025-03-13 22:27:14,117 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 12 selfloop transitions, 2 changer transitions 3/76 dead transitions. [2025-03-13 22:27:14,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 198 flow [2025-03-13 22:27:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2025-03-13 22:27:14,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.831275720164609 [2025-03-13 22:27:14,118 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 164 flow. Second operand 3 states and 202 transitions. [2025-03-13 22:27:14,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 198 flow [2025-03-13 22:27:14,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 76 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:14,120 INFO L231 Difference]: Finished difference. Result has 81 places, 72 transitions, 170 flow [2025-03-13 22:27:14,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=81, PETRI_TRANSITIONS=72} [2025-03-13 22:27:14,121 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2025-03-13 22:27:14,121 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 170 flow [2025-03-13 22:27:14,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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-03-13 22:27:14,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:14,121 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] [2025-03-13 22:27:14,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:27:14,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:14,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:14,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1440163285, now seen corresponding path program 1 times [2025-03-13 22:27:14,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:14,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278722405] [2025-03-13 22:27:14,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:14,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:14,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:27:14,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:27:14,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:14,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:14,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:14,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278722405] [2025-03-13 22:27:14,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278722405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:14,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:14,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:14,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728356176] [2025-03-13 22:27:14,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:14,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:14,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:14,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:14,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2025-03-13 22:27:14,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 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-03-13 22:27:14,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:14,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2025-03-13 22:27:14,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:14,457 INFO L124 PetriNetUnfolderBase]: 77/403 cut-off events. [2025-03-13 22:27:14,457 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-13 22:27:14,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 403 events. 77/403 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2007 event pairs, 12 based on Foata normal form. 0/373 useless extension candidates. Maximal degree in co-relation 621. Up to 122 conditions per place. [2025-03-13 22:27:14,460 INFO L140 encePairwiseOnDemand]: 75/81 looper letters, 25 selfloop transitions, 6 changer transitions 2/79 dead transitions. [2025-03-13 22:27:14,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 79 transitions, 248 flow [2025-03-13 22:27:14,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:14,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 332 transitions. [2025-03-13 22:27:14,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6831275720164609 [2025-03-13 22:27:14,461 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 170 flow. Second operand 6 states and 332 transitions. [2025-03-13 22:27:14,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 79 transitions, 248 flow [2025-03-13 22:27:14,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:27:14,463 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 174 flow [2025-03-13 22:27:14,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=81, PETRI_TRANSITIONS=69} [2025-03-13 22:27:14,463 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2025-03-13 22:27:14,464 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 174 flow [2025-03-13 22:27:14,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 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-03-13 22:27:14,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:14,464 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-03-13 22:27:14,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:27:14,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:14,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:14,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1380786001, now seen corresponding path program 1 times [2025-03-13 22:27:14,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:14,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059272969] [2025-03-13 22:27:14,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:14,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:14,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:27:14,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:27:14,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:14,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:14,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:14,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059272969] [2025-03-13 22:27:14,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059272969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:14,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:14,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:14,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593911011] [2025-03-13 22:27:14,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:14,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:27:14,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:14,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:27:14,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:27:14,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 81 [2025-03-13 22:27:14,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 69 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 61.8) internal successors, (309), 5 states have internal predecessors, (309), 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-03-13 22:27:14,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:14,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 81 [2025-03-13 22:27:14,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:14,605 INFO L124 PetriNetUnfolderBase]: 28/321 cut-off events. [2025-03-13 22:27:14,605 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-13 22:27:14,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 321 events. 28/321 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1296 event pairs, 3 based on Foata normal form. 2/295 useless extension candidates. Maximal degree in co-relation 448. Up to 43 conditions per place. [2025-03-13 22:27:14,607 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 17 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-03-13 22:27:14,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 232 flow [2025-03-13 22:27:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 383 transitions. [2025-03-13 22:27:14,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7880658436213992 [2025-03-13 22:27:14,609 INFO L175 Difference]: Start difference. First operand has 81 places, 69 transitions, 174 flow. Second operand 6 states and 383 transitions. [2025-03-13 22:27:14,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 232 flow [2025-03-13 22:27:14,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 76 transitions, 220 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:14,610 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 188 flow [2025-03-13 22:27:14,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=82, PETRI_TRANSITIONS=71} [2025-03-13 22:27:14,611 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 0 predicate places. [2025-03-13 22:27:14,611 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 188 flow [2025-03-13 22:27:14,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.8) internal successors, (309), 5 states have internal predecessors, (309), 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-03-13 22:27:14,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:14,612 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-13 22:27:14,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:27:14,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:14,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1057221967, now seen corresponding path program 1 times [2025-03-13 22:27:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:14,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603661097] [2025-03-13 22:27:14,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:14,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:14,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:27:14,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:27:14,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:14,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:14,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603661097] [2025-03-13 22:27:14,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603661097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:14,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:14,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:14,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840424315] [2025-03-13 22:27:14,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:14,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:14,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:14,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:14,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:14,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 81 [2025-03-13 22:27:14,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 71 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-03-13 22:27:14,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:14,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 81 [2025-03-13 22:27:14,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:14,699 INFO L124 PetriNetUnfolderBase]: 19/335 cut-off events. [2025-03-13 22:27:14,699 INFO L125 PetriNetUnfolderBase]: For 53/62 co-relation queries the response was YES. [2025-03-13 22:27:14,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 335 events. 19/335 cut-off events. For 53/62 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1459 event pairs, 8 based on Foata normal form. 2/299 useless extension candidates. Maximal degree in co-relation 423. Up to 37 conditions per place. [2025-03-13 22:27:14,701 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 11 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-03-13 22:27:14,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 234 flow [2025-03-13 22:27:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 211 transitions. [2025-03-13 22:27:14,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8683127572016461 [2025-03-13 22:27:14,704 INFO L175 Difference]: Start difference. First operand has 82 places, 71 transitions, 188 flow. Second operand 3 states and 211 transitions. [2025-03-13 22:27:14,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 234 flow [2025-03-13 22:27:14,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 76 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:14,706 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 212 flow [2025-03-13 22:27:14,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2025-03-13 22:27:14,706 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, 2 predicate places. [2025-03-13 22:27:14,708 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 212 flow [2025-03-13 22:27:14,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-03-13 22:27:14,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:14,709 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-13 22:27:14,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:27:14,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:14,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:14,710 INFO L85 PathProgramCache]: Analyzing trace with hash 706503823, now seen corresponding path program 1 times [2025-03-13 22:27:14,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:14,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791385190] [2025-03-13 22:27:14,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:14,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:14,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:27:14,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:27:14,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:14,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 22:27:14,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:14,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791385190] [2025-03-13 22:27:14,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791385190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:14,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:14,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:27:14,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912992635] [2025-03-13 22:27:14,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:14,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:27:14,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:14,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:27:14,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:27:14,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 81 [2025-03-13 22:27:14,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 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-03-13 22:27:14,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:14,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 81 [2025-03-13 22:27:14,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:14,896 INFO L124 PetriNetUnfolderBase]: 17/146 cut-off events. [2025-03-13 22:27:14,896 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-13 22:27:14,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 146 events. 17/146 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 367 event pairs, 0 based on Foata normal form. 4/150 useless extension candidates. Maximal degree in co-relation 243. Up to 21 conditions per place. [2025-03-13 22:27:14,897 INFO L140 encePairwiseOnDemand]: 76/81 looper letters, 15 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2025-03-13 22:27:14,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 53 transitions, 202 flow [2025-03-13 22:27:14,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:27:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:27:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 563 transitions. [2025-03-13 22:27:14,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7722908093278463 [2025-03-13 22:27:14,898 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 212 flow. Second operand 9 states and 563 transitions. [2025-03-13 22:27:14,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 53 transitions, 202 flow [2025-03-13 22:27:14,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:14,900 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 132 flow [2025-03-13 22:27:14,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=132, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2025-03-13 22:27:14,900 INFO L279 CegarLoopForPetriNet]: 82 programPoint places, -19 predicate places. [2025-03-13 22:27:14,900 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 132 flow [2025-03-13 22:27:14,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 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-03-13 22:27:14,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:14,900 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] [2025-03-13 22:27:14,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:27:14,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-03-13 22:27:14,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash 933189663, now seen corresponding path program 1 times [2025-03-13 22:27:14,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:14,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862775462] [2025-03-13 22:27:14,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:14,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:14,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:27:14,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:27:14,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:14,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:14,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:27:14,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-13 22:27:14,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-13 22:27:14,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:14,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:14,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:27:14,936 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:27:14,936 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-13 22:27:14,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-03-13 22:27:14,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-03-13 22:27:14,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-03-13 22:27:14,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-03-13 22:27:14,936 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-03-13 22:27:14,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-03-13 22:27:14,937 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-03-13 22:27:14,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:27:14,937 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:14,937 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:27:14,937 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 22:27:14,952 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 22:27:14,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 89 transitions, 205 flow [2025-03-13 22:27:14,976 INFO L124 PetriNetUnfolderBase]: 16/316 cut-off events. [2025-03-13 22:27:14,976 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 22:27:14,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 316 events. 16/316 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 864 event pairs, 1 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 201. Up to 12 conditions per place. [2025-03-13 22:27:14,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 89 transitions, 205 flow [2025-03-13 22:27:14,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 89 transitions, 205 flow [2025-03-13 22:27:14,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:27:14,978 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;@3bd7dcf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:27:14,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-13 22:27:14,980 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:27:14,980 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-13 22:27:14,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:27:14,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:14,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:14,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:14,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash -865490566, now seen corresponding path program 1 times [2025-03-13 22:27:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:14,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105563836] [2025-03-13 22:27:14,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:14,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:14,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 22:27:14,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 22:27:14,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:14,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:15,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105563836] [2025-03-13 22:27:15,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105563836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:15,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:15,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:27:15,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195243551] [2025-03-13 22:27:15,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:15,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:27:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:15,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:27:15,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:27:15,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89 [2025-03-13 22:27:15,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 89 transitions, 205 flow. Second operand has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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-03-13 22:27:15,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:15,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89 [2025-03-13 22:27:15,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:15,059 INFO L124 PetriNetUnfolderBase]: 36/492 cut-off events. [2025-03-13 22:27:15,059 INFO L125 PetriNetUnfolderBase]: For 119/174 co-relation queries the response was YES. [2025-03-13 22:27:15,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 492 events. 36/492 cut-off events. For 119/174 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2155 event pairs, 27 based on Foata normal form. 9/441 useless extension candidates. Maximal degree in co-relation 303. Up to 68 conditions per place. [2025-03-13 22:27:15,062 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 10 selfloop transitions, 0 changer transitions 0/81 dead transitions. [2025-03-13 22:27:15,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 81 transitions, 209 flow [2025-03-13 22:27:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:27:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:27:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 160 transitions. [2025-03-13 22:27:15,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.898876404494382 [2025-03-13 22:27:15,063 INFO L175 Difference]: Start difference. First operand has 91 places, 89 transitions, 205 flow. Second operand 2 states and 160 transitions. [2025-03-13 22:27:15,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 81 transitions, 209 flow [2025-03-13 22:27:15,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 81 transitions, 209 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:15,064 INFO L231 Difference]: Finished difference. Result has 86 places, 81 transitions, 189 flow [2025-03-13 22:27:15,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=189, PETRI_PLACES=86, PETRI_TRANSITIONS=81} [2025-03-13 22:27:15,064 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-03-13 22:27:15,065 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 189 flow [2025-03-13 22:27:15,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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-03-13 22:27:15,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:15,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:15,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:27:15,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:15,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:15,065 INFO L85 PathProgramCache]: Analyzing trace with hash -761205717, now seen corresponding path program 1 times [2025-03-13 22:27:15,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:15,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527543537] [2025-03-13 22:27:15,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:15,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:15,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:27:15,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:27:15,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:15,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:15,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:15,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527543537] [2025-03-13 22:27:15,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527543537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:15,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:15,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:27:15,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137780864] [2025-03-13 22:27:15,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:15,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:15,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:15,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:15,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:15,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 89 [2025-03-13 22:27:15,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 81 transitions, 189 flow. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-03-13 22:27:15,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:15,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 89 [2025-03-13 22:27:15,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:15,201 INFO L124 PetriNetUnfolderBase]: 117/1051 cut-off events. [2025-03-13 22:27:15,201 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-03-13 22:27:15,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 1051 events. 117/1051 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6799 event pairs, 64 based on Foata normal form. 1/949 useless extension candidates. Maximal degree in co-relation 1318. Up to 214 conditions per place. [2025-03-13 22:27:15,208 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 15 selfloop transitions, 2 changer transitions 3/83 dead transitions. [2025-03-13 22:27:15,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 83 transitions, 229 flow [2025-03-13 22:27:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2025-03-13 22:27:15,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8127340823970037 [2025-03-13 22:27:15,210 INFO L175 Difference]: Start difference. First operand has 86 places, 81 transitions, 189 flow. Second operand 3 states and 217 transitions. [2025-03-13 22:27:15,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 83 transitions, 229 flow [2025-03-13 22:27:15,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 83 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:15,211 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 195 flow [2025-03-13 22:27:15,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2025-03-13 22:27:15,212 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -2 predicate places. [2025-03-13 22:27:15,212 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 195 flow [2025-03-13 22:27:15,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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-03-13 22:27:15,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:15,212 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] [2025-03-13 22:27:15,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:27:15,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:15,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1204972284, now seen corresponding path program 1 times [2025-03-13 22:27:15,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:15,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030960321] [2025-03-13 22:27:15,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:15,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:27:15,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:27:15,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:15,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:15,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:15,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030960321] [2025-03-13 22:27:15,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030960321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:15,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:15,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:15,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867544963] [2025-03-13 22:27:15,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:15,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:15,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:15,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:15,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:15,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 89 [2025-03-13 22:27:15,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 195 flow. Second operand has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 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-03-13 22:27:15,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:15,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 89 [2025-03-13 22:27:15,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:15,575 INFO L124 PetriNetUnfolderBase]: 312/1108 cut-off events. [2025-03-13 22:27:15,576 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-03-13 22:27:15,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1788 conditions, 1108 events. 312/1108 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6553 event pairs, 146 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 1780. Up to 415 conditions per place. [2025-03-13 22:27:15,581 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 32 selfloop transitions, 6 changer transitions 2/90 dead transitions. [2025-03-13 22:27:15,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 295 flow [2025-03-13 22:27:15,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:15,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 363 transitions. [2025-03-13 22:27:15,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6797752808988764 [2025-03-13 22:27:15,583 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 195 flow. Second operand 6 states and 363 transitions. [2025-03-13 22:27:15,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 295 flow [2025-03-13 22:27:15,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 90 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:27:15,585 INFO L231 Difference]: Finished difference. Result has 89 places, 76 transitions, 199 flow [2025-03-13 22:27:15,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=89, PETRI_TRANSITIONS=76} [2025-03-13 22:27:15,585 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -2 predicate places. [2025-03-13 22:27:15,585 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 76 transitions, 199 flow [2025-03-13 22:27:15,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 6 states have internal predecessors, (334), 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-03-13 22:27:15,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:15,586 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-03-13 22:27:15,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:27:15,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:15,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:15,587 INFO L85 PathProgramCache]: Analyzing trace with hash 277052132, now seen corresponding path program 1 times [2025-03-13 22:27:15,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:15,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240886454] [2025-03-13 22:27:15,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:15,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:15,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:27:15,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:27:15,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:15,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:15,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:15,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240886454] [2025-03-13 22:27:15,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240886454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:15,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:15,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:15,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989093318] [2025-03-13 22:27:15,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:15,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:27:15,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:15,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:27:15,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:27:15,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-13 22:27:15,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 76 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 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-03-13 22:27:15,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:15,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-13 22:27:15,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:15,776 INFO L124 PetriNetUnfolderBase]: 120/883 cut-off events. [2025-03-13 22:27:15,776 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-03-13 22:27:15,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 883 events. 120/883 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5428 event pairs, 65 based on Foata normal form. 2/799 useless extension candidates. Maximal degree in co-relation 1245. Up to 193 conditions per place. [2025-03-13 22:27:15,779 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 22 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2025-03-13 22:27:15,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 275 flow [2025-03-13 22:27:15,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions. [2025-03-13 22:27:15,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7715355805243446 [2025-03-13 22:27:15,780 INFO L175 Difference]: Start difference. First operand has 89 places, 76 transitions, 199 flow. Second operand 6 states and 412 transitions. [2025-03-13 22:27:15,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 275 flow [2025-03-13 22:27:15,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 85 transitions, 261 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:15,781 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 219 flow [2025-03-13 22:27:15,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2025-03-13 22:27:15,782 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -1 predicate places. [2025-03-13 22:27:15,782 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 219 flow [2025-03-13 22:27:15,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 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-03-13 22:27:15,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:15,782 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-13 22:27:15,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:27:15,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:15,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:15,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1732673212, now seen corresponding path program 1 times [2025-03-13 22:27:15,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:15,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752796065] [2025-03-13 22:27:15,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:15,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:15,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:27:15,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:27:15,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:15,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:15,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:15,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752796065] [2025-03-13 22:27:15,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752796065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:15,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:15,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:15,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465632859] [2025-03-13 22:27:15,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:15,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:15,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:15,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:15,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:15,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 89 [2025-03-13 22:27:15,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-03-13 22:27:15,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:15,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 89 [2025-03-13 22:27:15,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:15,929 INFO L124 PetriNetUnfolderBase]: 119/1006 cut-off events. [2025-03-13 22:27:15,929 INFO L125 PetriNetUnfolderBase]: For 230/286 co-relation queries the response was YES. [2025-03-13 22:27:15,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 1006 events. 119/1006 cut-off events. For 230/286 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6874 event pairs, 42 based on Foata normal form. 5/887 useless extension candidates. Maximal degree in co-relation 1331. Up to 162 conditions per place. [2025-03-13 22:27:15,933 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 15 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-03-13 22:27:15,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 282 flow [2025-03-13 22:27:15,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 228 transitions. [2025-03-13 22:27:15,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2025-03-13 22:27:15,934 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 219 flow. Second operand 3 states and 228 transitions. [2025-03-13 22:27:15,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 282 flow [2025-03-13 22:27:15,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 86 transitions, 276 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:15,936 INFO L231 Difference]: Finished difference. Result has 92 places, 83 transitions, 251 flow [2025-03-13 22:27:15,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=251, PETRI_PLACES=92, PETRI_TRANSITIONS=83} [2025-03-13 22:27:15,937 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2025-03-13 22:27:15,937 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 83 transitions, 251 flow [2025-03-13 22:27:15,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-03-13 22:27:15,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:15,938 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-13 22:27:15,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:27:15,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:15,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1153219631, now seen corresponding path program 1 times [2025-03-13 22:27:15,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:15,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487049763] [2025-03-13 22:27:15,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:15,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:15,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:27:15,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:27:15,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:15,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:27:16,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:16,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487049763] [2025-03-13 22:27:16,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487049763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:16,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:16,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:27:16,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279315616] [2025-03-13 22:27:16,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:16,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:27:16,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:16,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:27:16,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:27:16,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-13 22:27:16,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 83 transitions, 251 flow. Second operand has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 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-03-13 22:27:16,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:16,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-13 22:27:16,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:16,212 INFO L124 PetriNetUnfolderBase]: 175/1161 cut-off events. [2025-03-13 22:27:16,212 INFO L125 PetriNetUnfolderBase]: For 471/494 co-relation queries the response was YES. [2025-03-13 22:27:16,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 1161 events. 175/1161 cut-off events. For 471/494 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7484 event pairs, 38 based on Foata normal form. 4/1066 useless extension candidates. Maximal degree in co-relation 1864. Up to 218 conditions per place. [2025-03-13 22:27:16,217 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 30 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2025-03-13 22:27:16,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 383 flow [2025-03-13 22:27:16,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:27:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:27:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 612 transitions. [2025-03-13 22:27:16,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7640449438202247 [2025-03-13 22:27:16,218 INFO L175 Difference]: Start difference. First operand has 92 places, 83 transitions, 251 flow. Second operand 9 states and 612 transitions. [2025-03-13 22:27:16,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 383 flow [2025-03-13 22:27:16,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 97 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:16,220 INFO L231 Difference]: Finished difference. Result has 101 places, 85 transitions, 277 flow [2025-03-13 22:27:16,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=277, PETRI_PLACES=101, PETRI_TRANSITIONS=85} [2025-03-13 22:27:16,223 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 10 predicate places. [2025-03-13 22:27:16,223 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 277 flow [2025-03-13 22:27:16,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 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-03-13 22:27:16,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:16,223 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:16,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:27:16,223 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:16,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash 301700632, now seen corresponding path program 1 times [2025-03-13 22:27:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:16,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609422453] [2025-03-13 22:27:16,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:16,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:16,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:27:16,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:27:16,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:16,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:27:16,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:16,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609422453] [2025-03-13 22:27:16,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609422453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:16,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:16,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:27:16,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405205933] [2025-03-13 22:27:16,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:16,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:27:16,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:16,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:27:16,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:27:16,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2025-03-13 22:27:16,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 85 transitions, 277 flow. Second operand has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 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-03-13 22:27:16,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:16,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2025-03-13 22:27:16,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:16,495 INFO L124 PetriNetUnfolderBase]: 61/318 cut-off events. [2025-03-13 22:27:16,495 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2025-03-13 22:27:16,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 318 events. 61/318 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1254 event pairs, 0 based on Foata normal form. 8/326 useless extension candidates. Maximal degree in co-relation 646. Up to 69 conditions per place. [2025-03-13 22:27:16,496 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 26 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2025-03-13 22:27:16,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 71 transitions, 328 flow [2025-03-13 22:27:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 22:27:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 22:27:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 805 transitions. [2025-03-13 22:27:16,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7537453183520599 [2025-03-13 22:27:16,498 INFO L175 Difference]: Start difference. First operand has 101 places, 85 transitions, 277 flow. Second operand 12 states and 805 transitions. [2025-03-13 22:27:16,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 71 transitions, 328 flow [2025-03-13 22:27:16,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 71 transitions, 302 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-13 22:27:16,500 INFO L231 Difference]: Finished difference. Result has 78 places, 53 transitions, 178 flow [2025-03-13 22:27:16,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=178, PETRI_PLACES=78, PETRI_TRANSITIONS=53} [2025-03-13 22:27:16,500 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -13 predicate places. [2025-03-13 22:27:16,500 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 53 transitions, 178 flow [2025-03-13 22:27:16,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 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-03-13 22:27:16,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:16,501 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:16,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:27:16,502 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:27:16,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:16,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1683972730, now seen corresponding path program 1 times [2025-03-13 22:27:16,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:16,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380070064] [2025-03-13 22:27:16,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:16,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:16,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 22:27:16,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 22:27:16,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:16,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:16,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:27:16,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-13 22:27:16,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-13 22:27:16,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:16,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:16,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:27:16,544 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:27:16,545 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-13 22:27:16,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-13 22:27:16,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-13 22:27:16,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-13 22:27:16,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-03-13 22:27:16,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-13 22:27:16,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-13 22:27:16,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-13 22:27:16,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-13 22:27:16,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:27:16,546 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:16,547 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:27:16,547 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 22:27:16,562 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 22:27:16,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 97 transitions, 234 flow [2025-03-13 22:27:16,591 INFO L124 PetriNetUnfolderBase]: 31/531 cut-off events. [2025-03-13 22:27:16,591 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-13 22:27:16,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 531 events. 31/531 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1919 event pairs, 6 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 336. Up to 32 conditions per place. [2025-03-13 22:27:16,592 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 97 transitions, 234 flow [2025-03-13 22:27:16,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 97 transitions, 234 flow [2025-03-13 22:27:16,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:27:16,595 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;@3bd7dcf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:27:16,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-13 22:27:16,596 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:27:16,596 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-13 22:27:16,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:27:16,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:16,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:16,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:16,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash -429205926, now seen corresponding path program 1 times [2025-03-13 22:27:16,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:16,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937196271] [2025-03-13 22:27:16,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:16,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:16,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 22:27:16,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 22:27:16,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:16,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:16,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:16,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937196271] [2025-03-13 22:27:16,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937196271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:16,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:16,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:27:16,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800982301] [2025-03-13 22:27:16,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:16,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:27:16,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:16,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:27:16,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:27:16,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2025-03-13 22:27:16,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 97 transitions, 234 flow. Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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-03-13 22:27:16,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:16,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2025-03-13 22:27:16,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:16,714 INFO L124 PetriNetUnfolderBase]: 157/1308 cut-off events. [2025-03-13 22:27:16,714 INFO L125 PetriNetUnfolderBase]: For 498/783 co-relation queries the response was YES. [2025-03-13 22:27:16,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 1308 events. 157/1308 cut-off events. For 498/783 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 8587 event pairs, 128 based on Foata normal form. 17/1160 useless extension candidates. Maximal degree in co-relation 947. Up to 250 conditions per place. [2025-03-13 22:27:16,719 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 13 selfloop transitions, 0 changer transitions 0/88 dead transitions. [2025-03-13 22:27:16,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 242 flow [2025-03-13 22:27:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:27:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:27:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 172 transitions. [2025-03-13 22:27:16,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8865979381443299 [2025-03-13 22:27:16,720 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 234 flow. Second operand 2 states and 172 transitions. [2025-03-13 22:27:16,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 242 flow [2025-03-13 22:27:16,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 88 transitions, 242 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:16,722 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 216 flow [2025-03-13 22:27:16,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=216, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2025-03-13 22:27:16,722 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -6 predicate places. [2025-03-13 22:27:16,722 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 216 flow [2025-03-13 22:27:16,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 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-03-13 22:27:16,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:16,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:16,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:27:16,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:16,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:16,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1782399852, now seen corresponding path program 1 times [2025-03-13 22:27:16,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:16,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069960967] [2025-03-13 22:27:16,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:16,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:16,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:27:16,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:27:16,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:16,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:16,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:16,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069960967] [2025-03-13 22:27:16,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069960967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:16,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:16,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:27:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417084467] [2025-03-13 22:27:16,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:16,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:16,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:16,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:16,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:16,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 97 [2025-03-13 22:27:16,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-03-13 22:27:16,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:16,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 97 [2025-03-13 22:27:16,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:16,952 INFO L124 PetriNetUnfolderBase]: 422/2882 cut-off events. [2025-03-13 22:27:16,952 INFO L125 PetriNetUnfolderBase]: For 531/531 co-relation queries the response was YES. [2025-03-13 22:27:16,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 2882 events. 422/2882 cut-off events. For 531/531 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 23834 event pairs, 278 based on Foata normal form. 1/2616 useless extension candidates. Maximal degree in co-relation 3731. Up to 675 conditions per place. [2025-03-13 22:27:16,961 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 18 selfloop transitions, 2 changer transitions 3/90 dead transitions. [2025-03-13 22:27:16,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 90 transitions, 262 flow [2025-03-13 22:27:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2025-03-13 22:27:16,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7972508591065293 [2025-03-13 22:27:16,962 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 216 flow. Second operand 3 states and 232 transitions. [2025-03-13 22:27:16,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 90 transitions, 262 flow [2025-03-13 22:27:16,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 90 transitions, 262 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:16,964 INFO L231 Difference]: Finished difference. Result has 97 places, 86 transitions, 222 flow [2025-03-13 22:27:16,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=97, PETRI_TRANSITIONS=86} [2025-03-13 22:27:16,964 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -3 predicate places. [2025-03-13 22:27:16,964 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 86 transitions, 222 flow [2025-03-13 22:27:16,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-03-13 22:27:16,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:16,965 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] [2025-03-13 22:27:16,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:27:16,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:16,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:16,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2106833947, now seen corresponding path program 1 times [2025-03-13 22:27:16,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:16,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228678771] [2025-03-13 22:27:16,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:16,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:16,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:27:16,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:27:16,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:16,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:17,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:17,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228678771] [2025-03-13 22:27:17,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228678771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:17,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:17,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:17,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397595241] [2025-03-13 22:27:17,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:17,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:17,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:17,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:17,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:17,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 97 [2025-03-13 22:27:17,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 86 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 59.666666666666664) internal successors, (358), 6 states have internal predecessors, (358), 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-03-13 22:27:17,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:17,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 97 [2025-03-13 22:27:17,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:17,436 INFO L124 PetriNetUnfolderBase]: 1099/3285 cut-off events. [2025-03-13 22:27:17,437 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2025-03-13 22:27:17,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5364 conditions, 3285 events. 1099/3285 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 24333 event pairs, 150 based on Foata normal form. 0/3063 useless extension candidates. Maximal degree in co-relation 5355. Up to 1372 conditions per place. [2025-03-13 22:27:17,455 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 39 selfloop transitions, 6 changer transitions 2/101 dead transitions. [2025-03-13 22:27:17,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 101 transitions, 344 flow [2025-03-13 22:27:17,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2025-03-13 22:27:17,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6769759450171822 [2025-03-13 22:27:17,458 INFO L175 Difference]: Start difference. First operand has 97 places, 86 transitions, 222 flow. Second operand 6 states and 394 transitions. [2025-03-13 22:27:17,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 101 transitions, 344 flow [2025-03-13 22:27:17,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:27:17,460 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 226 flow [2025-03-13 22:27:17,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2025-03-13 22:27:17,460 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -3 predicate places. [2025-03-13 22:27:17,460 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 226 flow [2025-03-13 22:27:17,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.666666666666664) internal successors, (358), 6 states have internal predecessors, (358), 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-03-13 22:27:17,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:17,461 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-03-13 22:27:17,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:27:17,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:17,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:17,462 INFO L85 PathProgramCache]: Analyzing trace with hash 305776255, now seen corresponding path program 1 times [2025-03-13 22:27:17,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:17,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942807950] [2025-03-13 22:27:17,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:17,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:17,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:27:17,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:27:17,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:17,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:17,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:17,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942807950] [2025-03-13 22:27:17,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942807950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:17,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:17,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:17,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696739] [2025-03-13 22:27:17,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:17,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:27:17,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:17,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:27:17,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:27:17,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-13 22:27:17,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 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-03-13 22:27:17,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:17,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-13 22:27:17,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:17,718 INFO L124 PetriNetUnfolderBase]: 408/2431 cut-off events. [2025-03-13 22:27:17,719 INFO L125 PetriNetUnfolderBase]: For 561/561 co-relation queries the response was YES. [2025-03-13 22:27:17,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3465 conditions, 2431 events. 408/2431 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 19031 event pairs, 167 based on Foata normal form. 2/2189 useless extension candidates. Maximal degree in co-relation 3456. Up to 615 conditions per place. [2025-03-13 22:27:17,729 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 25 selfloop transitions, 5 changer transitions 0/92 dead transitions. [2025-03-13 22:27:17,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 92 transitions, 308 flow [2025-03-13 22:27:17,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2025-03-13 22:27:17,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7542955326460481 [2025-03-13 22:27:17,731 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 226 flow. Second operand 6 states and 439 transitions. [2025-03-13 22:27:17,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 92 transitions, 308 flow [2025-03-13 22:27:17,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 92 transitions, 294 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:17,733 INFO L231 Difference]: Finished difference. Result has 98 places, 86 transitions, 246 flow [2025-03-13 22:27:17,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=98, PETRI_TRANSITIONS=86} [2025-03-13 22:27:17,733 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -2 predicate places. [2025-03-13 22:27:17,733 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 86 transitions, 246 flow [2025-03-13 22:27:17,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 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-03-13 22:27:17,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:17,734 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-13 22:27:17,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:27:17,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:17,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1807685937, now seen corresponding path program 1 times [2025-03-13 22:27:17,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:17,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022032172] [2025-03-13 22:27:17,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:17,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:27:17,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:27:17,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:17,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:17,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:17,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022032172] [2025-03-13 22:27:17,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022032172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:17,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:17,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:17,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411970139] [2025-03-13 22:27:17,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:17,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:17,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:17,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:17,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:17,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 97 [2025-03-13 22:27:17,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 86 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-03-13 22:27:17,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:17,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 97 [2025-03-13 22:27:17,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:17,952 INFO L124 PetriNetUnfolderBase]: 488/2976 cut-off events. [2025-03-13 22:27:17,952 INFO L125 PetriNetUnfolderBase]: For 886/1127 co-relation queries the response was YES. [2025-03-13 22:27:17,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4079 conditions, 2976 events. 488/2976 cut-off events. For 886/1127 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 25732 event pairs, 185 based on Foata normal form. 9/2617 useless extension candidates. Maximal degree in co-relation 4067. Up to 580 conditions per place. [2025-03-13 22:27:17,970 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 19 selfloop transitions, 6 changer transitions 0/95 dead transitions. [2025-03-13 22:27:17,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 326 flow [2025-03-13 22:27:17,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2025-03-13 22:27:17,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8419243986254296 [2025-03-13 22:27:17,972 INFO L175 Difference]: Start difference. First operand has 98 places, 86 transitions, 246 flow. Second operand 3 states and 245 transitions. [2025-03-13 22:27:17,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 326 flow [2025-03-13 22:27:17,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 95 transitions, 320 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:17,975 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 286 flow [2025-03-13 22:27:17,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2025-03-13 22:27:17,975 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 0 predicate places. [2025-03-13 22:27:17,976 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 286 flow [2025-03-13 22:27:17,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-03-13 22:27:17,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:17,976 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-13 22:27:17,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:27:17,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:17,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1820739487, now seen corresponding path program 1 times [2025-03-13 22:27:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:17,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238554892] [2025-03-13 22:27:17,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:17,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:17,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:27:17,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:27:17,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:17,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:18,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:18,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238554892] [2025-03-13 22:27:18,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238554892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:18,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:18,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:27:18,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938171588] [2025-03-13 22:27:18,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:18,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:27:18,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:18,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:27:18,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:27:18,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-13 22:27:18,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 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-03-13 22:27:18,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:18,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-13 22:27:18,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:18,349 INFO L124 PetriNetUnfolderBase]: 704/3434 cut-off events. [2025-03-13 22:27:18,350 INFO L125 PetriNetUnfolderBase]: For 1807/1906 co-relation queries the response was YES. [2025-03-13 22:27:18,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 3434 events. 704/3434 cut-off events. For 1807/1906 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 29815 event pairs, 204 based on Foata normal form. 4/3127 useless extension candidates. Maximal degree in co-relation 5851. Up to 942 conditions per place. [2025-03-13 22:27:18,365 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 36 selfloop transitions, 8 changer transitions 0/107 dead transitions. [2025-03-13 22:27:18,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 107 transitions, 440 flow [2025-03-13 22:27:18,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:27:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:27:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 653 transitions. [2025-03-13 22:27:18,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7479954180985109 [2025-03-13 22:27:18,367 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 286 flow. Second operand 9 states and 653 transitions. [2025-03-13 22:27:18,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 107 transitions, 440 flow [2025-03-13 22:27:18,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 107 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:18,371 INFO L231 Difference]: Finished difference. Result has 109 places, 94 transitions, 318 flow [2025-03-13 22:27:18,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=318, PETRI_PLACES=109, PETRI_TRANSITIONS=94} [2025-03-13 22:27:18,372 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2025-03-13 22:27:18,372 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 94 transitions, 318 flow [2025-03-13 22:27:18,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 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-03-13 22:27:18,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:18,373 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:18,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 22:27:18,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:18,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:18,373 INFO L85 PathProgramCache]: Analyzing trace with hash -982004368, now seen corresponding path program 1 times [2025-03-13 22:27:18,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:18,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062318239] [2025-03-13 22:27:18,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:18,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:18,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:27:18,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:27:18,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:18,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:18,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:18,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062318239] [2025-03-13 22:27:18,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062318239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:18,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:18,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:27:18,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274378105] [2025-03-13 22:27:18,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:18,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:27:18,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:18,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:27:18,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:27:18,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2025-03-13 22:27:18,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 94 transitions, 318 flow. Second operand has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 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-03-13 22:27:18,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:18,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2025-03-13 22:27:18,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:18,814 INFO L124 PetriNetUnfolderBase]: 616/3345 cut-off events. [2025-03-13 22:27:18,814 INFO L125 PetriNetUnfolderBase]: For 1632/1708 co-relation queries the response was YES. [2025-03-13 22:27:18,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5455 conditions, 3345 events. 616/3345 cut-off events. For 1632/1708 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 28226 event pairs, 119 based on Foata normal form. 8/3038 useless extension candidates. Maximal degree in co-relation 5439. Up to 711 conditions per place. [2025-03-13 22:27:18,831 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 44 selfloop transitions, 11 changer transitions 0/118 dead transitions. [2025-03-13 22:27:18,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 528 flow [2025-03-13 22:27:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 22:27:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 22:27:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 868 transitions. [2025-03-13 22:27:18,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7457044673539519 [2025-03-13 22:27:18,833 INFO L175 Difference]: Start difference. First operand has 109 places, 94 transitions, 318 flow. Second operand 12 states and 868 transitions. [2025-03-13 22:27:18,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 528 flow [2025-03-13 22:27:18,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 118 transitions, 510 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:18,837 INFO L231 Difference]: Finished difference. Result has 118 places, 96 transitions, 346 flow [2025-03-13 22:27:18,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=346, PETRI_PLACES=118, PETRI_TRANSITIONS=96} [2025-03-13 22:27:18,837 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 18 predicate places. [2025-03-13 22:27:18,837 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 96 transitions, 346 flow [2025-03-13 22:27:18,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 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-03-13 22:27:18,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:18,838 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 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-03-13 22:27:18,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 22:27:18,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:18,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash -899112098, now seen corresponding path program 1 times [2025-03-13 22:27:18,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:18,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679096799] [2025-03-13 22:27:18,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:18,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:18,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 22:27:18,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 22:27:18,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:18,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:18,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:18,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679096799] [2025-03-13 22:27:18,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679096799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:18,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:18,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 22:27:18,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269224035] [2025-03-13 22:27:18,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:18,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:27:18,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:18,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:27:18,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:27:19,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 97 [2025-03-13 22:27:19,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 96 transitions, 346 flow. Second operand has 11 states, 11 states have (on average 69.36363636363636) internal successors, (763), 11 states have internal predecessors, (763), 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-03-13 22:27:19,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:19,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 97 [2025-03-13 22:27:19,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:19,160 INFO L124 PetriNetUnfolderBase]: 230/765 cut-off events. [2025-03-13 22:27:19,161 INFO L125 PetriNetUnfolderBase]: For 869/869 co-relation queries the response was YES. [2025-03-13 22:27:19,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1789 conditions, 765 events. 230/765 cut-off events. For 869/869 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3929 event pairs, 0 based on Foata normal form. 16/781 useless extension candidates. Maximal degree in co-relation 1770. Up to 246 conditions per place. [2025-03-13 22:27:19,164 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 45 selfloop transitions, 13 changer transitions 0/96 dead transitions. [2025-03-13 22:27:19,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 96 transitions, 486 flow [2025-03-13 22:27:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 22:27:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 22:27:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1064 transitions. [2025-03-13 22:27:19,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7312714776632302 [2025-03-13 22:27:19,166 INFO L175 Difference]: Start difference. First operand has 118 places, 96 transitions, 346 flow. Second operand 15 states and 1064 transitions. [2025-03-13 22:27:19,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 96 transitions, 486 flow [2025-03-13 22:27:19,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 96 transitions, 442 flow, removed 10 selfloop flow, removed 12 redundant places. [2025-03-13 22:27:19,169 INFO L231 Difference]: Finished difference. Result has 94 places, 62 transitions, 224 flow [2025-03-13 22:27:19,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=224, PETRI_PLACES=94, PETRI_TRANSITIONS=62} [2025-03-13 22:27:19,169 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -6 predicate places. [2025-03-13 22:27:19,169 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 62 transitions, 224 flow [2025-03-13 22:27:19,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 69.36363636363636) internal successors, (763), 11 states have internal predecessors, (763), 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-03-13 22:27:19,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:19,170 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:19,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-13 22:27:19,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-03-13 22:27:19,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:19,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1826313890, now seen corresponding path program 1 times [2025-03-13 22:27:19,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:19,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300735626] [2025-03-13 22:27:19,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:19,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:19,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-13 22:27:19,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-13 22:27:19,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:19,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:19,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:27:19,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-13 22:27:19,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-13 22:27:19,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:19,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:19,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:27:19,212 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:27:19,212 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-13 22:27:19,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-13 22:27:19,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-13 22:27:19,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-13 22:27:19,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-13 22:27:19,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-13 22:27:19,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-13 22:27:19,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-13 22:27:19,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-13 22:27:19,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-13 22:27:19,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-13 22:27:19,213 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:19,214 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:27:19,214 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-13 22:27:19,234 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-03-13 22:27:19,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 105 transitions, 265 flow [2025-03-13 22:27:19,274 INFO L124 PetriNetUnfolderBase]: 66/934 cut-off events. [2025-03-13 22:27:19,274 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-13 22:27:19,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 934 events. 66/934 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4457 event pairs, 23 based on Foata normal form. 0/834 useless extension candidates. Maximal degree in co-relation 576. Up to 80 conditions per place. [2025-03-13 22:27:19,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 105 transitions, 265 flow [2025-03-13 22:27:19,278 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 105 transitions, 265 flow [2025-03-13 22:27:19,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:27:19,279 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;@3bd7dcf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:27:19,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-13 22:27:19,280 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:27:19,280 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-13 22:27:19,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:27:19,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:19,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:19,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:19,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1595225542, now seen corresponding path program 1 times [2025-03-13 22:27:19,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:19,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450912951] [2025-03-13 22:27:19,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:19,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:19,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 22:27:19,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 22:27:19,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:19,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:19,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:19,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450912951] [2025-03-13 22:27:19,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450912951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:19,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:19,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:27:19,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445628483] [2025-03-13 22:27:19,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:19,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:27:19,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:19,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:27:19,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:27:19,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 105 [2025-03-13 22:27:19,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 105 transitions, 265 flow. Second operand has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 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-03-13 22:27:19,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:19,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 105 [2025-03-13 22:27:19,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:19,542 INFO L124 PetriNetUnfolderBase]: 622/3788 cut-off events. [2025-03-13 22:27:19,542 INFO L125 PetriNetUnfolderBase]: For 1716/3022 co-relation queries the response was YES. [2025-03-13 22:27:19,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 3788 events. 622/3788 cut-off events. For 1716/3022 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 33627 event pairs, 527 based on Foata normal form. 41/3338 useless extension candidates. Maximal degree in co-relation 3055. Up to 892 conditions per place. [2025-03-13 22:27:19,558 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 16 selfloop transitions, 0 changer transitions 0/95 dead transitions. [2025-03-13 22:27:19,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 95 transitions, 277 flow [2025-03-13 22:27:19,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:27:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:27:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2025-03-13 22:27:19,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2025-03-13 22:27:19,559 INFO L175 Difference]: Start difference. First operand has 109 places, 105 transitions, 265 flow. Second operand 2 states and 184 transitions. [2025-03-13 22:27:19,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 95 transitions, 277 flow [2025-03-13 22:27:19,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 95 transitions, 277 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:19,561 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 245 flow [2025-03-13 22:27:19,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=245, PETRI_PLACES=102, PETRI_TRANSITIONS=95} [2025-03-13 22:27:19,562 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -7 predicate places. [2025-03-13 22:27:19,562 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 245 flow [2025-03-13 22:27:19,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 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-03-13 22:27:19,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:19,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:19,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-13 22:27:19,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:19,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1795968587, now seen corresponding path program 1 times [2025-03-13 22:27:19,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:19,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65272959] [2025-03-13 22:27:19,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:19,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:19,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 22:27:19,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 22:27:19,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:19,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:19,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:19,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65272959] [2025-03-13 22:27:19,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65272959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:19,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:19,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:27:19,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218314895] [2025-03-13 22:27:19,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:19,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:19,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:19,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:19,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:19,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 105 [2025-03-13 22:27:19,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 95 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-03-13 22:27:19,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:19,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 105 [2025-03-13 22:27:19,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:20,077 INFO L124 PetriNetUnfolderBase]: 1439/8085 cut-off events. [2025-03-13 22:27:20,077 INFO L125 PetriNetUnfolderBase]: For 1886/1886 co-relation queries the response was YES. [2025-03-13 22:27:20,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10772 conditions, 8085 events. 1439/8085 cut-off events. For 1886/1886 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 81631 event pairs, 1050 based on Foata normal form. 1/7383 useless extension candidates. Maximal degree in co-relation 10764. Up to 2112 conditions per place. [2025-03-13 22:27:20,104 INFO L140 encePairwiseOnDemand]: 102/105 looper letters, 21 selfloop transitions, 2 changer transitions 3/97 dead transitions. [2025-03-13 22:27:20,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 97 transitions, 297 flow [2025-03-13 22:27:20,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2025-03-13 22:27:20,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7841269841269841 [2025-03-13 22:27:20,106 INFO L175 Difference]: Start difference. First operand has 102 places, 95 transitions, 245 flow. Second operand 3 states and 247 transitions. [2025-03-13 22:27:20,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 97 transitions, 297 flow [2025-03-13 22:27:20,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 97 transitions, 297 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:27:20,107 INFO L231 Difference]: Finished difference. Result has 105 places, 93 transitions, 251 flow [2025-03-13 22:27:20,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=251, PETRI_PLACES=105, PETRI_TRANSITIONS=93} [2025-03-13 22:27:20,108 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -4 predicate places. [2025-03-13 22:27:20,108 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 93 transitions, 251 flow [2025-03-13 22:27:20,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 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-03-13 22:27:20,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:20,108 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] [2025-03-13 22:27:20,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-13 22:27:20,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:20,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:20,108 INFO L85 PathProgramCache]: Analyzing trace with hash 149219022, now seen corresponding path program 1 times [2025-03-13 22:27:20,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:20,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322728464] [2025-03-13 22:27:20,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:20,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:20,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:27:20,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:27:20,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:20,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:20,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:20,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322728464] [2025-03-13 22:27:20,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322728464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:20,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:20,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:20,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625088690] [2025-03-13 22:27:20,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:20,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:27:20,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:20,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:27:20,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:27:20,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 105 [2025-03-13 22:27:20,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 93 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 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-03-13 22:27:20,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:20,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 105 [2025-03-13 22:27:20,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:20,886 INFO L124 PetriNetUnfolderBase]: 3704/9558 cut-off events. [2025-03-13 22:27:20,886 INFO L125 PetriNetUnfolderBase]: For 1820/1820 co-relation queries the response was YES. [2025-03-13 22:27:20,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15928 conditions, 9558 events. 3704/9558 cut-off events. For 1820/1820 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 81065 event pairs, 460 based on Foata normal form. 0/8948 useless extension candidates. Maximal degree in co-relation 15918. Up to 4549 conditions per place. [2025-03-13 22:27:20,920 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 46 selfloop transitions, 6 changer transitions 2/112 dead transitions. [2025-03-13 22:27:20,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 112 transitions, 395 flow [2025-03-13 22:27:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 425 transitions. [2025-03-13 22:27:20,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2025-03-13 22:27:20,922 INFO L175 Difference]: Start difference. First operand has 105 places, 93 transitions, 251 flow. Second operand 6 states and 425 transitions. [2025-03-13 22:27:20,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 112 transitions, 395 flow [2025-03-13 22:27:20,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 112 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:27:20,924 INFO L231 Difference]: Finished difference. Result has 105 places, 90 transitions, 255 flow [2025-03-13 22:27:20,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=105, PETRI_TRANSITIONS=90} [2025-03-13 22:27:20,924 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -4 predicate places. [2025-03-13 22:27:20,924 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 90 transitions, 255 flow [2025-03-13 22:27:20,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 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-03-13 22:27:20,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:20,924 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-03-13 22:27:20,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-13 22:27:20,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:20,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1466958370, now seen corresponding path program 1 times [2025-03-13 22:27:20,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:20,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183660979] [2025-03-13 22:27:20,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:20,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:20,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:27:20,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:27:20,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:20,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183660979] [2025-03-13 22:27:20,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183660979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:20,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:20,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:27:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529572587] [2025-03-13 22:27:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:20,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:27:20,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:20,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:27:20,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:27:20,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-13 22:27:20,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 90 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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-03-13 22:27:20,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:20,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-13 22:27:20,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:21,414 INFO L124 PetriNetUnfolderBase]: 1288/6671 cut-off events. [2025-03-13 22:27:21,414 INFO L125 PetriNetUnfolderBase]: For 1950/1950 co-relation queries the response was YES. [2025-03-13 22:27:21,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9525 conditions, 6671 events. 1288/6671 cut-off events. For 1950/1950 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 63414 event pairs, 682 based on Foata normal form. 2/6013 useless extension candidates. Maximal degree in co-relation 9515. Up to 1817 conditions per place. [2025-03-13 22:27:21,435 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 28 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-03-13 22:27:21,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 99 transitions, 343 flow [2025-03-13 22:27:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:27:21,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:27:21,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 466 transitions. [2025-03-13 22:27:21,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7396825396825397 [2025-03-13 22:27:21,436 INFO L175 Difference]: Start difference. First operand has 105 places, 90 transitions, 255 flow. Second operand 6 states and 466 transitions. [2025-03-13 22:27:21,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 99 transitions, 343 flow [2025-03-13 22:27:21,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 99 transitions, 329 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:21,438 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 275 flow [2025-03-13 22:27:21,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2025-03-13 22:27:21,440 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -3 predicate places. [2025-03-13 22:27:21,440 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 275 flow [2025-03-13 22:27:21,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 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-03-13 22:27:21,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:21,440 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-13 22:27:21,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-13 22:27:21,440 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:21,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:21,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1282260142, now seen corresponding path program 1 times [2025-03-13 22:27:21,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:21,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933543804] [2025-03-13 22:27:21,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:21,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:21,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:27:21,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:27:21,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:21,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:21,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:21,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933543804] [2025-03-13 22:27:21,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933543804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:21,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:21,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:27:21,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564981101] [2025-03-13 22:27:21,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:21,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:27:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:21,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:27:21,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:27:21,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 105 [2025-03-13 22:27:21,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 93 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-03-13 22:27:21,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:21,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 105 [2025-03-13 22:27:21,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:22,120 INFO L124 PetriNetUnfolderBase]: 1754/8829 cut-off events. [2025-03-13 22:27:22,120 INFO L125 PetriNetUnfolderBase]: For 3134/3973 co-relation queries the response was YES. [2025-03-13 22:27:22,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12392 conditions, 8829 events. 1754/8829 cut-off events. For 3134/3973 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 92476 event pairs, 727 based on Foata normal form. 14/7777 useless extension candidates. Maximal degree in co-relation 12379. Up to 1919 conditions per place. [2025-03-13 22:27:22,160 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 23 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2025-03-13 22:27:22,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 104 transitions, 372 flow [2025-03-13 22:27:22,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:27:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:27:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-13 22:27:22,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8317460317460318 [2025-03-13 22:27:22,161 INFO L175 Difference]: Start difference. First operand has 106 places, 93 transitions, 275 flow. Second operand 3 states and 262 transitions. [2025-03-13 22:27:22,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 104 transitions, 372 flow [2025-03-13 22:27:22,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 366 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:22,165 INFO L231 Difference]: Finished difference. Result has 108 places, 99 transitions, 323 flow [2025-03-13 22:27:22,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=108, PETRI_TRANSITIONS=99} [2025-03-13 22:27:22,165 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, -1 predicate places. [2025-03-13 22:27:22,165 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 99 transitions, 323 flow [2025-03-13 22:27:22,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-03-13 22:27:22,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:22,166 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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] [2025-03-13 22:27:22,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-13 22:27:22,166 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:22,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:22,166 INFO L85 PathProgramCache]: Analyzing trace with hash 375115155, now seen corresponding path program 1 times [2025-03-13 22:27:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:22,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310933447] [2025-03-13 22:27:22,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:22,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:22,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 22:27:22,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 22:27:22,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:22,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:22,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:22,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310933447] [2025-03-13 22:27:22,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310933447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:22,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:22,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 22:27:22,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12216614] [2025-03-13 22:27:22,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:22,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-13 22:27:22,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:22,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-13 22:27:22,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-13 22:27:22,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-13 22:27:22,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 99 transitions, 323 flow. Second operand has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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-03-13 22:27:22,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:22,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-13 22:27:22,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:22,952 INFO L124 PetriNetUnfolderBase]: 2370/9833 cut-off events. [2025-03-13 22:27:22,952 INFO L125 PetriNetUnfolderBase]: For 6093/6429 co-relation queries the response was YES. [2025-03-13 22:27:22,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17304 conditions, 9833 events. 2370/9833 cut-off events. For 6093/6429 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 99796 event pairs, 612 based on Foata normal form. 4/8888 useless extension candidates. Maximal degree in co-relation 17290. Up to 3107 conditions per place. [2025-03-13 22:27:23,006 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 40 selfloop transitions, 8 changer transitions 0/115 dead transitions. [2025-03-13 22:27:23,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 485 flow [2025-03-13 22:27:23,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:27:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:27:23,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 692 transitions. [2025-03-13 22:27:23,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7322751322751323 [2025-03-13 22:27:23,007 INFO L175 Difference]: Start difference. First operand has 108 places, 99 transitions, 323 flow. Second operand 9 states and 692 transitions. [2025-03-13 22:27:23,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 485 flow [2025-03-13 22:27:23,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:27:23,014 INFO L231 Difference]: Finished difference. Result has 117 places, 102 transitions, 353 flow [2025-03-13 22:27:23,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=353, PETRI_PLACES=117, PETRI_TRANSITIONS=102} [2025-03-13 22:27:23,015 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places. [2025-03-13 22:27:23,015 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 102 transitions, 353 flow [2025-03-13 22:27:23,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.0) internal successors, (518), 7 states have internal predecessors, (518), 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-03-13 22:27:23,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:23,015 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:23,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-13 22:27:23,015 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:23,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash 771075912, now seen corresponding path program 1 times [2025-03-13 22:27:23,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:23,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251910186] [2025-03-13 22:27:23,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:23,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-13 22:27:23,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-13 22:27:23,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:23,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:23,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:23,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251910186] [2025-03-13 22:27:23,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251910186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:23,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:23,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:27:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867866961] [2025-03-13 22:27:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:23,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:27:23,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:23,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:27:23,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:27:23,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 105 [2025-03-13 22:27:23,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 102 transitions, 353 flow. Second operand has 9 states, 9 states have (on average 74.0) internal successors, (666), 9 states have internal predecessors, (666), 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-03-13 22:27:23,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:23,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 105 [2025-03-13 22:27:23,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:23,886 INFO L124 PetriNetUnfolderBase]: 2282/9728 cut-off events. [2025-03-13 22:27:23,886 INFO L125 PetriNetUnfolderBase]: For 5449/5762 co-relation queries the response was YES. [2025-03-13 22:27:23,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16535 conditions, 9728 events. 2282/9728 cut-off events. For 5449/5762 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 100591 event pairs, 461 based on Foata normal form. 8/8764 useless extension candidates. Maximal degree in co-relation 16518. Up to 2876 conditions per place. [2025-03-13 22:27:23,918 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 50 selfloop transitions, 11 changer transitions 0/128 dead transitions. [2025-03-13 22:27:23,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 128 transitions, 589 flow [2025-03-13 22:27:23,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 22:27:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 22:27:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 921 transitions. [2025-03-13 22:27:23,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7309523809523809 [2025-03-13 22:27:23,920 INFO L175 Difference]: Start difference. First operand has 117 places, 102 transitions, 353 flow. Second operand 12 states and 921 transitions. [2025-03-13 22:27:23,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 128 transitions, 589 flow [2025-03-13 22:27:23,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 128 transitions, 571 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-13 22:27:23,923 INFO L231 Difference]: Finished difference. Result has 126 places, 105 transitions, 391 flow [2025-03-13 22:27:23,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=391, PETRI_PLACES=126, PETRI_TRANSITIONS=105} [2025-03-13 22:27:23,923 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 17 predicate places. [2025-03-13 22:27:23,924 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 105 transitions, 391 flow [2025-03-13 22:27:23,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 74.0) internal successors, (666), 9 states have internal predecessors, (666), 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-03-13 22:27:23,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:23,924 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 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-03-13 22:27:23,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-13 22:27:23,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:23,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:23,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2067309310, now seen corresponding path program 1 times [2025-03-13 22:27:23,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:23,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446160805] [2025-03-13 22:27:23,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:23,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:23,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-13 22:27:23,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-13 22:27:23,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:23,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:27:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:27:24,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:27:24,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446160805] [2025-03-13 22:27:24,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446160805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:27:24,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:27:24,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 22:27:24,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966892302] [2025-03-13 22:27:24,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:27:24,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-13 22:27:24,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:27:24,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-13 22:27:24,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-13 22:27:24,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 105 [2025-03-13 22:27:24,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 105 transitions, 391 flow. Second operand has 11 states, 11 states have (on average 73.36363636363636) internal successors, (807), 11 states have internal predecessors, (807), 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-03-13 22:27:24,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:27:24,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 105 [2025-03-13 22:27:24,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:27:25,000 INFO L124 PetriNetUnfolderBase]: 2166/9694 cut-off events. [2025-03-13 22:27:25,000 INFO L125 PetriNetUnfolderBase]: For 5773/6010 co-relation queries the response was YES. [2025-03-13 22:27:25,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16407 conditions, 9694 events. 2166/9694 cut-off events. For 5773/6010 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 99544 event pairs, 510 based on Foata normal form. 16/8761 useless extension candidates. Maximal degree in co-relation 16387. Up to 2296 conditions per place. [2025-03-13 22:27:25,054 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 66 selfloop transitions, 15 changer transitions 0/147 dead transitions. [2025-03-13 22:27:25,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 147 transitions, 719 flow [2025-03-13 22:27:25,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 22:27:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 22:27:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1142 transitions. [2025-03-13 22:27:25,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7250793650793651 [2025-03-13 22:27:25,056 INFO L175 Difference]: Start difference. First operand has 126 places, 105 transitions, 391 flow. Second operand 15 states and 1142 transitions. [2025-03-13 22:27:25,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 147 transitions, 719 flow [2025-03-13 22:27:25,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 147 transitions, 689 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-03-13 22:27:25,062 INFO L231 Difference]: Finished difference. Result has 136 places, 108 transitions, 427 flow [2025-03-13 22:27:25,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=427, PETRI_PLACES=136, PETRI_TRANSITIONS=108} [2025-03-13 22:27:25,063 INFO L279 CegarLoopForPetriNet]: 109 programPoint places, 27 predicate places. [2025-03-13 22:27:25,064 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 108 transitions, 427 flow [2025-03-13 22:27:25,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 73.36363636363636) internal successors, (807), 11 states have internal predecessors, (807), 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-03-13 22:27:25,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:27:25,065 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 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-03-13 22:27:25,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-13 22:27:25,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-03-13 22:27:25,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:27:25,066 INFO L85 PathProgramCache]: Analyzing trace with hash 699962101, now seen corresponding path program 1 times [2025-03-13 22:27:25,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:27:25,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135796148] [2025-03-13 22:27:25,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:27:25,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:27:25,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:27:25,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:27:25,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:25,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:25,091 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:27:25,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:27:25,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:27:25,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:27:25,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:27:25,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:27:25,118 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:27:25,118 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 11 remaining) [2025-03-13 22:27:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-03-13 22:27:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-03-13 22:27:25,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-03-13 22:27:25,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 11 remaining) [2025-03-13 22:27:25,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-03-13 22:27:25,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-03-13 22:27:25,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-03-13 22:27:25,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-03-13 22:27:25,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-03-13 22:27:25,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-03-13 22:27:25,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-13 22:27:25,119 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:27:25,209 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 5 thread instances [2025-03-13 22:27:25,209 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:27:25,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:27:25 BasicIcfg [2025-03-13 22:27:25,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:27:25,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:27:25,216 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:27:25,216 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:27:25,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:27:12" (3/4) ... [2025-03-13 22:27:25,218 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 22:27:25,287 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 7. [2025-03-13 22:27:25,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:27:25,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:27:25,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:27:25,326 INFO L158 Benchmark]: Toolchain (without parser) took 13393.41ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 153.1MB in the beginning and 750.8MB in the end (delta: -597.7MB). Peak memory consumption was 422.0MB. Max. memory is 16.1GB. [2025-03-13 22:27:25,326 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:27:25,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.20ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 133.7MB in the end (delta: 19.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:27:25,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.44ms. Allocated memory is still 201.3MB. Free memory was 133.7MB in the beginning and 131.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:27:25,326 INFO L158 Benchmark]: Boogie Preprocessor took 14.73ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 131.0MB in the end (delta: 812.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:27:25,327 INFO L158 Benchmark]: IcfgBuilder took 314.55ms. Allocated memory is still 201.3MB. Free memory was 130.6MB in the beginning and 114.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:27:25,327 INFO L158 Benchmark]: TraceAbstraction took 12613.89ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 113.4MB in the beginning and 792.7MB in the end (delta: -679.3MB). Peak memory consumption was 346.5MB. Max. memory is 16.1GB. [2025-03-13 22:27:25,328 INFO L158 Benchmark]: Witness Printer took 108.00ms. Allocated memory is still 1.2GB. Free memory was 792.7MB in the beginning and 750.8MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-13 22:27:25,329 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.20ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 133.7MB in the end (delta: 19.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.44ms. Allocated memory is still 201.3MB. Free memory was 133.7MB in the beginning and 131.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.73ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 131.0MB in the end (delta: 812.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 314.55ms. Allocated memory is still 201.3MB. Free memory was 130.6MB in the beginning and 114.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12613.89ms. Allocated memory was 201.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 113.4MB in the beginning and 792.7MB in the end (delta: -679.3MB). Peak memory consumption was 346.5MB. Max. memory is 16.1GB. * Witness Printer took 108.00ms. Allocated memory is still 1.2GB. Free memory was 792.7MB in the beginning and 750.8MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 726]: Data race detected Data race detected The following path leads to a data race: [L710] 0 intptr_t x; VAL [x=0] [L719] 0 pthread_t t[5 + 1]; VAL [\old(argc)=55, \old(argv)={57:53}, argc=55, t={3:0}, x=0] [L721] 0 x = 0 VAL [\old(argc)=55, \old(argv)={57:53}, argc=55, t={3:0}, x=0] [L723] 0 intptr_t i = 1; VAL [\old(argc)=55, \old(argv)={57:53}, argc=55, i=1, t={3:0}, x=0] [L723] COND TRUE 0 i <= 5 VAL [x=0] [L724] 0 pthread_create(t + i, 0, thread, (void *)i) VAL [\old(argc)=55, \old(argv)={57:53}, argc=55, i=1, t={3:0}, x=0] [L724] FCALL, FORK 0 pthread_create(t + i, 0, thread, (void *)i) VAL [\old(arg)={0:1}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=1, t={3:0}, x=0] [L723] 0 i++ VAL [\old(arg)={0:1}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=2, t={3:0}, x=0] [L723] COND TRUE 0 i <= 5 VAL [\old(arg)={0:1}, x=0] [L724] 0 pthread_create(t + i, 0, thread, (void *)i) VAL [\old(arg)={0:1}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=2, t={3:0}, x=0] [L724] FCALL, FORK 0 pthread_create(t + i, 0, thread, (void *)i) VAL [\old(arg)={0:2}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=2, t={3:0}, x=0] [L723] 0 i++ VAL [\old(arg)={0:2}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=3, t={3:0}, x=0] [L723] COND TRUE 0 i <= 5 VAL [\old(arg)={0:2}, x=0] [L724] 0 pthread_create(t + i, 0, thread, (void *)i) VAL [\old(arg)={0:2}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=3, t={3:0}, x=0] [L724] FCALL, FORK 0 pthread_create(t + i, 0, thread, (void *)i) VAL [\old(arg)={0:2}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=3, t={3:0}, x=0] [L723] 0 i++ VAL [\old(arg)={0:2}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=4, t={3:0}, x=0] [L723] COND TRUE 0 i <= 5 VAL [\old(arg)={0:2}, x=0] [L724] 0 pthread_create(t + i, 0, thread, (void *)i) VAL [\old(arg)={0:2}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=4, t={3:0}, x=0] [L724] FCALL, FORK 0 pthread_create(t + i, 0, thread, (void *)i) VAL [\old(arg)={0:2}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=4, t={3:0}, x=0] [L723] 0 i++ VAL [\old(arg)={0:2}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=5, t={3:0}, x=0] [L723] COND TRUE 0 i <= 5 VAL [\old(arg)={0:2}, x=0] [L724] 0 pthread_create(t + i, 0, thread, (void *)i) VAL [\old(arg)={0:2}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=5, t={3:0}, x=0] [L724] FCALL, FORK 0 pthread_create(t + i, 0, thread, (void *)i) VAL [\old(arg)={0:2}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=5, t={3:0}, x=0] [L723] 0 i++ VAL [\old(arg)={0:2}, \old(argc)=55, \old(argv)={57:53}, argc=55, i=6, t={3:0}, x=0] [L723] COND FALSE 0 !(i <= 5) VAL [\old(arg)={0:2}, x=0] [L726] 0 x < 5 + 1 VAL [\old(arg)={0:2}, \old(argc)=55, \old(argv)={57:53}, argc=55, t={3:0}, x=0] [L712] 1 intptr_t thread = (intptr_t)arg; VAL [\old(arg)={0:2}, arg={0:1}, thread=1, x=0] [L714] 1 x = thread VAL [\old(arg)={0:2}, arg={0:1}, thread=1, x=1] [L726] 0 x < 5 + 1 VAL [\old(arg)={0:2}, \old(argc)=55, \old(argv)={57:53}, arg={0:1}, argc=55, t={3:0}, thread=1, x=1] Now there is a data race on ~x~0 between C: x = thread [714] and C: x < 5 + 1 [726] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 730]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 3 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 85 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.0s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 217 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 23 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=5, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 92 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.6s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 674 IncrementalHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 45 mSDtfsCounter, 674 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 538 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 99 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.6s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 381 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 906 IncrementalHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 37 mSDtfsCounter, 906 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=7, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 5 thread instances CFG has 7 procedures, 106 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.9s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 487 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 376 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1016 IncrementalHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 12 mSDtfsCounter, 1016 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=427occurred in iteration=8, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-13 22:27:25,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)