./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/02_inc_cas.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-ext/02_inc_cas.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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:58:15,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:58:15,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:58:15,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:58:15,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:58:15,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:58:15,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:58:15,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:58:15,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:58:15,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:58:15,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:58:15,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:58:15,227 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:58:15,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:58:15,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:58:15,228 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:58:15,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:58:15,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:58:15,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:58:15,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:58:15,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:58:15,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:58:15,228 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:58:15,228 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:58:15,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:58:15,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:58:15,229 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:58:15,229 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:58:15,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:58:15,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:58:15,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:58:15,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:58:15,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:58:15,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:58:15,230 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:58:15,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:58:15,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:58:15,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:58:15,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:58:15,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:58:15,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:58:15,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:58:15,230 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2025-03-13 21:58:15,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:58:15,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:58:15,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:58:15,456 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:58:15,456 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:58:15,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/02_inc_cas.i [2025-03-13 21:58:16,549 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6e3d288/b933d87bb8bd44709651fbbd86c0eab7/FLAG30bcc47a5 [2025-03-13 21:58:16,854 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:58:16,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/02_inc_cas.i [2025-03-13 21:58:16,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6e3d288/b933d87bb8bd44709651fbbd86c0eab7/FLAG30bcc47a5 [2025-03-13 21:58:17,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6e3d288/b933d87bb8bd44709651fbbd86c0eab7 [2025-03-13 21:58:17,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:58:17,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:58:17,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:17,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:58:17,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:58:17,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:17" (1/1) ... [2025-03-13 21:58:17,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47818d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17, skipping insertion in model container [2025-03-13 21:58:17,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:58:17" (1/1) ... [2025-03-13 21:58:17,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:58:17,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:17,423 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:58:17,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:58:17,494 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:58:17,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17 WrapperNode [2025-03-13 21:58:17,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:58:17,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:17,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:58:17,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:58:17,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17" (1/1) ... [2025-03-13 21:58:17,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17" (1/1) ... [2025-03-13 21:58:17,526 INFO L138 Inliner]: procedures = 170, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2025-03-13 21:58:17,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:58:17,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:58:17,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:58:17,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:58:17,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17" (1/1) ... [2025-03-13 21:58:17,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17" (1/1) ... [2025-03-13 21:58:17,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17" (1/1) ... [2025-03-13 21:58:17,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17" (1/1) ... [2025-03-13 21:58:17,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17" (1/1) ... [2025-03-13 21:58:17,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17" (1/1) ... [2025-03-13 21:58:17,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17" (1/1) ... [2025-03-13 21:58:17,545 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17" (1/1) ... [2025-03-13 21:58:17,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:58:17,547 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:58:17,547 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:58:17,548 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:58:17,548 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17" (1/1) ... [2025-03-13 21:58:17,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:58:17,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:17,571 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 21:58:17,573 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 21:58:17,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 21:58:17,588 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-13 21:58:17,588 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-13 21:58:17,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 21:58:17,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:58:17,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:58:17,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 21:58:17,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 21:58:17,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:58:17,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:58:17,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:58:17,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:58:17,589 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 21:58:17,665 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:58:17,666 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:58:17,823 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: havoc ~#casret~0#1.base, ~#casret~0#1.offset; [2025-03-13 21:58:17,823 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: SUMMARY for call ULTIMATE.dealloc(~#casret~0#1.base, ~#casret~0#1.offset); srcloc: null [2025-03-13 21:58:17,854 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:58:17,855 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:58:17,855 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:58:18,002 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:58:18,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:18 BoogieIcfgContainer [2025-03-13 21:58:18,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:58:18,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:58:18,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:58:18,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:58:18,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:58:17" (1/3) ... [2025-03-13 21:58:18,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d69c1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:18, skipping insertion in model container [2025-03-13 21:58:18,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:58:17" (2/3) ... [2025-03-13 21:58:18,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d69c1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:58:18, skipping insertion in model container [2025-03-13 21:58:18,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:58:18" (3/3) ... [2025-03-13 21:58:18,011 INFO L128 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2025-03-13 21:58:18,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:58:18,025 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02_inc_cas.i that has 2 procedures, 55 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-13 21:58:18,025 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:58:18,078 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:18,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 58 transitions, 120 flow [2025-03-13 21:58:18,130 INFO L124 PetriNetUnfolderBase]: 3/65 cut-off events. [2025-03-13 21:58:18,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:18,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 65 events. 3/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 109 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-03-13 21:58:18,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 58 transitions, 120 flow [2025-03-13 21:58:18,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 58 transitions, 120 flow [2025-03-13 21:58:18,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:18,154 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;@ada79ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:18,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-13 21:58:18,160 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:18,160 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-13 21:58:18,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:18,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:18,161 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] [2025-03-13 21:58:18,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-13 21:58:18,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash 340993109, now seen corresponding path program 1 times [2025-03-13 21:58:18,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:18,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703703350] [2025-03-13 21:58:18,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:18,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:18,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:58:18,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:58:18,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:18,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:18,528 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 21:58:18,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:18,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703703350] [2025-03-13 21:58:18,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703703350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:18,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:18,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 21:58:18,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50301179] [2025-03-13 21:58:18,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:18,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:58:18,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:18,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:58:18,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:58:18,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 58 [2025-03-13 21:58:18,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 120 flow. Second operand has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 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 21:58:18,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:18,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 58 [2025-03-13 21:58:18,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:18,605 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2025-03-13 21:58:18,605 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:58:18,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 50 events. 2/50 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 5/52 useless extension candidates. Maximal degree in co-relation 36. Up to 5 conditions per place. [2025-03-13 21:58:18,606 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 4 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2025-03-13 21:58:18,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 106 flow [2025-03-13 21:58:18,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:58:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:58:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2025-03-13 21:58:18,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.896551724137931 [2025-03-13 21:58:18,615 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 120 flow. Second operand 2 states and 104 transitions. [2025-03-13 21:58:18,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 106 flow [2025-03-13 21:58:18,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:18,619 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 98 flow [2025-03-13 21:58:18,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2025-03-13 21:58:18,623 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2025-03-13 21:58:18,623 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 98 flow [2025-03-13 21:58:18,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 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 21:58:18,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:18,623 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:18,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:58:18,624 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-03-13 21:58:18,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1576537749, now seen corresponding path program 1 times [2025-03-13 21:58:18,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:18,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764308177] [2025-03-13 21:58:18,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:18,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:18,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:58:18,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:58:18,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:18,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:18,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:18,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:58:18,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:58:18,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:18,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:18,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:18,655 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:18,656 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-13 21:58:18,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-13 21:58:18,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-13 21:58:18,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-13 21:58:18,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-13 21:58:18,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-13 21:58:18,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-03-13 21:58:18,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-13 21:58:18,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-13 21:58:18,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-13 21:58:18,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-13 21:58:18,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-13 21:58:18,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-13 21:58:18,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-13 21:58:18,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-13 21:58:18,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:58:18,658 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 21:58:18,660 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:58:18,660 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:58:18,696 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:18,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 94 transitions, 198 flow [2025-03-13 21:58:18,723 INFO L124 PetriNetUnfolderBase]: 6/110 cut-off events. [2025-03-13 21:58:18,724 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:58:18,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 110 events. 6/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 317 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 79. Up to 3 conditions per place. [2025-03-13 21:58:18,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 94 transitions, 198 flow [2025-03-13 21:58:18,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 94 transitions, 198 flow [2025-03-13 21:58:18,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:18,729 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;@ada79ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:18,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-13 21:58:18,735 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:18,736 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-13 21:58:18,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:18,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:18,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] [2025-03-13 21:58:18,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-13 21:58:18,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2146184109, now seen corresponding path program 1 times [2025-03-13 21:58:18,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:18,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247098204] [2025-03-13 21:58:18,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:18,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:58:18,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:58:18,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:18,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:18,870 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 21:58:18,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:18,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247098204] [2025-03-13 21:58:18,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247098204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:18,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:18,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 21:58:18,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799354167] [2025-03-13 21:58:18,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:18,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:58:18,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:18,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:58:18,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:58:18,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 94 [2025-03-13 21:58:18,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 94 transitions, 198 flow. Second operand has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 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 21:58:18,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:18,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 94 [2025-03-13 21:58:18,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:18,972 INFO L124 PetriNetUnfolderBase]: 24/196 cut-off events. [2025-03-13 21:58:18,972 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 21:58:18,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 196 events. 24/196 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 683 event pairs, 12 based on Foata normal form. 21/197 useless extension candidates. Maximal degree in co-relation 174. Up to 37 conditions per place. [2025-03-13 21:58:18,977 INFO L140 encePairwiseOnDemand]: 79/94 looper letters, 8 selfloop transitions, 0 changer transitions 0/76 dead transitions. [2025-03-13 21:58:18,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 178 flow [2025-03-13 21:58:18,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:58:18,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:58:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 165 transitions. [2025-03-13 21:58:18,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2025-03-13 21:58:18,980 INFO L175 Difference]: Start difference. First operand has 93 places, 94 transitions, 198 flow. Second operand 2 states and 165 transitions. [2025-03-13 21:58:18,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 178 flow [2025-03-13 21:58:18,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:18,982 INFO L231 Difference]: Finished difference. Result has 78 places, 76 transitions, 162 flow [2025-03-13 21:58:18,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=162, PETRI_PLACES=78, PETRI_TRANSITIONS=76} [2025-03-13 21:58:18,983 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, -15 predicate places. [2025-03-13 21:58:18,983 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 76 transitions, 162 flow [2025-03-13 21:58:18,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 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 21:58:18,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:18,983 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:18,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:58:18,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-03-13 21:58:18,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:18,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1805488702, now seen corresponding path program 1 times [2025-03-13 21:58:18,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:18,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251517913] [2025-03-13 21:58:18,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:18,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:18,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:58:18,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:58:18,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:18,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:18,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:19,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:58:19,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:58:19,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:19,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:19,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:19,012 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:19,012 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-13 21:58:19,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-03-13 21:58:19,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-03-13 21:58:19,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-03-13 21:58:19,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-03-13 21:58:19,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-03-13 21:58:19,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-03-13 21:58:19,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-03-13 21:58:19,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2025-03-13 21:58:19,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2025-03-13 21:58:19,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-03-13 21:58:19,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-03-13 21:58:19,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-03-13 21:58:19,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-03-13 21:58:19,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-03-13 21:58:19,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-03-13 21:58:19,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-03-13 21:58:19,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-03-13 21:58:19,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-03-13 21:58:19,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-03-13 21:58:19,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-03-13 21:58:19,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-03-13 21:58:19,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:58:19,013 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-13 21:58:19,014 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:58:19,014 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-13 21:58:19,075 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:19,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 130 transitions, 278 flow [2025-03-13 21:58:19,109 INFO L124 PetriNetUnfolderBase]: 9/155 cut-off events. [2025-03-13 21:58:19,110 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:58:19,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 155 events. 9/155 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 511 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 114. Up to 4 conditions per place. [2025-03-13 21:58:19,112 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 130 transitions, 278 flow [2025-03-13 21:58:19,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 130 transitions, 278 flow [2025-03-13 21:58:19,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:19,115 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;@ada79ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:19,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-13 21:58:19,118 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:19,119 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-13 21:58:19,120 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:58:19,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:19,120 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] [2025-03-13 21:58:19,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-13 21:58:19,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1477505042, now seen corresponding path program 1 times [2025-03-13 21:58:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:19,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180950138] [2025-03-13 21:58:19,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:19,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:58:19,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:58:19,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:19,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:19,235 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 21:58:19,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:19,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180950138] [2025-03-13 21:58:19,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180950138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:19,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:19,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 21:58:19,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680228353] [2025-03-13 21:58:19,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:19,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:58:19,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:19,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:58:19,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:58:19,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 130 [2025-03-13 21:58:19,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 278 flow. Second operand has 2 states, 2 states have (on average 97.0) internal successors, (194), 2 states have internal predecessors, (194), 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 21:58:19,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:19,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 130 [2025-03-13 21:58:19,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:19,456 INFO L124 PetriNetUnfolderBase]: 174/838 cut-off events. [2025-03-13 21:58:19,457 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-13 21:58:19,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 838 events. 174/838 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5425 event pairs, 108 based on Foata normal form. 85/820 useless extension candidates. Maximal degree in co-relation 810. Up to 229 conditions per place. [2025-03-13 21:58:19,466 INFO L140 encePairwiseOnDemand]: 108/130 looper letters, 12 selfloop transitions, 0 changer transitions 0/105 dead transitions. [2025-03-13 21:58:19,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 252 flow [2025-03-13 21:58:19,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:58:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:58:19,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 226 transitions. [2025-03-13 21:58:19,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8692307692307693 [2025-03-13 21:58:19,471 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 278 flow. Second operand 2 states and 226 transitions. [2025-03-13 21:58:19,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 252 flow [2025-03-13 21:58:19,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 250 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:19,474 INFO L231 Difference]: Finished difference. Result has 107 places, 105 transitions, 226 flow [2025-03-13 21:58:19,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=226, PETRI_PLACES=107, PETRI_TRANSITIONS=105} [2025-03-13 21:58:19,475 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -21 predicate places. [2025-03-13 21:58:19,476 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 105 transitions, 226 flow [2025-03-13 21:58:19,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.0) internal successors, (194), 2 states have internal predecessors, (194), 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 21:58:19,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:19,476 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] [2025-03-13 21:58:19,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:58:19,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-13 21:58:19,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash 292203567, now seen corresponding path program 1 times [2025-03-13 21:58:19,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:19,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323020215] [2025-03-13 21:58:19,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:19,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:19,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:58:19,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:58:19,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:19,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:19,825 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 21:58:19,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:19,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323020215] [2025-03-13 21:58:19,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323020215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:19,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:19,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:58:19,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046626591] [2025-03-13 21:58:19,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:19,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:58:19,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:19,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:58:19,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:19,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 130 [2025-03-13 21:58:19,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 88.5) internal successors, (531), 6 states have internal predecessors, (531), 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 21:58:19,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:19,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 130 [2025-03-13 21:58:19,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:21,222 INFO L124 PetriNetUnfolderBase]: 805/2677 cut-off events. [2025-03-13 21:58:21,222 INFO L125 PetriNetUnfolderBase]: For 247/247 co-relation queries the response was YES. [2025-03-13 21:58:21,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4051 conditions, 2677 events. 805/2677 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 23330 event pairs, 235 based on Foata normal form. 0/2370 useless extension candidates. Maximal degree in co-relation 4045. Up to 770 conditions per place. [2025-03-13 21:58:21,240 INFO L140 encePairwiseOnDemand]: 119/130 looper letters, 46 selfloop transitions, 16 changer transitions 0/146 dead transitions. [2025-03-13 21:58:21,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 146 transitions, 472 flow [2025-03-13 21:58:21,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:58:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:58:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2025-03-13 21:58:21,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-13 21:58:21,243 INFO L175 Difference]: Start difference. First operand has 107 places, 105 transitions, 226 flow. Second operand 6 states and 585 transitions. [2025-03-13 21:58:21,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 146 transitions, 472 flow [2025-03-13 21:58:21,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 146 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:21,248 INFO L231 Difference]: Finished difference. Result has 117 places, 120 transitions, 340 flow [2025-03-13 21:58:21,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=340, PETRI_PLACES=117, PETRI_TRANSITIONS=120} [2025-03-13 21:58:21,250 INFO L279 CegarLoopForPetriNet]: 128 programPoint places, -11 predicate places. [2025-03-13 21:58:21,250 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 120 transitions, 340 flow [2025-03-13 21:58:21,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.5) internal successors, (531), 6 states have internal predecessors, (531), 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 21:58:21,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:21,251 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:21,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:58:21,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-13 21:58:21,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1479926034, now seen corresponding path program 1 times [2025-03-13 21:58:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942239671] [2025-03-13 21:58:21,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:21,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:21,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:58:21,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:58:21,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:21,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:21,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:21,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:58:21,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:58:21,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:21,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:21,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:21,279 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2025-03-13 21:58:21,279 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2025-03-13 21:58:21,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2025-03-13 21:58:21,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2025-03-13 21:58:21,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2025-03-13 21:58:21,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2025-03-13 21:58:21,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2025-03-13 21:58:21,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2025-03-13 21:58:21,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2025-03-13 21:58:21,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2025-03-13 21:58:21,282 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2025-03-13 21:58:21,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2025-03-13 21:58:21,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2025-03-13 21:58:21,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2025-03-13 21:58:21,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2025-03-13 21:58:21,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2025-03-13 21:58:21,283 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2025-03-13 21:58:21,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:58:21,283 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-13 21:58:21,284 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:58:21,284 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-13 21:58:21,360 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:21,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 166 transitions, 360 flow [2025-03-13 21:58:21,377 INFO L124 PetriNetUnfolderBase]: 12/200 cut-off events. [2025-03-13 21:58:21,377 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:58:21,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 200 events. 12/200 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 715 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 163. Up to 5 conditions per place. [2025-03-13 21:58:21,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 166 transitions, 360 flow [2025-03-13 21:58:21,380 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 166 transitions, 360 flow [2025-03-13 21:58:21,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:21,381 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;@ada79ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:21,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-03-13 21:58:21,383 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:21,384 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-13 21:58:21,384 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:58:21,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:21,384 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] [2025-03-13 21:58:21,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 21:58:21,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:21,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1606039976, now seen corresponding path program 1 times [2025-03-13 21:58:21,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:21,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191229399] [2025-03-13 21:58:21,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:21,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:21,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:58:21,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:58:21,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:21,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:21,457 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 21:58:21,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:21,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191229399] [2025-03-13 21:58:21,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191229399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:21,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:21,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 21:58:21,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282927808] [2025-03-13 21:58:21,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:21,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:58:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:21,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:58:21,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:58:21,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 166 [2025-03-13 21:58:21,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 166 transitions, 360 flow. Second operand has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 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 21:58:21,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:21,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 166 [2025-03-13 21:58:21,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:21,943 INFO L124 PetriNetUnfolderBase]: 1028/3656 cut-off events. [2025-03-13 21:58:21,943 INFO L125 PetriNetUnfolderBase]: For 755/755 co-relation queries the response was YES. [2025-03-13 21:58:21,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5312 conditions, 3656 events. 1028/3656 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 32358 event pairs, 684 based on Foata normal form. 341/3545 useless extension candidates. Maximal degree in co-relation 3726. Up to 1253 conditions per place. [2025-03-13 21:58:22,013 INFO L140 encePairwiseOnDemand]: 137/166 looper letters, 16 selfloop transitions, 0 changer transitions 0/134 dead transitions. [2025-03-13 21:58:22,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 134 transitions, 328 flow [2025-03-13 21:58:22,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:58:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:58:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2025-03-13 21:58:22,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8644578313253012 [2025-03-13 21:58:22,015 INFO L175 Difference]: Start difference. First operand has 163 places, 166 transitions, 360 flow. Second operand 2 states and 287 transitions. [2025-03-13 21:58:22,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 134 transitions, 328 flow [2025-03-13 21:58:22,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 322 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:22,019 INFO L231 Difference]: Finished difference. Result has 136 places, 134 transitions, 290 flow [2025-03-13 21:58:22,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=290, PETRI_PLACES=136, PETRI_TRANSITIONS=134} [2025-03-13 21:58:22,019 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -27 predicate places. [2025-03-13 21:58:22,020 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 134 transitions, 290 flow [2025-03-13 21:58:22,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 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 21:58:22,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:22,020 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] [2025-03-13 21:58:22,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:58:22,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 21:58:22,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:22,021 INFO L85 PathProgramCache]: Analyzing trace with hash -652975886, now seen corresponding path program 1 times [2025-03-13 21:58:22,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:22,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363526871] [2025-03-13 21:58:22,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:22,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:22,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:58:22,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:58:22,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:22,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:22,256 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 21:58:22,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:22,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363526871] [2025-03-13 21:58:22,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363526871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:22,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:22,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:58:22,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575438365] [2025-03-13 21:58:22,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:22,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:58:22,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:22,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:58:22,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:22,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 166 [2025-03-13 21:58:22,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 134 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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 21:58:22,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:22,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 166 [2025-03-13 21:58:22,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:25,099 INFO L124 PetriNetUnfolderBase]: 4956/13317 cut-off events. [2025-03-13 21:58:25,099 INFO L125 PetriNetUnfolderBase]: For 1141/1141 co-relation queries the response was YES. [2025-03-13 21:58:25,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20715 conditions, 13317 events. 4956/13317 cut-off events. For 1141/1141 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 141065 event pairs, 1678 based on Foata normal form. 0/11794 useless extension candidates. Maximal degree in co-relation 20708. Up to 4383 conditions per place. [2025-03-13 21:58:25,200 INFO L140 encePairwiseOnDemand]: 154/166 looper letters, 62 selfloop transitions, 20 changer transitions 0/191 dead transitions. [2025-03-13 21:58:25,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 191 transitions, 628 flow [2025-03-13 21:58:25,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:58:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:58:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 755 transitions. [2025-03-13 21:58:25,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7580321285140562 [2025-03-13 21:58:25,203 INFO L175 Difference]: Start difference. First operand has 136 places, 134 transitions, 290 flow. Second operand 6 states and 755 transitions. [2025-03-13 21:58:25,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 191 transitions, 628 flow [2025-03-13 21:58:25,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 191 transitions, 628 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:25,207 INFO L231 Difference]: Finished difference. Result has 146 places, 153 transitions, 430 flow [2025-03-13 21:58:25,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=430, PETRI_PLACES=146, PETRI_TRANSITIONS=153} [2025-03-13 21:58:25,208 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -17 predicate places. [2025-03-13 21:58:25,208 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 153 transitions, 430 flow [2025-03-13 21:58:25,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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 21:58:25,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:25,209 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:25,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:58:25,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 21:58:25,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:25,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1651309883, now seen corresponding path program 1 times [2025-03-13 21:58:25,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:25,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238420786] [2025-03-13 21:58:25,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:25,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:25,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:58:25,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:58:25,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:25,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:25,422 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 21:58:25,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:25,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238420786] [2025-03-13 21:58:25,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238420786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:25,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:25,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:58:25,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2959822] [2025-03-13 21:58:25,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:25,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:58:25,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:25,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:58:25,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:25,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 166 [2025-03-13 21:58:25,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 153 transitions, 430 flow. Second operand has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 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 21:58:25,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:25,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 166 [2025-03-13 21:58:25,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:30,238 INFO L124 PetriNetUnfolderBase]: 13776/35405 cut-off events. [2025-03-13 21:58:30,238 INFO L125 PetriNetUnfolderBase]: For 11591/12450 co-relation queries the response was YES. [2025-03-13 21:58:30,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63583 conditions, 35405 events. 13776/35405 cut-off events. For 11591/12450 co-relation queries the response was YES. Maximal size of possible extension queue 1500. Compared 430159 event pairs, 3667 based on Foata normal form. 0/31652 useless extension candidates. Maximal degree in co-relation 63571. Up to 12116 conditions per place. [2025-03-13 21:58:30,762 INFO L140 encePairwiseOnDemand]: 154/166 looper letters, 71 selfloop transitions, 60 changer transitions 0/246 dead transitions. [2025-03-13 21:58:30,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 246 transitions, 1104 flow [2025-03-13 21:58:30,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:58:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:58:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2025-03-13 21:58:30,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7540160642570282 [2025-03-13 21:58:30,770 INFO L175 Difference]: Start difference. First operand has 146 places, 153 transitions, 430 flow. Second operand 6 states and 751 transitions. [2025-03-13 21:58:30,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 246 transitions, 1104 flow [2025-03-13 21:58:30,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 246 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:30,785 INFO L231 Difference]: Finished difference. Result has 156 places, 212 transitions, 1022 flow [2025-03-13 21:58:30,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1022, PETRI_PLACES=156, PETRI_TRANSITIONS=212} [2025-03-13 21:58:30,786 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -7 predicate places. [2025-03-13 21:58:30,786 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 212 transitions, 1022 flow [2025-03-13 21:58:30,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 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 21:58:30,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:30,787 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:30,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:58:30,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-03-13 21:58:30,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:30,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1902930523, now seen corresponding path program 1 times [2025-03-13 21:58:30,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:30,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881370215] [2025-03-13 21:58:30,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:30,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:30,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:58:30,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:58:30,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:30,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:30,799 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:58:30,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:58:30,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:58:30,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:30,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:58:30,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:58:30,814 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2025-03-13 21:58:30,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2025-03-13 21:58:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2025-03-13 21:58:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2025-03-13 21:58:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2025-03-13 21:58:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 36 remaining) [2025-03-13 21:58:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 36 remaining) [2025-03-13 21:58:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2025-03-13 21:58:30,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2025-03-13 21:58:30,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2025-03-13 21:58:30,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2025-03-13 21:58:30,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2025-03-13 21:58:30,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2025-03-13 21:58:30,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2025-03-13 21:58:30,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2025-03-13 21:58:30,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2025-03-13 21:58:30,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2025-03-13 21:58:30,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2025-03-13 21:58:30,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2025-03-13 21:58:30,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:58:30,818 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-13 21:58:30,819 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:58:30,819 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-13 21:58:30,884 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:58:30,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 202 transitions, 444 flow [2025-03-13 21:58:30,903 INFO L124 PetriNetUnfolderBase]: 15/245 cut-off events. [2025-03-13 21:58:30,903 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-13 21:58:30,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 245 events. 15/245 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 927 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 213. Up to 6 conditions per place. [2025-03-13 21:58:30,905 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 202 transitions, 444 flow [2025-03-13 21:58:30,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 202 transitions, 444 flow [2025-03-13 21:58:30,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:58:30,909 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;@ada79ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:58:30,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-03-13 21:58:30,910 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:58:30,910 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-13 21:58:30,910 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:58:30,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:30,910 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] [2025-03-13 21:58:30,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-03-13 21:58:30,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:30,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1387880700, now seen corresponding path program 1 times [2025-03-13 21:58:30,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:30,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197086812] [2025-03-13 21:58:30,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:30,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:30,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:58:30,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:58:30,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:30,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:30,960 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 21:58:30,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:30,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197086812] [2025-03-13 21:58:30,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197086812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:30,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:30,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 21:58:30,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280180915] [2025-03-13 21:58:30,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:30,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:58:30,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:30,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:58:30,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:58:30,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 202 [2025-03-13 21:58:30,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 202 transitions, 444 flow. Second operand has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 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 21:58:30,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:30,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 202 [2025-03-13 21:58:30,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:32,885 INFO L124 PetriNetUnfolderBase]: 5466/15946 cut-off events. [2025-03-13 21:58:32,886 INFO L125 PetriNetUnfolderBase]: For 4599/4599 co-relation queries the response was YES. [2025-03-13 21:58:32,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24259 conditions, 15946 events. 5466/15946 cut-off events. For 4599/4599 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 172261 event pairs, 3756 based on Foata normal form. 1365/15444 useless extension candidates. Maximal degree in co-relation 16914. Up to 6373 conditions per place. [2025-03-13 21:58:33,085 INFO L140 encePairwiseOnDemand]: 166/202 looper letters, 20 selfloop transitions, 0 changer transitions 0/163 dead transitions. [2025-03-13 21:58:33,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 163 transitions, 406 flow [2025-03-13 21:58:33,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:58:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:58:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 348 transitions. [2025-03-13 21:58:33,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8613861386138614 [2025-03-13 21:58:33,087 INFO L175 Difference]: Start difference. First operand has 198 places, 202 transitions, 444 flow. Second operand 2 states and 348 transitions. [2025-03-13 21:58:33,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 163 transitions, 406 flow [2025-03-13 21:58:33,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 394 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:33,090 INFO L231 Difference]: Finished difference. Result has 165 places, 163 transitions, 354 flow [2025-03-13 21:58:33,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=354, PETRI_PLACES=165, PETRI_TRANSITIONS=163} [2025-03-13 21:58:33,090 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, -33 predicate places. [2025-03-13 21:58:33,090 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 163 transitions, 354 flow [2025-03-13 21:58:33,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 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 21:58:33,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:33,091 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] [2025-03-13 21:58:33,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:58:33,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-03-13 21:58:33,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash 172813301, now seen corresponding path program 1 times [2025-03-13 21:58:33,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:33,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042235654] [2025-03-13 21:58:33,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:33,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:33,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:58:33,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:58:33,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:33,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:33,285 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 21:58:33,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:33,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042235654] [2025-03-13 21:58:33,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042235654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:33,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:33,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:58:33,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914736891] [2025-03-13 21:58:33,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:33,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:58:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:33,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:58:33,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:33,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 202 [2025-03-13 21:58:33,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 163 transitions, 354 flow. Second operand has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 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 21:58:33,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:33,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 202 [2025-03-13 21:58:33,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:40,882 INFO L124 PetriNetUnfolderBase]: 26524/61214 cut-off events. [2025-03-13 21:58:40,882 INFO L125 PetriNetUnfolderBase]: For 4772/4772 co-relation queries the response was YES. [2025-03-13 21:58:41,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97733 conditions, 61214 events. 26524/61214 cut-off events. For 4772/4772 co-relation queries the response was YES. Maximal size of possible extension queue 2214. Compared 728493 event pairs, 9749 based on Foata normal form. 0/54623 useless extension candidates. Maximal degree in co-relation 97725. Up to 22453 conditions per place. [2025-03-13 21:58:41,618 INFO L140 encePairwiseOnDemand]: 189/202 looper letters, 78 selfloop transitions, 24 changer transitions 0/236 dead transitions. [2025-03-13 21:58:41,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 236 transitions, 784 flow [2025-03-13 21:58:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:58:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:58:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 925 transitions. [2025-03-13 21:58:41,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7632013201320133 [2025-03-13 21:58:41,620 INFO L175 Difference]: Start difference. First operand has 165 places, 163 transitions, 354 flow. Second operand 6 states and 925 transitions. [2025-03-13 21:58:41,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 236 transitions, 784 flow [2025-03-13 21:58:41,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 236 transitions, 784 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:41,624 INFO L231 Difference]: Finished difference. Result has 175 places, 186 transitions, 520 flow [2025-03-13 21:58:41,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=520, PETRI_PLACES=175, PETRI_TRANSITIONS=186} [2025-03-13 21:58:41,625 INFO L279 CegarLoopForPetriNet]: 198 programPoint places, -23 predicate places. [2025-03-13 21:58:41,625 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 186 transitions, 520 flow [2025-03-13 21:58:41,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 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 21:58:41,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:41,626 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:41,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:58:41,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err5ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2025-03-13 21:58:41,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:41,626 INFO L85 PathProgramCache]: Analyzing trace with hash 774838113, now seen corresponding path program 1 times [2025-03-13 21:58:41,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:41,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891457438] [2025-03-13 21:58:41,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:41,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:41,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 21:58:41,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 21:58:41,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:41,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:41,792 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 21:58:41,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:41,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891457438] [2025-03-13 21:58:41,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891457438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:41,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:41,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:58:41,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436671340] [2025-03-13 21:58:41,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:41,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:58:41,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:41,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:58:41,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:41,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 202 [2025-03-13 21:58:41,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 186 transitions, 520 flow. Second operand has 6 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 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 21:58:41,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:41,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 202 [2025-03-13 21:58:41,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand