./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_safe-6-racy.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/fib_safe-6-racy.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 6959d4f0e51834399b1f177b2907c6f040a7f82b22df70a4ffbb4c40805c24f4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:56:23,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:56:24,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:56:24,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:56:24,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:56:24,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:56:24,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:56:24,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:56:24,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:56:24,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:56:24,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:56:24,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:56:24,040 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:56:24,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:56:24,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:56:24,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:56:24,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:56:24,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:56:24,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:56:24,041 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:56:24,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:56:24,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:56:24,041 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:56:24,041 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:56:24,042 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:56:24,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:56:24,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:56:24,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:56:24,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:56:24,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:56:24,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:56:24,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:56:24,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:56:24,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:56:24,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:56:24,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:56:24,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:56:24,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:56:24,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:56:24,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:56:24,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:56:24,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:56:24,043 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 -> 6959d4f0e51834399b1f177b2907c6f040a7f82b22df70a4ffbb4c40805c24f4 [2025-03-13 21:56:24,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:56:24,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:56:24,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:56:24,288 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:56:24,288 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:56:24,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_safe-6-racy.i [2025-03-13 21:56:25,416 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d40c0f74f/e5fcebcfb3f64dc3ad87ac2553051fe5/FLAGff7ca6426 [2025-03-13 21:56:25,696 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:56:25,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_safe-6-racy.i [2025-03-13 21:56:25,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d40c0f74f/e5fcebcfb3f64dc3ad87ac2553051fe5/FLAGff7ca6426 [2025-03-13 21:56:25,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d40c0f74f/e5fcebcfb3f64dc3ad87ac2553051fe5 [2025-03-13 21:56:25,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:56:25,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:56:25,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:56:25,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:56:25,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:56:25,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:56:25" (1/1) ... [2025-03-13 21:56:25,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a4544d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:25, skipping insertion in model container [2025-03-13 21:56:25,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:56:25" (1/1) ... [2025-03-13 21:56:26,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:56:26,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:56:26,282 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:56:26,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:56:26,349 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:56:26,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:26 WrapperNode [2025-03-13 21:56:26,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:56:26,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:56:26,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:56:26,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:56:26,355 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:56:26" (1/1) ... [2025-03-13 21:56:26,364 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:56:26" (1/1) ... [2025-03-13 21:56:26,377 INFO L138 Inliner]: procedures = 163, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113 [2025-03-13 21:56:26,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:56:26,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:56:26,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:56:26,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:56:26,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:26" (1/1) ... [2025-03-13 21:56:26,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:26" (1/1) ... [2025-03-13 21:56:26,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:26" (1/1) ... [2025-03-13 21:56:26,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:26" (1/1) ... [2025-03-13 21:56:26,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:26" (1/1) ... [2025-03-13 21:56:26,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:26" (1/1) ... [2025-03-13 21:56:26,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:26" (1/1) ... [2025-03-13 21:56:26,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:26" (1/1) ... [2025-03-13 21:56:26,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:56:26,401 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:56:26,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:56:26,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:56:26,402 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:26" (1/1) ... [2025-03-13 21:56:26,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:56:26,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:56:26,425 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:56:26,428 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:56:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-13 21:56:26,444 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-13 21:56:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-13 21:56:26,444 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-13 21:56:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:56:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:56:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:56:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:56:26,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:56:26,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:56:26,445 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:56:26,541 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:56:26,542 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:56:26,782 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:56:26,783 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:56:26,783 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:56:26,842 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:56:26,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:56:26 BoogieIcfgContainer [2025-03-13 21:56:26,842 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:56:26,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:56:26,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:56:26,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:56:26,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:56:25" (1/3) ... [2025-03-13 21:56:26,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3d18a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:56:26, skipping insertion in model container [2025-03-13 21:56:26,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:26" (2/3) ... [2025-03-13 21:56:26,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3d18a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:56:26, skipping insertion in model container [2025-03-13 21:56:26,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:56:26" (3/3) ... [2025-03-13 21:56:26,850 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_safe-6-racy.i [2025-03-13 21:56:26,861 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:56:26,862 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_safe-6-racy.i that has 3 procedures, 180 locations, 1 initial locations, 3 loop locations, and 30 error locations. [2025-03-13 21:56:26,862 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:56:26,905 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:56:26,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 188 transitions, 384 flow [2025-03-13 21:56:26,992 INFO L124 PetriNetUnfolderBase]: 9/186 cut-off events. [2025-03-13 21:56:26,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:27,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 186 events. 9/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 396 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2025-03-13 21:56:27,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 188 transitions, 384 flow [2025-03-13 21:56:27,007 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 186 transitions, 378 flow [2025-03-13 21:56:27,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:56:27,025 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;@48b3c30b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:56:27,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-13 21:56:27,032 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:56:27,032 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-03-13 21:56:27,033 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:27,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:27,033 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] [2025-03-13 21:56:27,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:27,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:27,038 INFO L85 PathProgramCache]: Analyzing trace with hash 531216629, now seen corresponding path program 1 times [2025-03-13 21:56:27,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:27,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775637707] [2025-03-13 21:56:27,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:27,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:56:27,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:56:27,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:27,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:27,161 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:56:27,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:27,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775637707] [2025-03-13 21:56:27,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775637707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:27,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:27,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 21:56:27,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370170903] [2025-03-13 21:56:27,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:27,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 21:56:27,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:27,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 21:56:27,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 21:56:27,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 188 [2025-03-13 21:56:27,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 186 transitions, 378 flow. Second operand has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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:56:27,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:27,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 188 [2025-03-13 21:56:27,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:27,263 INFO L124 PetriNetUnfolderBase]: 9/286 cut-off events. [2025-03-13 21:56:27,263 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:56:27,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 286 events. 9/286 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 966 event pairs, 2 based on Foata normal form. 12/248 useless extension candidates. Maximal degree in co-relation 270. Up to 11 conditions per place. [2025-03-13 21:56:27,268 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 6 selfloop transitions, 0 changer transitions 0/171 dead transitions. [2025-03-13 21:56:27,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 171 transitions, 360 flow [2025-03-13 21:56:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 21:56:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 21:56:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2025-03-13 21:56:27,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441489361702128 [2025-03-13 21:56:27,285 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 378 flow. Second operand 2 states and 355 transitions. [2025-03-13 21:56:27,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 171 transitions, 360 flow [2025-03-13 21:56:27,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 171 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:27,293 INFO L231 Difference]: Finished difference. Result has 173 places, 171 transitions, 346 flow [2025-03-13 21:56:27,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=346, PETRI_PLACES=173, PETRI_TRANSITIONS=171} [2025-03-13 21:56:27,300 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -11 predicate places. [2025-03-13 21:56:27,302 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 171 transitions, 346 flow [2025-03-13 21:56:27,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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:56:27,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:27,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:27,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:56:27,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:27,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:27,304 INFO L85 PathProgramCache]: Analyzing trace with hash 42451857, now seen corresponding path program 1 times [2025-03-13 21:56:27,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:27,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12146482] [2025-03-13 21:56:27,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:27,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:27,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-13 21:56:27,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-13 21:56:27,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:27,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:27,395 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:56:27,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:27,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12146482] [2025-03-13 21:56:27,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12146482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:27,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:27,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:27,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190983680] [2025-03-13 21:56:27,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:27,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:27,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:27,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:27,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:27,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-13 21:56:27,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 171 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:56:27,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:27,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-13 21:56:27,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:27,512 INFO L124 PetriNetUnfolderBase]: 30/366 cut-off events. [2025-03-13 21:56:27,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:27,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 366 events. 30/366 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1665 event pairs, 8 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 436. Up to 41 conditions per place. [2025-03-13 21:56:27,519 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2025-03-13 21:56:27,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 172 transitions, 380 flow [2025-03-13 21:56:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-13 21:56:27,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2025-03-13 21:56:27,523 INFO L175 Difference]: Start difference. First operand has 173 places, 171 transitions, 346 flow. Second operand 3 states and 496 transitions. [2025-03-13 21:56:27,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 172 transitions, 380 flow [2025-03-13 21:56:27,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 172 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:56:27,527 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 348 flow [2025-03-13 21:56:27,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=174, PETRI_TRANSITIONS=170} [2025-03-13 21:56:27,528 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -10 predicate places. [2025-03-13 21:56:27,529 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 348 flow [2025-03-13 21:56:27,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:56:27,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:27,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:27,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:56:27,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:27,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1963303957, now seen corresponding path program 1 times [2025-03-13 21:56:27,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:27,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658584159] [2025-03-13 21:56:27,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:27,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:27,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:56:27,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:56:27,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:27,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:27,586 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:56:27,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:27,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658584159] [2025-03-13 21:56:27,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658584159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:27,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:27,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:27,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751439277] [2025-03-13 21:56:27,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:27,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:27,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:27,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:27,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:27,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-13 21:56:27,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:56:27,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:27,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-13 21:56:27,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:27,654 INFO L124 PetriNetUnfolderBase]: 20/222 cut-off events. [2025-03-13 21:56:27,654 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:56:27,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 222 events. 20/222 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 818 event pairs, 4 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 286. Up to 25 conditions per place. [2025-03-13 21:56:27,656 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2025-03-13 21:56:27,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 378 flow [2025-03-13 21:56:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:27,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-13 21:56:27,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2025-03-13 21:56:27,659 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 348 flow. Second operand 3 states and 496 transitions. [2025-03-13 21:56:27,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 378 flow [2025-03-13 21:56:27,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:27,663 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow [2025-03-13 21:56:27,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=172, PETRI_TRANSITIONS=168} [2025-03-13 21:56:27,664 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2025-03-13 21:56:27,664 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow [2025-03-13 21:56:27,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:56:27,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:27,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:27,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:56:27,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:27,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:27,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1117218264, now seen corresponding path program 1 times [2025-03-13 21:56:27,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:27,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493346421] [2025-03-13 21:56:27,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:27,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:27,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:56:27,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:56:27,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:27,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:27,747 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:56:27,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493346421] [2025-03-13 21:56:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493346421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:27,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:27,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:27,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760255719] [2025-03-13 21:56:27,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:27,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:27,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:27,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:27,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:27,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-13 21:56:27,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:56:27,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:27,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-13 21:56:27,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:27,815 INFO L124 PetriNetUnfolderBase]: 16/288 cut-off events. [2025-03-13 21:56:27,815 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:27,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 288 events. 16/288 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1089 event pairs, 7 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 327. Up to 26 conditions per place. [2025-03-13 21:56:27,818 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2025-03-13 21:56:27,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 168 transitions, 372 flow [2025-03-13 21:56:27,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-13 21:56:27,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2025-03-13 21:56:27,821 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 495 transitions. [2025-03-13 21:56:27,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 168 transitions, 372 flow [2025-03-13 21:56:27,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:27,823 INFO L231 Difference]: Finished difference. Result has 171 places, 167 transitions, 342 flow [2025-03-13 21:56:27,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=171, PETRI_TRANSITIONS=167} [2025-03-13 21:56:27,825 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -13 predicate places. [2025-03-13 21:56:27,825 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 167 transitions, 342 flow [2025-03-13 21:56:27,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:56:27,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:27,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:27,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:56:27,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:27,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1348173004, now seen corresponding path program 1 times [2025-03-13 21:56:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:27,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807010123] [2025-03-13 21:56:27,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:27,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 21:56:27,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 21:56:27,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:27,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:27,890 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:56:27,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:27,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807010123] [2025-03-13 21:56:27,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807010123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:27,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:27,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978577278] [2025-03-13 21:56:27,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:27,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:27,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:27,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:27,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-13 21:56:27,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 167 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:56:27,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:27,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-13 21:56:27,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:27,952 INFO L124 PetriNetUnfolderBase]: 15/283 cut-off events. [2025-03-13 21:56:27,952 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:56:27,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 283 events. 15/283 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1039 event pairs, 3 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 321. Up to 15 conditions per place. [2025-03-13 21:56:27,954 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-13 21:56:27,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 166 transitions, 366 flow [2025-03-13 21:56:27,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-13 21:56:27,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2025-03-13 21:56:27,956 INFO L175 Difference]: Start difference. First operand has 171 places, 167 transitions, 342 flow. Second operand 3 states and 495 transitions. [2025-03-13 21:56:27,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 166 transitions, 366 flow [2025-03-13 21:56:27,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 166 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:27,958 INFO L231 Difference]: Finished difference. Result has 169 places, 165 transitions, 338 flow [2025-03-13 21:56:27,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=169, PETRI_TRANSITIONS=165} [2025-03-13 21:56:27,961 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -15 predicate places. [2025-03-13 21:56:27,963 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 165 transitions, 338 flow [2025-03-13 21:56:27,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:56:27,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:27,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:27,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:56:27,963 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:27,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1606811470, now seen corresponding path program 1 times [2025-03-13 21:56:27,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:27,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142669251] [2025-03-13 21:56:27,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:27,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:27,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 21:56:27,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 21:56:27,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:27,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:28,014 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:56:28,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:28,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142669251] [2025-03-13 21:56:28,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142669251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:28,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:28,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:28,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390150781] [2025-03-13 21:56:28,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:28,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:28,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:28,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:28,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:28,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2025-03-13 21:56:28,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 165 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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:56:28,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:28,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2025-03-13 21:56:28,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:28,098 INFO L124 PetriNetUnfolderBase]: 63/521 cut-off events. [2025-03-13 21:56:28,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:28,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 521 events. 63/521 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2822 event pairs, 22 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 631. Up to 77 conditions per place. [2025-03-13 21:56:28,102 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-13 21:56:28,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 166 transitions, 374 flow [2025-03-13 21:56:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2025-03-13 21:56:28,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2025-03-13 21:56:28,103 INFO L175 Difference]: Start difference. First operand has 169 places, 165 transitions, 338 flow. Second operand 3 states and 492 transitions. [2025-03-13 21:56:28,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 166 transitions, 374 flow [2025-03-13 21:56:28,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:28,105 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 336 flow [2025-03-13 21:56:28,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=168, PETRI_TRANSITIONS=164} [2025-03-13 21:56:28,106 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -16 predicate places. [2025-03-13 21:56:28,106 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 336 flow [2025-03-13 21:56:28,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 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:56:28,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:28,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:28,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:56:28,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:28,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:28,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1109661441, now seen corresponding path program 1 times [2025-03-13 21:56:28,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:28,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176433555] [2025-03-13 21:56:28,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:28,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:28,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-13 21:56:28,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 21:56:28,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:28,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:28,143 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:56:28,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:28,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176433555] [2025-03-13 21:56:28,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176433555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:28,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:28,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:28,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979943869] [2025-03-13 21:56:28,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:28,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:28,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:28,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:28,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-13 21:56:28,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:56:28,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:28,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-13 21:56:28,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:28,206 INFO L124 PetriNetUnfolderBase]: 37/449 cut-off events. [2025-03-13 21:56:28,206 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 21:56:28,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 449 events. 37/449 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2197 event pairs, 10 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 521. Up to 32 conditions per place. [2025-03-13 21:56:28,209 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-03-13 21:56:28,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 364 flow [2025-03-13 21:56:28,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-13 21:56:28,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2025-03-13 21:56:28,211 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 336 flow. Second operand 3 states and 496 transitions. [2025-03-13 21:56:28,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 364 flow [2025-03-13 21:56:28,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:28,213 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 332 flow [2025-03-13 21:56:28,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=166, PETRI_TRANSITIONS=162} [2025-03-13 21:56:28,213 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -18 predicate places. [2025-03-13 21:56:28,213 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 332 flow [2025-03-13 21:56:28,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:56:28,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:28,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:28,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:56:28,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:28,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:28,214 INFO L85 PathProgramCache]: Analyzing trace with hash -205235462, now seen corresponding path program 1 times [2025-03-13 21:56:28,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:28,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733472588] [2025-03-13 21:56:28,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:28,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:28,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-13 21:56:28,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 21:56:28,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:28,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:28,250 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:56:28,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:28,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733472588] [2025-03-13 21:56:28,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733472588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:28,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:28,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:28,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496564038] [2025-03-13 21:56:28,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:28,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:28,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:28,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:28,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:28,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-13 21:56:28,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 162 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:28,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:28,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-13 21:56:28,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:28,296 INFO L124 PetriNetUnfolderBase]: 20/213 cut-off events. [2025-03-13 21:56:28,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:28,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 213 events. 20/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 739 event pairs, 10 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 276. Up to 34 conditions per place. [2025-03-13 21:56:28,298 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2025-03-13 21:56:28,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 163 transitions, 366 flow [2025-03-13 21:56:28,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-13 21:56:28,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2025-03-13 21:56:28,300 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 332 flow. Second operand 3 states and 496 transitions. [2025-03-13 21:56:28,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 163 transitions, 366 flow [2025-03-13 21:56:28,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:28,302 INFO L231 Difference]: Finished difference. Result has 165 places, 161 transitions, 330 flow [2025-03-13 21:56:28,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=165, PETRI_TRANSITIONS=161} [2025-03-13 21:56:28,303 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -19 predicate places. [2025-03-13 21:56:28,303 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 161 transitions, 330 flow [2025-03-13 21:56:28,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:56:28,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:28,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:28,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:56:28,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:28,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:28,304 INFO L85 PathProgramCache]: Analyzing trace with hash 439585876, now seen corresponding path program 1 times [2025-03-13 21:56:28,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:28,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042037699] [2025-03-13 21:56:28,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:28,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:28,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 21:56:28,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 21:56:28,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:28,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:28,331 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:56:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042037699] [2025-03-13 21:56:28,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042037699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:28,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:28,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:28,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434202644] [2025-03-13 21:56:28,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:28,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:28,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:28,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:28,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:28,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2025-03-13 21:56:28,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 161 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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:56:28,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:28,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2025-03-13 21:56:28,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:28,398 INFO L124 PetriNetUnfolderBase]: 33/412 cut-off events. [2025-03-13 21:56:28,398 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:28,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 412 events. 33/412 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1869 event pairs, 6 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 472. Up to 32 conditions per place. [2025-03-13 21:56:28,400 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 10 selfloop transitions, 3 changer transitions 0/161 dead transitions. [2025-03-13 21:56:28,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 356 flow [2025-03-13 21:56:28,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2025-03-13 21:56:28,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2025-03-13 21:56:28,402 INFO L175 Difference]: Start difference. First operand has 165 places, 161 transitions, 330 flow. Second operand 3 states and 498 transitions. [2025-03-13 21:56:28,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 356 flow [2025-03-13 21:56:28,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 161 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:28,404 INFO L231 Difference]: Finished difference. Result has 163 places, 159 transitions, 328 flow [2025-03-13 21:56:28,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=163, PETRI_TRANSITIONS=159} [2025-03-13 21:56:28,405 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2025-03-13 21:56:28,405 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 159 transitions, 328 flow [2025-03-13 21:56:28,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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:56:28,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:28,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:28,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:56:28,405 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:28,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:28,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1535240786, now seen corresponding path program 1 times [2025-03-13 21:56:28,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:28,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107999919] [2025-03-13 21:56:28,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:28,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:28,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 21:56:28,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 21:56:28,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:28,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:28,429 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:56:28,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:28,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107999919] [2025-03-13 21:56:28,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107999919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:28,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:28,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062022740] [2025-03-13 21:56:28,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:28,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:28,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:28,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:28,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:28,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2025-03-13 21:56:28,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 159 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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:56:28,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:28,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2025-03-13 21:56:28,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:28,472 INFO L124 PetriNetUnfolderBase]: 31/360 cut-off events. [2025-03-13 21:56:28,472 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:28,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 360 events. 31/360 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1484 event pairs, 6 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 426. Up to 32 conditions per place. [2025-03-13 21:56:28,474 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-03-13 21:56:28,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 354 flow [2025-03-13 21:56:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2025-03-13 21:56:28,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2025-03-13 21:56:28,476 INFO L175 Difference]: Start difference. First operand has 163 places, 159 transitions, 328 flow. Second operand 3 states and 498 transitions. [2025-03-13 21:56:28,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 354 flow [2025-03-13 21:56:28,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:28,478 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 322 flow [2025-03-13 21:56:28,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=161, PETRI_TRANSITIONS=157} [2025-03-13 21:56:28,479 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2025-03-13 21:56:28,479 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 322 flow [2025-03-13 21:56:28,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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:56:28,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:28,479 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:28,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:56:28,479 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:28,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:28,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1807036095, now seen corresponding path program 1 times [2025-03-13 21:56:28,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:28,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269694619] [2025-03-13 21:56:28,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:28,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:28,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-13 21:56:28,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-13 21:56:28,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:28,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:28,503 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:56:28,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:28,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269694619] [2025-03-13 21:56:28,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269694619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:28,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:28,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689253620] [2025-03-13 21:56:28,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:28,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:28,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:28,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-13 21:56:28,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 157 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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:56:28,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:28,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-13 21:56:28,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:28,548 INFO L124 PetriNetUnfolderBase]: 15/266 cut-off events. [2025-03-13 21:56:28,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:28,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 266 events. 15/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 911 event pairs, 6 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 306. Up to 25 conditions per place. [2025-03-13 21:56:28,550 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-03-13 21:56:28,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 157 transitions, 350 flow [2025-03-13 21:56:28,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-13 21:56:28,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2025-03-13 21:56:28,551 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 322 flow. Second operand 3 states and 495 transitions. [2025-03-13 21:56:28,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 157 transitions, 350 flow [2025-03-13 21:56:28,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:28,553 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 320 flow [2025-03-13 21:56:28,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=320, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2025-03-13 21:56:28,554 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2025-03-13 21:56:28,554 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 320 flow [2025-03-13 21:56:28,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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:56:28,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:28,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:28,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:56:28,555 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:28,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:28,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1716635684, now seen corresponding path program 1 times [2025-03-13 21:56:28,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:28,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703703350] [2025-03-13 21:56:28,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:28,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:28,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-13 21:56:28,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-13 21:56:28,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:28,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:28,595 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:56:28,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:28,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703703350] [2025-03-13 21:56:28,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703703350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:28,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:28,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472875441] [2025-03-13 21:56:28,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:28,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:28,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:28,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:28,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:28,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-13 21:56:28,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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:56:28,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:28,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-13 21:56:28,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:28,658 INFO L124 PetriNetUnfolderBase]: 41/436 cut-off events. [2025-03-13 21:56:28,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:28,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 436 events. 41/436 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2143 event pairs, 22 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 512. Up to 51 conditions per place. [2025-03-13 21:56:28,661 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-03-13 21:56:28,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 352 flow [2025-03-13 21:56:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-13 21:56:28,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2025-03-13 21:56:28,663 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 320 flow. Second operand 3 states and 496 transitions. [2025-03-13 21:56:28,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 352 flow [2025-03-13 21:56:28,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:28,665 INFO L231 Difference]: Finished difference. Result has 159 places, 155 transitions, 318 flow [2025-03-13 21:56:28,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=159, PETRI_TRANSITIONS=155} [2025-03-13 21:56:28,666 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2025-03-13 21:56:28,667 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 318 flow [2025-03-13 21:56:28,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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:56:28,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:28,668 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:28,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:56:28,668 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:28,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash -896941181, now seen corresponding path program 1 times [2025-03-13 21:56:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:28,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328303696] [2025-03-13 21:56:28,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:28,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:28,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-13 21:56:28,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-13 21:56:28,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:28,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:28,734 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:56:28,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:28,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328303696] [2025-03-13 21:56:28,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328303696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:28,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:28,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:56:28,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530993365] [2025-03-13 21:56:28,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:28,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:28,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:28,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:28,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:28,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2025-03-13 21:56:28,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:56:28,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:28,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2025-03-13 21:56:28,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:28,784 INFO L124 PetriNetUnfolderBase]: 25/550 cut-off events. [2025-03-13 21:56:28,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:28,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 550 events. 25/550 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2290 event pairs, 6 based on Foata normal form. 4/504 useless extension candidates. Maximal degree in co-relation 611. Up to 21 conditions per place. [2025-03-13 21:56:28,788 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2025-03-13 21:56:28,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 158 transitions, 350 flow [2025-03-13 21:56:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-03-13 21:56:28,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2025-03-13 21:56:28,790 INFO L175 Difference]: Start difference. First operand has 159 places, 155 transitions, 318 flow. Second operand 3 states and 506 transitions. [2025-03-13 21:56:28,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 158 transitions, 350 flow [2025-03-13 21:56:28,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 158 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:28,792 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 326 flow [2025-03-13 21:56:28,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=160, PETRI_TRANSITIONS=156} [2025-03-13 21:56:28,793 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2025-03-13 21:56:28,793 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 326 flow [2025-03-13 21:56:28,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:56:28,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:28,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:28,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:56:28,794 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:28,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash 906576233, now seen corresponding path program 1 times [2025-03-13 21:56:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:28,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592195896] [2025-03-13 21:56:28,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:28,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:28,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-13 21:56:28,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-13 21:56:28,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:28,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:28,821 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:56:28,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:28,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592195896] [2025-03-13 21:56:28,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592195896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:28,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:28,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:28,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208696665] [2025-03-13 21:56:28,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:28,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:28,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:28,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:28,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2025-03-13 21:56:28,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:56:28,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:28,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2025-03-13 21:56:28,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:28,898 INFO L124 PetriNetUnfolderBase]: 65/584 cut-off events. [2025-03-13 21:56:28,899 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 21:56:28,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 584 events. 65/584 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2924 event pairs, 38 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 721. Up to 83 conditions per place. [2025-03-13 21:56:28,902 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-03-13 21:56:28,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 360 flow [2025-03-13 21:56:28,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2025-03-13 21:56:28,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2025-03-13 21:56:28,903 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 326 flow. Second operand 3 states and 494 transitions. [2025-03-13 21:56:28,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 360 flow [2025-03-13 21:56:28,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:56:28,906 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 326 flow [2025-03-13 21:56:28,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2025-03-13 21:56:28,906 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2025-03-13 21:56:28,906 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 326 flow [2025-03-13 21:56:28,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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:56:28,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:28,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:28,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:56:28,907 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:28,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:28,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1058460167, now seen corresponding path program 1 times [2025-03-13 21:56:28,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:28,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53170435] [2025-03-13 21:56:28,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:28,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:28,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-13 21:56:28,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-13 21:56:28,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:28,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:28,937 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:56:28,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:28,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53170435] [2025-03-13 21:56:28,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53170435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:28,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:28,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:28,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553460687] [2025-03-13 21:56:28,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:28,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:28,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:28,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:28,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:28,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2025-03-13 21:56:28,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:56:28,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:28,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2025-03-13 21:56:28,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:29,003 INFO L124 PetriNetUnfolderBase]: 49/554 cut-off events. [2025-03-13 21:56:29,003 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:29,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 554 events. 49/554 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2412 event pairs, 10 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 651. Up to 40 conditions per place. [2025-03-13 21:56:29,007 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 10 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-03-13 21:56:29,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 354 flow [2025-03-13 21:56:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2025-03-13 21:56:29,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8953900709219859 [2025-03-13 21:56:29,009 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 326 flow. Second operand 3 states and 505 transitions. [2025-03-13 21:56:29,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 354 flow [2025-03-13 21:56:29,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:29,012 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 330 flow [2025-03-13 21:56:29,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2025-03-13 21:56:29,012 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2025-03-13 21:56:29,012 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 330 flow [2025-03-13 21:56:29,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:56:29,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:29,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:29,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:56:29,013 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:29,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:29,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1414038107, now seen corresponding path program 1 times [2025-03-13 21:56:29,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:29,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825119936] [2025-03-13 21:56:29,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:29,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:29,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-13 21:56:29,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-13 21:56:29,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:29,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:29,054 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:56:29,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:29,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825119936] [2025-03-13 21:56:29,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825119936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:29,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:29,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:29,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555727071] [2025-03-13 21:56:29,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:29,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:29,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:29,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:29,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:29,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2025-03-13 21:56:29,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:56:29,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:29,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2025-03-13 21:56:29,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:29,118 INFO L124 PetriNetUnfolderBase]: 69/572 cut-off events. [2025-03-13 21:56:29,118 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 21:56:29,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 572 events. 69/572 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2872 event pairs, 42 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 733. Up to 91 conditions per place. [2025-03-13 21:56:29,121 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2025-03-13 21:56:29,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 364 flow [2025-03-13 21:56:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2025-03-13 21:56:29,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2025-03-13 21:56:29,122 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 330 flow. Second operand 3 states and 494 transitions. [2025-03-13 21:56:29,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 364 flow [2025-03-13 21:56:29,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:56:29,124 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 330 flow [2025-03-13 21:56:29,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2025-03-13 21:56:29,125 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2025-03-13 21:56:29,125 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 330 flow [2025-03-13 21:56:29,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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:56:29,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:29,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:29,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:56:29,126 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:29,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash 29686777, now seen corresponding path program 1 times [2025-03-13 21:56:29,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:29,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666453615] [2025-03-13 21:56:29,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:29,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:29,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-13 21:56:29,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-13 21:56:29,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:29,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:29,156 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:56:29,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:29,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666453615] [2025-03-13 21:56:29,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666453615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:29,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:29,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:29,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149961221] [2025-03-13 21:56:29,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:29,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:29,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:29,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:29,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:29,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2025-03-13 21:56:29,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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:56:29,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:29,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2025-03-13 21:56:29,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:29,223 INFO L124 PetriNetUnfolderBase]: 57/556 cut-off events. [2025-03-13 21:56:29,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:29,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 556 events. 57/556 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2560 event pairs, 38 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 705. Up to 83 conditions per place. [2025-03-13 21:56:29,225 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2025-03-13 21:56:29,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 366 flow [2025-03-13 21:56:29,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2025-03-13 21:56:29,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2025-03-13 21:56:29,227 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 330 flow. Second operand 3 states and 492 transitions. [2025-03-13 21:56:29,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 366 flow [2025-03-13 21:56:29,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:29,229 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 328 flow [2025-03-13 21:56:29,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=159, PETRI_TRANSITIONS=153} [2025-03-13 21:56:29,229 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2025-03-13 21:56:29,229 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 328 flow [2025-03-13 21:56:29,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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:56:29,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:29,230 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:29,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:56:29,230 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:29,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:29,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1654812180, now seen corresponding path program 1 times [2025-03-13 21:56:29,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:29,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643319442] [2025-03-13 21:56:29,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:29,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:29,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-13 21:56:29,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-13 21:56:29,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:29,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:29,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:29,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643319442] [2025-03-13 21:56:29,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643319442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:56:29,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257441671] [2025-03-13 21:56:29,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:29,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:56:29,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:56:29,308 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:56:29,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:56:29,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-13 21:56:29,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-13 21:56:29,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:29,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:29,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:56:29,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:56:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:56:29,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:56:29,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257441671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:29,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:56:29,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-13 21:56:29,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539910099] [2025-03-13 21:56:29,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:29,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:29,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:29,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:29,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:56:29,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2025-03-13 21:56:29,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 153 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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:56:29,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:29,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2025-03-13 21:56:29,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:29,442 INFO L124 PetriNetUnfolderBase]: 36/485 cut-off events. [2025-03-13 21:56:29,443 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:29,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 485 events. 36/485 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1799 event pairs, 1 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 563. Up to 31 conditions per place. [2025-03-13 21:56:29,445 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 9 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2025-03-13 21:56:29,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 362 flow [2025-03-13 21:56:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2025-03-13 21:56:29,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9024822695035462 [2025-03-13 21:56:29,447 INFO L175 Difference]: Start difference. First operand has 159 places, 153 transitions, 328 flow. Second operand 3 states and 509 transitions. [2025-03-13 21:56:29,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 362 flow [2025-03-13 21:56:29,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:29,449 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 358 flow [2025-03-13 21:56:29,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=161, PETRI_TRANSITIONS=157} [2025-03-13 21:56:29,450 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2025-03-13 21:56:29,450 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 358 flow [2025-03-13 21:56:29,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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:56:29,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:29,450 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:29,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:56:29,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-13 21:56:29,655 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:29,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:29,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1346468869, now seen corresponding path program 1 times [2025-03-13 21:56:29,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:29,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918992352] [2025-03-13 21:56:29,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:29,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:29,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-13 21:56:29,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-13 21:56:29,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:29,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:29,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918992352] [2025-03-13 21:56:29,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918992352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:56:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601540091] [2025-03-13 21:56:29,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:29,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:56:29,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:56:29,731 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:56:29,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:56:29,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-13 21:56:29,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-13 21:56:29,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:29,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:29,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:56:29,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:56:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:56:29,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:56:29,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601540091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:29,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:56:29,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-13 21:56:29,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10230809] [2025-03-13 21:56:29,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:29,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:29,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:29,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:56:29,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2025-03-13 21:56:29,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 157 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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:56:29,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:29,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2025-03-13 21:56:29,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:29,867 INFO L124 PetriNetUnfolderBase]: 78/601 cut-off events. [2025-03-13 21:56:29,867 INFO L125 PetriNetUnfolderBase]: For 138/151 co-relation queries the response was YES. [2025-03-13 21:56:29,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 601 events. 78/601 cut-off events. For 138/151 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2759 event pairs, 0 based on Foata normal form. 8/564 useless extension candidates. Maximal degree in co-relation 865. Up to 59 conditions per place. [2025-03-13 21:56:29,871 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 12 selfloop transitions, 6 changer transitions 0/164 dead transitions. [2025-03-13 21:56:29,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 164 transitions, 422 flow [2025-03-13 21:56:29,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2025-03-13 21:56:29,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042553191489362 [2025-03-13 21:56:29,873 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 358 flow. Second operand 3 states and 510 transitions. [2025-03-13 21:56:29,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 164 transitions, 422 flow [2025-03-13 21:56:29,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 164 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:29,875 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 408 flow [2025-03-13 21:56:29,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=163, PETRI_TRANSITIONS=163} [2025-03-13 21:56:29,876 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2025-03-13 21:56:29,876 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 408 flow [2025-03-13 21:56:29,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 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:56:29,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:29,876 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:29,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:56:30,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:56:30,081 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:30,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:30,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1399803776, now seen corresponding path program 1 times [2025-03-13 21:56:30,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:30,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-03-13 21:56:30,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:30,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:30,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-13 21:56:30,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-13 21:56:30,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:30,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:30,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:30,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643998677] [2025-03-13 21:56:30,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643998677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:56:30,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777499349] [2025-03-13 21:56:30,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:30,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:56:30,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:56:30,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:56:30,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:56:30,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-13 21:56:30,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-13 21:56:30,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:30,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:30,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:56:30,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:56:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:30,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:56:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:30,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777499349] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:56:30,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:56:30,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:56:30,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134220304] [2025-03-13 21:56:30,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:56:30,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:56:30,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:30,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:56:30,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:56:30,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2025-03-13 21:56:30,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 163 transitions, 408 flow. Second operand has 10 states, 10 states have (on average 161.4) internal successors, (1614), 10 states have internal predecessors, (1614), 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:56:30,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:30,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2025-03-13 21:56:30,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:30,561 INFO L124 PetriNetUnfolderBase]: 242/1310 cut-off events. [2025-03-13 21:56:30,561 INFO L125 PetriNetUnfolderBase]: For 1036/1068 co-relation queries the response was YES. [2025-03-13 21:56:30,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2354 conditions, 1310 events. 242/1310 cut-off events. For 1036/1068 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6516 event pairs, 13 based on Foata normal form. 16/1267 useless extension candidates. Maximal degree in co-relation 2346. Up to 138 conditions per place. [2025-03-13 21:56:30,571 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 63 selfloop transitions, 9 changer transitions 0/213 dead transitions. [2025-03-13 21:56:30,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 213 transitions, 864 flow [2025-03-13 21:56:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:56:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:56:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2025-03-13 21:56:30,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8693853427895981 [2025-03-13 21:56:30,574 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 408 flow. Second operand 9 states and 1471 transitions. [2025-03-13 21:56:30,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 213 transitions, 864 flow [2025-03-13 21:56:30,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 213 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:30,577 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 446 flow [2025-03-13 21:56:30,578 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=446, PETRI_PLACES=172, PETRI_TRANSITIONS=169} [2025-03-13 21:56:30,578 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2025-03-13 21:56:30,578 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 446 flow [2025-03-13 21:56:30,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 161.4) internal successors, (1614), 10 states have internal predecessors, (1614), 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:56:30,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:30,579 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:30,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:56:30,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:56:30,780 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:30,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash 171957600, now seen corresponding path program 2 times [2025-03-13 21:56:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:30,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132718002] [2025-03-13 21:56:30,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:56:30,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:30,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-03-13 21:56:30,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-03-13 21:56:30,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:56:30,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:30,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:30,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132718002] [2025-03-13 21:56:30,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132718002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:56:30,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580945885] [2025-03-13 21:56:30,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:56:30,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:56:30,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:56:30,961 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:56:30,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:56:31,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-03-13 21:56:31,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-03-13 21:56:31,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:56:31,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:31,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:56:31,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:56:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:31,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:56:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:31,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580945885] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:56:31,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:56:31,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-13 21:56:31,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361407695] [2025-03-13 21:56:31,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:56:31,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 21:56:31,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:31,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 21:56:31,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:56:31,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2025-03-13 21:56:31,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 169 transitions, 446 flow. Second operand has 18 states, 18 states have (on average 161.22222222222223) internal successors, (2902), 18 states have internal predecessors, (2902), 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:56:31,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:31,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2025-03-13 21:56:31,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:31,815 INFO L124 PetriNetUnfolderBase]: 402/2170 cut-off events. [2025-03-13 21:56:31,815 INFO L125 PetriNetUnfolderBase]: For 1539/1571 co-relation queries the response was YES. [2025-03-13 21:56:31,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3921 conditions, 2170 events. 402/2170 cut-off events. For 1539/1571 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 10496 event pairs, 13 based on Foata normal form. 26/2135 useless extension candidates. Maximal degree in co-relation 3911. Up to 218 conditions per place. [2025-03-13 21:56:31,831 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 139 selfloop transitions, 21 changer transitions 0/301 dead transitions. [2025-03-13 21:56:31,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 301 transitions, 1546 flow [2025-03-13 21:56:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:56:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:56:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3421 transitions. [2025-03-13 21:56:31,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8665146909827761 [2025-03-13 21:56:31,837 INFO L175 Difference]: Start difference. First operand has 172 places, 169 transitions, 446 flow. Second operand 21 states and 3421 transitions. [2025-03-13 21:56:31,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 301 transitions, 1546 flow [2025-03-13 21:56:31,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 301 transitions, 1532 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:56:31,843 INFO L231 Difference]: Finished difference. Result has 196 places, 182 transitions, 570 flow [2025-03-13 21:56:31,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=570, PETRI_PLACES=196, PETRI_TRANSITIONS=182} [2025-03-13 21:56:31,844 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 12 predicate places. [2025-03-13 21:56:31,844 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 182 transitions, 570 flow [2025-03-13 21:56:31,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 161.22222222222223) internal successors, (2902), 18 states have internal predecessors, (2902), 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:56:31,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:31,846 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:31,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:56:32,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:56:32,047 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:32,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:32,048 INFO L85 PathProgramCache]: Analyzing trace with hash -883512544, now seen corresponding path program 3 times [2025-03-13 21:56:32,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:32,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537608685] [2025-03-13 21:56:32,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:56:32,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:32,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 310 statements into 8 equivalence classes. [2025-03-13 21:56:32,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 310 of 310 statements. [2025-03-13 21:56:32,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-13 21:56:32,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:32,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:32,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537608685] [2025-03-13 21:56:32,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537608685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:56:32,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984952284] [2025-03-13 21:56:32,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:56:32,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:56:32,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:56:32,623 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:56:32,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:56:32,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 310 statements into 8 equivalence classes. [2025-03-13 21:56:32,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 310 of 310 statements. [2025-03-13 21:56:32,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-13 21:56:32,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:32,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 21:56:32,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:56:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:33,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:56:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:56:33,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984952284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:56:33,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:56:33,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 31 [2025-03-13 21:56:33,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227506074] [2025-03-13 21:56:33,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:56:33,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-13 21:56:33,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:33,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-13 21:56:33,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2025-03-13 21:56:33,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2025-03-13 21:56:33,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 182 transitions, 570 flow. Second operand has 31 states, 31 states have (on average 161.19354838709677) internal successors, (4997), 31 states have internal predecessors, (4997), 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:56:33,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:33,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2025-03-13 21:56:33,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:34,429 INFO L124 PetriNetUnfolderBase]: 682/3675 cut-off events. [2025-03-13 21:56:34,429 INFO L125 PetriNetUnfolderBase]: For 4232/4264 co-relation queries the response was YES. [2025-03-13 21:56:34,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7047 conditions, 3675 events. 682/3675 cut-off events. For 4232/4264 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 17401 event pairs, 13 based on Foata normal form. 41/3655 useless extension candidates. Maximal degree in co-relation 7032. Up to 358 conditions per place. [2025-03-13 21:56:34,476 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 272 selfloop transitions, 42 changer transitions 0/455 dead transitions. [2025-03-13 21:56:34,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 455 transitions, 2894 flow [2025-03-13 21:56:34,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-13 21:56:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-13 21:56:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 6833 transitions. [2025-03-13 21:56:34,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8653748733535968 [2025-03-13 21:56:34,485 INFO L175 Difference]: Start difference. First operand has 196 places, 182 transitions, 570 flow. Second operand 42 states and 6833 transitions. [2025-03-13 21:56:34,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 455 transitions, 2894 flow [2025-03-13 21:56:34,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 455 transitions, 2856 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-03-13 21:56:34,494 INFO L231 Difference]: Finished difference. Result has 239 places, 204 transitions, 818 flow [2025-03-13 21:56:34,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=818, PETRI_PLACES=239, PETRI_TRANSITIONS=204} [2025-03-13 21:56:34,494 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 55 predicate places. [2025-03-13 21:56:34,495 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 204 transitions, 818 flow [2025-03-13 21:56:34,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 161.19354838709677) internal successors, (4997), 31 states have internal predecessors, (4997), 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:56:34,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:34,496 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:34,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-13 21:56:34,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-13 21:56:34,697 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-13 21:56:34,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash 226270199, now seen corresponding path program 4 times [2025-03-13 21:56:34,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:34,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927490027] [2025-03-13 21:56:34,699 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:56:34,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:34,713 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 555 statements into 2 equivalence classes. [2025-03-13 21:56:34,744 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 555 of 555 statements. [2025-03-13 21:56:34,744 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:56:34,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:56:34,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:56:34,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-03-13 21:56:34,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-03-13 21:56:34,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:34,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:56:35,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:56:35,035 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:56:35,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2025-03-13 21:56:35,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-03-13 21:56:35,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-03-13 21:56:35,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-03-13 21:56:35,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-03-13 21:56:35,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-03-13 21:56:35,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-03-13 21:56:35,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-03-13 21:56:35,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-03-13 21:56:35,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-03-13 21:56:35,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-03-13 21:56:35,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-03-13 21:56:35,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-03-13 21:56:35,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-03-13 21:56:35,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-03-13 21:56:35,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-03-13 21:56:35,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-03-13 21:56:35,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-03-13 21:56:35,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 21:56:35,041 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:56:35,237 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:56:35,238 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:56:35,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:56:35 BasicIcfg [2025-03-13 21:56:35,244 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:56:35,245 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:56:35,245 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:56:35,245 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:56:35,245 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:56:26" (3/4) ... [2025-03-13 21:56:35,246 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 21:56:35,392 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 35. [2025-03-13 21:56:35,451 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:56:35,451 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:56:35,451 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:56:35,452 INFO L158 Benchmark]: Toolchain (without parser) took 9461.62ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 112.3MB in the beginning and 50.2MB in the end (delta: 62.1MB). Peak memory consumption was 192.6MB. Max. memory is 16.1GB. [2025-03-13 21:56:35,452 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:56:35,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.26ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 92.3MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:56:35,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.24ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:56:35,453 INFO L158 Benchmark]: Boogie Preprocessor took 22.56ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.9MB in the end (delta: 970.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:56:35,453 INFO L158 Benchmark]: IcfgBuilder took 440.76ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 66.6MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:56:35,453 INFO L158 Benchmark]: TraceAbstraction took 8400.22ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 66.2MB in the beginning and 142.5MB in the end (delta: -76.3MB). Peak memory consumption was 160.7MB. Max. memory is 16.1GB. [2025-03-13 21:56:35,453 INFO L158 Benchmark]: Witness Printer took 206.87ms. Allocated memory is still 276.8MB. Free memory was 142.5MB in the beginning and 50.2MB in the end (delta: 92.3MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2025-03-13 21:56:35,454 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.26ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 92.3MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.24ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.8MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.56ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 89.9MB in the end (delta: 970.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 440.76ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 66.6MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8400.22ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 66.2MB in the beginning and 142.5MB in the end (delta: -76.3MB). Peak memory consumption was 160.7MB. Max. memory is 16.1GB. * Witness Printer took 206.87ms. Allocated memory is still 276.8MB. Free memory was 142.5MB in the beginning and 50.2MB in the end (delta: 92.3MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 725]: Data race detected Data race detected The following path leads to a data race: [L683] 0 int i, j; VAL [i=0, j=0] [L686] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L703] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L704] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L714] 0 pthread_t id1, id2; VAL [\old(argc)=656, \old(argv)={655:614}, argc=656, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L716] 0 i = 1 VAL [\old(argc)=656, \old(argv)={655:614}, argc=656, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L719] 0 j = 1 VAL [\old(argc)=656, \old(argv)={655:614}, argc=656, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=656, \old(argv)={655:614}, argc=656, cur=1, i=1, id1=-1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=656, \old(argv)={655:614}, argc=656, cur=1, i=1, id1=-1, id2=0, j=1, next=0, p=0, prev=0, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=0, q=0, x=0] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=1, q=0, x=2] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=2, q=0, x=3] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=3, q=0, x=4] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=5, q=0, x=5] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=8, q=0, x=6] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=13, q=0, x=7] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=21, q=0, x=8] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=34, q=0, x=9] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=55, q=0, x=10] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=89, q=0, x=11] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=144, q=0, x=12] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] COND TRUE 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=233, q=0, x=13] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] COND TRUE 0 x < 14 [L706] 0 x < 14 VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] COND FALSE 0 !(x < 14) VAL [\old(arg)={0:0}, \old(arg)={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L711] 0 return prev; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result=377, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=656, \old(argv)={655:614}, argc=656, correct=377, cur=610, i=1, id1=-1, id2=0, j=1, next=610, p=0, prev=377, q=0, x=14] [L725] 0 i <= correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=656, \old(argv)={655:614}, argc=656, correct=377, cur=610, i=1, id1=-1, id2=0, j=1, next=610, p=0, prev=377, q=0, x=14] [L688] 1 p = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L688] COND TRUE 1 p < 6 [L688] 1 p < 6 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L688] COND TRUE 1 p < 6 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L690] EXPR 1 i + j [L690] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=2, j=1, next=610, p=0, prev=377, q=0, x=14] [L725] 0 i <= correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=656, \old(argv)={655:614}, arg={0:0}, argc=656, correct=377, cur=610, i=2, id1=-1, id2=0, j=1, next=610, p=0, prev=377, q=0, x=14] Now there is a data race on ~i~0 between C: i = i + j [690] and C: i <= correct [725] - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 240 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.1s, OverallIterations: 23, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 860 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 651 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 855 IncrementalHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 84 mSDtfsCounter, 855 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1453 GetRequests, 1331 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=818occurred in iteration=22, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2899 NumberOfCodeBlocks, 2899 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2894 ConstructedInterpolants, 0 QuantifiedInterpolants, 5546 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1434 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 30 InterpolantComputations, 19 PerfectInterpolantSequences, 6/2631 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-13 21:56:35,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)