./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_safe-11-racy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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-11-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 deae7fd0ef95d67bb618281e50bfba6f50a83de212ef14f46660866b256c6152 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:41:34,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:41:34,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:41:34,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:41:34,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:41:34,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:41:34,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:41:34,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:41:34,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:41:34,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:41:34,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:41:34,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:41:34,284 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:41:34,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:41:34,284 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:41:34,284 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:41:34,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:41:34,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:41:34,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:41:34,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:41:34,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:41:34,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:41:34,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:41:34,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:41:34,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:41:34,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:41:34,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:41:34,287 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 -> deae7fd0ef95d67bb618281e50bfba6f50a83de212ef14f46660866b256c6152 [2025-03-17 10:41:34,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:41:34,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:41:34,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:41:34,531 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:41:34,532 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:41:34,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_safe-11-racy.i [2025-03-17 10:41:35,692 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f879385d0/205733950dd24694b936cd14975e64b2/FLAG0f1ff28ec [2025-03-17 10:41:36,013 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:41:36,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_safe-11-racy.i [2025-03-17 10:41:36,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f879385d0/205733950dd24694b936cd14975e64b2/FLAG0f1ff28ec [2025-03-17 10:41:36,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f879385d0/205733950dd24694b936cd14975e64b2 [2025-03-17 10:41:36,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:41:36,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:41:36,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:41:36,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:41:36,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:41:36,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:41:36" (1/1) ... [2025-03-17 10:41:36,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710f6ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36, skipping insertion in model container [2025-03-17 10:41:36,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:41:36" (1/1) ... [2025-03-17 10:41:36,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:41:36,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:41:36,583 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:41:36,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:41:36,664 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:41:36,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36 WrapperNode [2025-03-17 10:41:36,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:41:36,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:41:36,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:41:36,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:41:36,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36" (1/1) ... [2025-03-17 10:41:36,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36" (1/1) ... [2025-03-17 10:41:36,696 INFO L138 Inliner]: procedures = 163, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 113 [2025-03-17 10:41:36,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:41:36,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:41:36,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:41:36,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:41:36,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36" (1/1) ... [2025-03-17 10:41:36,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36" (1/1) ... [2025-03-17 10:41:36,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36" (1/1) ... [2025-03-17 10:41:36,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36" (1/1) ... [2025-03-17 10:41:36,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36" (1/1) ... [2025-03-17 10:41:36,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36" (1/1) ... [2025-03-17 10:41:36,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36" (1/1) ... [2025-03-17 10:41:36,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36" (1/1) ... [2025-03-17 10:41:36,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:41:36,720 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:41:36,720 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:41:36,720 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:41:36,721 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36" (1/1) ... [2025-03-17 10:41:36,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:41:36,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:41:36,750 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-17 10:41:36,753 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-17 10:41:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-17 10:41:36,773 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-17 10:41:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-17 10:41:36,773 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-17 10:41:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 10:41:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:41:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:41:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 10:41:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:41:36,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:41:36,775 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:41:36,882 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:41:36,884 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:41:37,123 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:41:37,123 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:41:37,159 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:41:37,159 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:41:37,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:41:37 BoogieIcfgContainer [2025-03-17 10:41:37,160 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:41:37,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:41:37,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:41:37,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:41:37,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:41:36" (1/3) ... [2025-03-17 10:41:37,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd6aa4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:41:37, skipping insertion in model container [2025-03-17 10:41:37,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:41:36" (2/3) ... [2025-03-17 10:41:37,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd6aa4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:41:37, skipping insertion in model container [2025-03-17 10:41:37,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:41:37" (3/3) ... [2025-03-17 10:41:37,171 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_safe-11-racy.i [2025-03-17 10:41:37,184 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:41:37,185 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_safe-11-racy.i that has 3 procedures, 180 locations, 1 initial locations, 3 loop locations, and 30 error locations. [2025-03-17 10:41:37,185 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:41:37,244 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 10:41:37,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 188 transitions, 384 flow [2025-03-17 10:41:37,344 INFO L124 PetriNetUnfolderBase]: 9/186 cut-off events. [2025-03-17 10:41:37,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:37,354 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-17 10:41:37,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 188 transitions, 384 flow [2025-03-17 10:41:37,358 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 186 transitions, 378 flow [2025-03-17 10:41:37,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:41:37,373 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;@24f67d82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:41:37,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-17 10:41:37,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:41:37,378 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-03-17 10:41:37,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:37,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:37,379 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-17 10:41:37,379 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-17 10:41:37,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:37,383 INFO L85 PathProgramCache]: Analyzing trace with hash 331207873, now seen corresponding path program 1 times [2025-03-17 10:41:37,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:37,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645099070] [2025-03-17 10:41:37,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:37,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:37,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 10:41:37,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 10:41:37,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:37,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:37,533 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-17 10:41:37,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:37,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645099070] [2025-03-17 10:41:37,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645099070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:37,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:37,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 10:41:37,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873611646] [2025-03-17 10:41:37,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:37,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:41:37,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:37,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:41:37,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:41:37,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 188 [2025-03-17 10:41:37,565 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-17 10:41:37,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:37,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 188 [2025-03-17 10:41:37,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:37,657 INFO L124 PetriNetUnfolderBase]: 9/286 cut-off events. [2025-03-17 10:41:37,657 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 10:41:37,662 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 963 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-17 10:41:37,666 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 6 selfloop transitions, 0 changer transitions 0/171 dead transitions. [2025-03-17 10:41:37,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 171 transitions, 360 flow [2025-03-17 10:41:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:41:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-17 10:41:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2025-03-17 10:41:37,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9441489361702128 [2025-03-17 10:41:37,682 INFO L175 Difference]: Start difference. First operand has 184 places, 186 transitions, 378 flow. Second operand 2 states and 355 transitions. [2025-03-17 10:41:37,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 171 transitions, 360 flow [2025-03-17 10:41:37,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 171 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:37,692 INFO L231 Difference]: Finished difference. Result has 173 places, 171 transitions, 346 flow [2025-03-17 10:41:37,694 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-17 10:41:37,699 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -11 predicate places. [2025-03-17 10:41:37,699 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 171 transitions, 346 flow [2025-03-17 10:41:37,700 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-17 10:41:37,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:37,700 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-17 10:41:37,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:41:37,701 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-17 10:41:37,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash 106385309, now seen corresponding path program 1 times [2025-03-17 10:41:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:37,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127097409] [2025-03-17 10:41:37,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:37,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:37,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 10:41:37,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 10:41:37,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:37,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:37,795 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-17 10:41:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:37,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127097409] [2025-03-17 10:41:37,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127097409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:37,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:37,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:37,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733131726] [2025-03-17 10:41:37,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:37,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:37,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:37,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:37,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-17 10:41:37,829 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-17 10:41:37,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:37,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-17 10:41:37,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:37,912 INFO L124 PetriNetUnfolderBase]: 30/366 cut-off events. [2025-03-17 10:41:37,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:37,916 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 1679 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-17 10:41:37,918 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2025-03-17 10:41:37,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 172 transitions, 380 flow [2025-03-17 10:41:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-17 10:41:37,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2025-03-17 10:41:37,923 INFO L175 Difference]: Start difference. First operand has 173 places, 171 transitions, 346 flow. Second operand 3 states and 496 transitions. [2025-03-17 10:41:37,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 172 transitions, 380 flow [2025-03-17 10:41:37,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 172 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:41:37,926 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 348 flow [2025-03-17 10:41:37,927 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-17 10:41:37,928 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -10 predicate places. [2025-03-17 10:41:37,928 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 348 flow [2025-03-17 10:41:37,928 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-17 10:41:37,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:37,929 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-17 10:41:37,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:41:37,929 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-17 10:41:37,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash -360714879, now seen corresponding path program 1 times [2025-03-17 10:41:37,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:37,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101953097] [2025-03-17 10:41:37,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:37,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 10:41:37,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 10:41:37,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:37,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:37,991 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-17 10:41:37,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:37,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101953097] [2025-03-17 10:41:37,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101953097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:37,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:37,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:37,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659851157] [2025-03-17 10:41:37,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:37,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:37,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:37,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:37,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:38,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-17 10:41:38,007 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-17 10:41:38,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:38,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-17 10:41:38,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:38,039 INFO L124 PetriNetUnfolderBase]: 20/222 cut-off events. [2025-03-17 10:41:38,039 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-17 10:41:38,040 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 821 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-17 10:41:38,041 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2025-03-17 10:41:38,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 378 flow [2025-03-17 10:41:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-17 10:41:38,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2025-03-17 10:41:38,043 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 348 flow. Second operand 3 states and 496 transitions. [2025-03-17 10:41:38,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 378 flow [2025-03-17 10:41:38,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:38,045 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow [2025-03-17 10:41:38,046 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-17 10:41:38,046 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2025-03-17 10:41:38,046 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow [2025-03-17 10:41:38,047 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-17 10:41:38,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:38,047 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-17 10:41:38,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:41:38,047 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-17 10:41:38,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:38,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1681520255, now seen corresponding path program 1 times [2025-03-17 10:41:38,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:38,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936064358] [2025-03-17 10:41:38,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:38,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:38,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 10:41:38,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 10:41:38,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:38,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:38,104 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-17 10:41:38,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:38,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936064358] [2025-03-17 10:41:38,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936064358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:38,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:38,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:38,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118204076] [2025-03-17 10:41:38,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:38,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:38,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:38,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:38,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:38,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-17 10:41:38,125 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-17 10:41:38,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:38,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-17 10:41:38,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:38,159 INFO L124 PetriNetUnfolderBase]: 16/288 cut-off events. [2025-03-17 10:41:38,159 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:38,160 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 1087 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-17 10:41:38,162 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2025-03-17 10:41:38,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 168 transitions, 372 flow [2025-03-17 10:41:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-17 10:41:38,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2025-03-17 10:41:38,163 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 495 transitions. [2025-03-17 10:41:38,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 168 transitions, 372 flow [2025-03-17 10:41:38,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:38,166 INFO L231 Difference]: Finished difference. Result has 171 places, 167 transitions, 342 flow [2025-03-17 10:41:38,166 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-17 10:41:38,166 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -13 predicate places. [2025-03-17 10:41:38,166 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 167 transitions, 342 flow [2025-03-17 10:41:38,167 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-17 10:41:38,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:38,167 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-17 10:41:38,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:41:38,167 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-17 10:41:38,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:38,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1965904517, now seen corresponding path program 1 times [2025-03-17 10:41:38,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:38,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003793303] [2025-03-17 10:41:38,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:38,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 10:41:38,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 10:41:38,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:38,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:38,210 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-17 10:41:38,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:38,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003793303] [2025-03-17 10:41:38,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003793303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:38,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:38,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:38,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145857390] [2025-03-17 10:41:38,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:38,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:38,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:38,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:38,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:38,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-17 10:41:38,226 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-17 10:41:38,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:38,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-17 10:41:38,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:38,264 INFO L124 PetriNetUnfolderBase]: 15/283 cut-off events. [2025-03-17 10:41:38,264 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 10:41:38,265 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 1034 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-17 10:41:38,266 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-17 10:41:38,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 166 transitions, 366 flow [2025-03-17 10:41:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-17 10:41:38,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2025-03-17 10:41:38,267 INFO L175 Difference]: Start difference. First operand has 171 places, 167 transitions, 342 flow. Second operand 3 states and 495 transitions. [2025-03-17 10:41:38,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 166 transitions, 366 flow [2025-03-17 10:41:38,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 166 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:38,270 INFO L231 Difference]: Finished difference. Result has 169 places, 165 transitions, 338 flow [2025-03-17 10:41:38,270 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-17 10:41:38,270 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -15 predicate places. [2025-03-17 10:41:38,270 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 165 transitions, 338 flow [2025-03-17 10:41:38,271 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-17 10:41:38,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:38,271 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-17 10:41:38,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:41:38,271 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-17 10:41:38,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:38,271 INFO L85 PathProgramCache]: Analyzing trace with hash 423637799, now seen corresponding path program 1 times [2025-03-17 10:41:38,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:38,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346469738] [2025-03-17 10:41:38,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:38,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:38,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 10:41:38,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 10:41:38,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:38,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:38,309 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-17 10:41:38,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346469738] [2025-03-17 10:41:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346469738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:38,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:38,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792140589] [2025-03-17 10:41:38,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:38,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:38,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:38,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:38,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2025-03-17 10:41:38,333 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-17 10:41:38,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:38,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2025-03-17 10:41:38,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:38,410 INFO L124 PetriNetUnfolderBase]: 63/521 cut-off events. [2025-03-17 10:41:38,411 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:38,413 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 2816 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-17 10:41:38,415 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-17 10:41:38,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 166 transitions, 374 flow [2025-03-17 10:41:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2025-03-17 10:41:38,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2025-03-17 10:41:38,417 INFO L175 Difference]: Start difference. First operand has 169 places, 165 transitions, 338 flow. Second operand 3 states and 492 transitions. [2025-03-17 10:41:38,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 166 transitions, 374 flow [2025-03-17 10:41:38,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:38,420 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 336 flow [2025-03-17 10:41:38,420 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-17 10:41:38,421 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -16 predicate places. [2025-03-17 10:41:38,421 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 336 flow [2025-03-17 10:41:38,422 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-17 10:41:38,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:38,422 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-17 10:41:38,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:41:38,422 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-17 10:41:38,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:38,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1980072865, now seen corresponding path program 1 times [2025-03-17 10:41:38,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:38,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624597905] [2025-03-17 10:41:38,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:38,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:38,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 10:41:38,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 10:41:38,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:38,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:38,471 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-17 10:41:38,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:38,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624597905] [2025-03-17 10:41:38,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624597905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:38,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:38,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:38,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717509167] [2025-03-17 10:41:38,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:38,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:38,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:38,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:38,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:38,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-17 10:41:38,490 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-17 10:41:38,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:38,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-17 10:41:38,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:38,547 INFO L124 PetriNetUnfolderBase]: 37/449 cut-off events. [2025-03-17 10:41:38,547 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 10:41:38,549 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 2195 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-17 10:41:38,550 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-03-17 10:41:38,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 364 flow [2025-03-17 10:41:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-17 10:41:38,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2025-03-17 10:41:38,552 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 336 flow. Second operand 3 states and 496 transitions. [2025-03-17 10:41:38,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 364 flow [2025-03-17 10:41:38,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:38,554 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 332 flow [2025-03-17 10:41:38,554 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-17 10:41:38,555 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -18 predicate places. [2025-03-17 10:41:38,555 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 332 flow [2025-03-17 10:41:38,555 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-17 10:41:38,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:38,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] [2025-03-17 10:41:38,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:41:38,556 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-17 10:41:38,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:38,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1900932870, now seen corresponding path program 1 times [2025-03-17 10:41:38,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:38,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047955532] [2025-03-17 10:41:38,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:38,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:38,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 10:41:38,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 10:41:38,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:38,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:38,599 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-17 10:41:38,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:38,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047955532] [2025-03-17 10:41:38,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047955532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:38,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:38,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:38,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004679479] [2025-03-17 10:41:38,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:38,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:38,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:38,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:38,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:38,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-17 10:41:38,629 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-17 10:41:38,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:38,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-17 10:41:38,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:38,682 INFO L124 PetriNetUnfolderBase]: 20/213 cut-off events. [2025-03-17 10:41:38,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:38,684 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 750 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-17 10:41:38,685 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2025-03-17 10:41:38,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 163 transitions, 366 flow [2025-03-17 10:41:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:38,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-17 10:41:38,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2025-03-17 10:41:38,687 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 332 flow. Second operand 3 states and 496 transitions. [2025-03-17 10:41:38,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 163 transitions, 366 flow [2025-03-17 10:41:38,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:38,689 INFO L231 Difference]: Finished difference. Result has 165 places, 161 transitions, 330 flow [2025-03-17 10:41:38,689 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-17 10:41:38,694 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -19 predicate places. [2025-03-17 10:41:38,694 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 161 transitions, 330 flow [2025-03-17 10:41:38,695 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-17 10:41:38,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:38,695 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-17 10:41:38,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:41:38,695 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-17 10:41:38,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:38,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1270167465, now seen corresponding path program 1 times [2025-03-17 10:41:38,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:38,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826100008] [2025-03-17 10:41:38,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:38,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:38,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 10:41:38,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 10:41:38,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:38,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:38,759 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-17 10:41:38,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:38,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826100008] [2025-03-17 10:41:38,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826100008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:38,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:38,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801404262] [2025-03-17 10:41:38,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:38,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:38,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:38,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:38,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:38,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2025-03-17 10:41:38,772 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-17 10:41:38,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:38,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2025-03-17 10:41:38,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:38,841 INFO L124 PetriNetUnfolderBase]: 33/412 cut-off events. [2025-03-17 10:41:38,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:38,843 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 1875 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-17 10:41:38,844 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 10 selfloop transitions, 3 changer transitions 0/161 dead transitions. [2025-03-17 10:41:38,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 356 flow [2025-03-17 10:41:38,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2025-03-17 10:41:38,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2025-03-17 10:41:38,846 INFO L175 Difference]: Start difference. First operand has 165 places, 161 transitions, 330 flow. Second operand 3 states and 498 transitions. [2025-03-17 10:41:38,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 356 flow [2025-03-17 10:41:38,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 161 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:38,849 INFO L231 Difference]: Finished difference. Result has 163 places, 159 transitions, 328 flow [2025-03-17 10:41:38,849 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-17 10:41:38,851 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2025-03-17 10:41:38,852 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 159 transitions, 328 flow [2025-03-17 10:41:38,852 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-17 10:41:38,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:38,852 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-17 10:41:38,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:41:38,853 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-17 10:41:38,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:38,854 INFO L85 PathProgramCache]: Analyzing trace with hash 860230473, now seen corresponding path program 1 times [2025-03-17 10:41:38,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:38,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937523216] [2025-03-17 10:41:38,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:38,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:38,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 10:41:38,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 10:41:38,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:38,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:38,898 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-17 10:41:38,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:38,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937523216] [2025-03-17 10:41:38,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937523216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:38,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:38,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:38,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212796838] [2025-03-17 10:41:38,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:38,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:38,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:38,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:38,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:38,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 188 [2025-03-17 10:41:38,919 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-17 10:41:38,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:38,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 188 [2025-03-17 10:41:38,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:38,967 INFO L124 PetriNetUnfolderBase]: 31/360 cut-off events. [2025-03-17 10:41:38,967 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:38,969 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 1478 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-17 10:41:38,971 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-03-17 10:41:38,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 354 flow [2025-03-17 10:41:38,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2025-03-17 10:41:38,973 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8829787234042553 [2025-03-17 10:41:38,973 INFO L175 Difference]: Start difference. First operand has 163 places, 159 transitions, 328 flow. Second operand 3 states and 498 transitions. [2025-03-17 10:41:38,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 354 flow [2025-03-17 10:41:38,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:38,975 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 322 flow [2025-03-17 10:41:38,976 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-17 10:41:38,978 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2025-03-17 10:41:38,978 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 322 flow [2025-03-17 10:41:38,979 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-17 10:41:38,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:38,979 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-17 10:41:38,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:41:38,979 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-17 10:41:38,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1554250090, now seen corresponding path program 1 times [2025-03-17 10:41:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:38,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522860987] [2025-03-17 10:41:38,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:38,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:38,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:41:38,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:41:38,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:39,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:41:39,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:39,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522860987] [2025-03-17 10:41:39,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522860987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:39,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:39,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:39,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144946174] [2025-03-17 10:41:39,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:39,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:39,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:39,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:39,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:39,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-17 10:41:39,058 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-17 10:41:39,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:39,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-17 10:41:39,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:39,090 INFO L124 PetriNetUnfolderBase]: 15/266 cut-off events. [2025-03-17 10:41:39,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:39,092 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 912 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-17 10:41:39,093 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 12 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-03-17 10:41:39,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 157 transitions, 350 flow [2025-03-17 10:41:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-17 10:41:39,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8776595744680851 [2025-03-17 10:41:39,095 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 322 flow. Second operand 3 states and 495 transitions. [2025-03-17 10:41:39,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 157 transitions, 350 flow [2025-03-17 10:41:39,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:39,097 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 320 flow [2025-03-17 10:41:39,097 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-17 10:41:39,099 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2025-03-17 10:41:39,099 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 320 flow [2025-03-17 10:41:39,100 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-17 10:41:39,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:39,100 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-17 10:41:39,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:41:39,100 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-17 10:41:39,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash 817086418, now seen corresponding path program 1 times [2025-03-17 10:41:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:39,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697020228] [2025-03-17 10:41:39,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:39,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 10:41:39,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 10:41:39,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:39,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:39,145 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-17 10:41:39,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:39,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697020228] [2025-03-17 10:41:39,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697020228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:39,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:39,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:39,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501481704] [2025-03-17 10:41:39,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:39,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:39,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:39,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:39,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:39,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-17 10:41:39,161 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-17 10:41:39,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:39,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-17 10:41:39,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:39,218 INFO L124 PetriNetUnfolderBase]: 41/436 cut-off events. [2025-03-17 10:41:39,218 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:39,220 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 2134 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-17 10:41:39,221 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-03-17 10:41:39,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 352 flow [2025-03-17 10:41:39,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-17 10:41:39,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8794326241134752 [2025-03-17 10:41:39,223 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 320 flow. Second operand 3 states and 496 transitions. [2025-03-17 10:41:39,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 352 flow [2025-03-17 10:41:39,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:39,225 INFO L231 Difference]: Finished difference. Result has 159 places, 155 transitions, 318 flow [2025-03-17 10:41:39,225 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-17 10:41:39,226 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2025-03-17 10:41:39,226 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 318 flow [2025-03-17 10:41:39,226 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-17 10:41:39,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:39,226 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-17 10:41:39,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:41:39,226 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-17 10:41:39,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:39,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1576223428, now seen corresponding path program 1 times [2025-03-17 10:41:39,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:39,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449285859] [2025-03-17 10:41:39,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:39,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:39,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 10:41:39,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 10:41:39,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:39,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:39,290 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-17 10:41:39,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:39,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449285859] [2025-03-17 10:41:39,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449285859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:39,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:39,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:41:39,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705052170] [2025-03-17 10:41:39,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:39,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:39,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:39,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:39,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:39,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2025-03-17 10:41:39,303 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-17 10:41:39,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:39,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2025-03-17 10:41:39,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:39,353 INFO L124 PetriNetUnfolderBase]: 25/550 cut-off events. [2025-03-17 10:41:39,354 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:39,356 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 2284 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-17 10:41:39,357 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2025-03-17 10:41:39,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 158 transitions, 350 flow [2025-03-17 10:41:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-03-17 10:41:39,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2025-03-17 10:41:39,359 INFO L175 Difference]: Start difference. First operand has 159 places, 155 transitions, 318 flow. Second operand 3 states and 506 transitions. [2025-03-17 10:41:39,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 158 transitions, 350 flow [2025-03-17 10:41:39,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 158 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:39,363 INFO L231 Difference]: Finished difference. Result has 160 places, 156 transitions, 326 flow [2025-03-17 10:41:39,363 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-17 10:41:39,364 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2025-03-17 10:41:39,364 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 326 flow [2025-03-17 10:41:39,365 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-17 10:41:39,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:39,365 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-17 10:41:39,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:41:39,365 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-17 10:41:39,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:39,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1207896234, now seen corresponding path program 1 times [2025-03-17 10:41:39,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:39,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516009413] [2025-03-17 10:41:39,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:39,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:39,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 10:41:39,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 10:41:39,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:39,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:39,404 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-17 10:41:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:39,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516009413] [2025-03-17 10:41:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516009413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:39,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:39,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292441578] [2025-03-17 10:41:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:39,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:39,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:39,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:39,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2025-03-17 10:41:39,421 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-17 10:41:39,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:39,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2025-03-17 10:41:39,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:39,474 INFO L124 PetriNetUnfolderBase]: 65/584 cut-off events. [2025-03-17 10:41:39,474 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 10:41:39,475 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 2914 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-17 10:41:39,476 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-03-17 10:41:39,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 360 flow [2025-03-17 10:41:39,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2025-03-17 10:41:39,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2025-03-17 10:41:39,478 INFO L175 Difference]: Start difference. First operand has 160 places, 156 transitions, 326 flow. Second operand 3 states and 494 transitions. [2025-03-17 10:41:39,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 360 flow [2025-03-17 10:41:39,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:41:39,480 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 326 flow [2025-03-17 10:41:39,481 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-17 10:41:39,482 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2025-03-17 10:41:39,482 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 326 flow [2025-03-17 10:41:39,482 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-17 10:41:39,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:39,482 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-17 10:41:39,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:41:39,483 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-17 10:41:39,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1200954334, now seen corresponding path program 1 times [2025-03-17 10:41:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:39,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445177706] [2025-03-17 10:41:39,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:39,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 10:41:39,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 10:41:39,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:39,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:39,514 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-17 10:41:39,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:39,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445177706] [2025-03-17 10:41:39,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445177706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:39,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:39,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:39,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735342678] [2025-03-17 10:41:39,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:39,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:39,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:39,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:39,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:39,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2025-03-17 10:41:39,523 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-17 10:41:39,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:39,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2025-03-17 10:41:39,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:39,580 INFO L124 PetriNetUnfolderBase]: 49/554 cut-off events. [2025-03-17 10:41:39,580 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:39,582 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 2409 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-17 10:41:39,584 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 10 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-03-17 10:41:39,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 354 flow [2025-03-17 10:41:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2025-03-17 10:41:39,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8953900709219859 [2025-03-17 10:41:39,586 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 326 flow. Second operand 3 states and 505 transitions. [2025-03-17 10:41:39,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 354 flow [2025-03-17 10:41:39,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:39,589 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 330 flow [2025-03-17 10:41:39,590 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-17 10:41:39,590 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2025-03-17 10:41:39,591 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 330 flow [2025-03-17 10:41:39,591 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-17 10:41:39,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:39,591 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-17 10:41:39,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:41:39,591 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-17 10:41:39,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash -28554637, now seen corresponding path program 1 times [2025-03-17 10:41:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:39,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192370220] [2025-03-17 10:41:39,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:39,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:39,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 10:41:39,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 10:41:39,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:39,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:39,626 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-17 10:41:39,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:39,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192370220] [2025-03-17 10:41:39,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192370220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:39,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:39,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:39,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473019690] [2025-03-17 10:41:39,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:39,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:39,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:39,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:39,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:39,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2025-03-17 10:41:39,645 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-17 10:41:39,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:39,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2025-03-17 10:41:39,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:39,697 INFO L124 PetriNetUnfolderBase]: 69/572 cut-off events. [2025-03-17 10:41:39,697 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-17 10:41:39,699 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 2877 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-17 10:41:39,701 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 14 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2025-03-17 10:41:39,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 156 transitions, 364 flow [2025-03-17 10:41:39,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2025-03-17 10:41:39,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875886524822695 [2025-03-17 10:41:39,702 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 330 flow. Second operand 3 states and 494 transitions. [2025-03-17 10:41:39,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 156 transitions, 364 flow [2025-03-17 10:41:39,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:41:39,705 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 330 flow [2025-03-17 10:41:39,705 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-17 10:41:39,706 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2025-03-17 10:41:39,706 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 330 flow [2025-03-17 10:41:39,707 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-17 10:41:39,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:39,707 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-17 10:41:39,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:41:39,707 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-17 10:41:39,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash -105678029, now seen corresponding path program 1 times [2025-03-17 10:41:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:39,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153914877] [2025-03-17 10:41:39,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:39,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 10:41:39,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 10:41:39,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:39,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:39,738 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-17 10:41:39,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:39,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153914877] [2025-03-17 10:41:39,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153914877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:39,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:41:39,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:41:39,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059826561] [2025-03-17 10:41:39,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:39,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:39,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:39,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:39,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:41:39,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 188 [2025-03-17 10:41:39,758 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-17 10:41:39,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:39,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 188 [2025-03-17 10:41:39,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:39,807 INFO L124 PetriNetUnfolderBase]: 57/556 cut-off events. [2025-03-17 10:41:39,807 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:39,808 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 2564 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-17 10:41:39,809 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 15 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2025-03-17 10:41:39,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 366 flow [2025-03-17 10:41:39,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2025-03-17 10:41:39,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2025-03-17 10:41:39,811 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 330 flow. Second operand 3 states and 492 transitions. [2025-03-17 10:41:39,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 366 flow [2025-03-17 10:41:39,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:39,813 INFO L231 Difference]: Finished difference. Result has 159 places, 153 transitions, 328 flow [2025-03-17 10:41:39,813 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-17 10:41:39,814 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2025-03-17 10:41:39,814 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 153 transitions, 328 flow [2025-03-17 10:41:39,814 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-17 10:41:39,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:39,815 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-17 10:41:39,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:41:39,815 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-17 10:41:39,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:39,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1776737646, now seen corresponding path program 1 times [2025-03-17 10:41:39,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:39,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677399667] [2025-03-17 10:41:39,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:39,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:39,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 10:41:39,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 10:41:39,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:39,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:39,918 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-17 10:41:39,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:39,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677399667] [2025-03-17 10:41:39,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677399667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:41:39,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264614345] [2025-03-17 10:41:39,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:39,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:41:39,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:41:39,921 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-17 10:41:39,926 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-17 10:41:39,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 10:41:39,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 10:41:39,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:39,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:39,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:41:40,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:41:40,018 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-17 10:41:40,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:41:40,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264614345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:40,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:41:40,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-17 10:41:40,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317645201] [2025-03-17 10:41:40,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:40,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:40,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:40,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:41:40,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2025-03-17 10:41:40,022 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-17 10:41:40,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:40,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2025-03-17 10:41:40,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:40,082 INFO L124 PetriNetUnfolderBase]: 36/485 cut-off events. [2025-03-17 10:41:40,082 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:41:40,084 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 1794 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-17 10:41:40,085 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 9 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2025-03-17 10:41:40,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 157 transitions, 362 flow [2025-03-17 10:41:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2025-03-17 10:41:40,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9024822695035462 [2025-03-17 10:41:40,087 INFO L175 Difference]: Start difference. First operand has 159 places, 153 transitions, 328 flow. Second operand 3 states and 509 transitions. [2025-03-17 10:41:40,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 157 transitions, 362 flow [2025-03-17 10:41:40,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 157 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:40,090 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 358 flow [2025-03-17 10:41:40,091 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-17 10:41:40,091 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2025-03-17 10:41:40,091 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 358 flow [2025-03-17 10:41:40,091 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-17 10:41:40,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:40,092 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-17 10:41:40,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 10:41:40,298 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-17 10:41:40,298 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-17 10:41:40,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash 936248413, now seen corresponding path program 1 times [2025-03-17 10:41:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234140726] [2025-03-17 10:41:40,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:40,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 10:41:40,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 10:41:40,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:40,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:40,381 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-17 10:41:40,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:40,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234140726] [2025-03-17 10:41:40,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234140726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:41:40,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924002865] [2025-03-17 10:41:40,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:40,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:41:40,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:41:40,384 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-17 10:41:40,385 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-17 10:41:40,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 10:41:40,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 10:41:40,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:40,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:40,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:41:40,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:41:40,480 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-17 10:41:40,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:41:40,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924002865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:41:40,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:41:40,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-17 10:41:40,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666019658] [2025-03-17 10:41:40,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:41:40,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:41:40,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:40,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:41:40,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:41:40,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 188 [2025-03-17 10:41:40,484 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-17 10:41:40,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:40,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 188 [2025-03-17 10:41:40,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:40,547 INFO L124 PetriNetUnfolderBase]: 78/601 cut-off events. [2025-03-17 10:41:40,547 INFO L125 PetriNetUnfolderBase]: For 138/151 co-relation queries the response was YES. [2025-03-17 10:41:40,549 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 2757 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-17 10:41:40,552 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 12 selfloop transitions, 6 changer transitions 0/164 dead transitions. [2025-03-17 10:41:40,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 164 transitions, 422 flow [2025-03-17 10:41:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:41:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:41:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2025-03-17 10:41:40,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9042553191489362 [2025-03-17 10:41:40,553 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 358 flow. Second operand 3 states and 510 transitions. [2025-03-17 10:41:40,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 164 transitions, 422 flow [2025-03-17 10:41:40,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 164 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:40,556 INFO L231 Difference]: Finished difference. Result has 163 places, 163 transitions, 408 flow [2025-03-17 10:41:40,556 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-17 10:41:40,556 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -21 predicate places. [2025-03-17 10:41:40,556 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 163 transitions, 408 flow [2025-03-17 10:41:40,557 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-17 10:41:40,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:40,557 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-17 10:41:40,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 10:41:40,757 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-17 10:41:40,758 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-17 10:41:40,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:40,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1752209214, now seen corresponding path program 1 times [2025-03-17 10:41:40,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:40,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460733905] [2025-03-17 10:41:40,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:40,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:40,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 10:41:40,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 10:41:40,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:40,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:40,841 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-17 10:41:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:40,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460733905] [2025-03-17 10:41:40,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460733905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:41:40,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057346287] [2025-03-17 10:41:40,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:41:40,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:41:40,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:41:40,847 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-17 10:41:40,848 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-17 10:41:40,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 10:41:40,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 10:41:40,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:40,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:40,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 10:41:40,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:41:40,997 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-17 10:41:41,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:41:41,071 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-17 10:41:41,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057346287] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:41:41,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:41:41,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 10:41:41,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958892803] [2025-03-17 10:41:41,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:41:41,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:41:41,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:41,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:41:41,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:41:41,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2025-03-17 10:41:41,087 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-17 10:41:41,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:41,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2025-03-17 10:41:41,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:41,265 INFO L124 PetriNetUnfolderBase]: 242/1310 cut-off events. [2025-03-17 10:41:41,265 INFO L125 PetriNetUnfolderBase]: For 1036/1068 co-relation queries the response was YES. [2025-03-17 10:41:41,271 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 6555 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-17 10:41:41,278 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 63 selfloop transitions, 9 changer transitions 0/213 dead transitions. [2025-03-17 10:41:41,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 213 transitions, 864 flow [2025-03-17 10:41:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:41:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 10:41:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2025-03-17 10:41:41,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8693853427895981 [2025-03-17 10:41:41,282 INFO L175 Difference]: Start difference. First operand has 163 places, 163 transitions, 408 flow. Second operand 9 states and 1471 transitions. [2025-03-17 10:41:41,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 213 transitions, 864 flow [2025-03-17 10:41:41,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 213 transitions, 810 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:41:41,286 INFO L231 Difference]: Finished difference. Result has 172 places, 169 transitions, 446 flow [2025-03-17 10:41:41,286 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-17 10:41:41,286 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, -12 predicate places. [2025-03-17 10:41:41,286 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 446 flow [2025-03-17 10:41:41,287 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-17 10:41:41,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:41,287 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-17 10:41:41,293 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-17 10:41:41,487 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-17 10:41:41,488 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-17 10:41:41,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:41,488 INFO L85 PathProgramCache]: Analyzing trace with hash -78651902, now seen corresponding path program 2 times [2025-03-17 10:41:41,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:41,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922309866] [2025-03-17 10:41:41,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:41:41,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:41,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-03-17 10:41:41,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 10:41:41,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:41:41,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:41,673 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-17 10:41:41,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:41,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922309866] [2025-03-17 10:41:41,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922309866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:41:41,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795100328] [2025-03-17 10:41:41,674 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:41:41,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:41:41,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:41:41,679 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-17 10:41:41,682 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-17 10:41:41,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 170 statements into 2 equivalence classes. [2025-03-17 10:41:41,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-03-17 10:41:41,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:41:41,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:41,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 10:41:41,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:41:41,939 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-17 10:41:41,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:41:42,132 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-17 10:41:42,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795100328] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:41:42,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:41:42,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-17 10:41:42,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233791620] [2025-03-17 10:41:42,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:41:42,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 10:41:42,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:42,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 10:41:42,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 10:41:42,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2025-03-17 10:41:42,157 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-17 10:41:42,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:42,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2025-03-17 10:41:42,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:42,638 INFO L124 PetriNetUnfolderBase]: 402/2170 cut-off events. [2025-03-17 10:41:42,639 INFO L125 PetriNetUnfolderBase]: For 1539/1571 co-relation queries the response was YES. [2025-03-17 10:41:42,646 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 10482 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-17 10:41:42,655 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 139 selfloop transitions, 21 changer transitions 0/301 dead transitions. [2025-03-17 10:41:42,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 301 transitions, 1546 flow [2025-03-17 10:41:42,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 10:41:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 10:41:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3421 transitions. [2025-03-17 10:41:42,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8665146909827761 [2025-03-17 10:41:42,661 INFO L175 Difference]: Start difference. First operand has 172 places, 169 transitions, 446 flow. Second operand 21 states and 3421 transitions. [2025-03-17 10:41:42,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 301 transitions, 1546 flow [2025-03-17 10:41:42,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 301 transitions, 1532 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 10:41:42,666 INFO L231 Difference]: Finished difference. Result has 196 places, 182 transitions, 570 flow [2025-03-17 10:41:42,666 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-17 10:41:42,667 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 12 predicate places. [2025-03-17 10:41:42,667 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 182 transitions, 570 flow [2025-03-17 10:41:42,668 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-17 10:41:42,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:42,668 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-17 10:41:42,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 10:41:42,868 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-17 10:41:42,869 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-17 10:41:42,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:42,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1117219720, now seen corresponding path program 3 times [2025-03-17 10:41:42,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:42,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72814004] [2025-03-17 10:41:42,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:41:42,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:42,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 310 statements into 8 equivalence classes. [2025-03-17 10:41:42,923 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 310 of 310 statements. [2025-03-17 10:41:42,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 10:41:42,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:43,487 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-17 10:41:43,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:43,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72814004] [2025-03-17 10:41:43,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72814004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:41:43,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117959550] [2025-03-17 10:41:43,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 10:41:43,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:41:43,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:41:43,491 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-17 10:41:43,493 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-17 10:41:43,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 310 statements into 8 equivalence classes. [2025-03-17 10:41:43,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 310 of 310 statements. [2025-03-17 10:41:43,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-17 10:41:43,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:43,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 10:41:43,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:41:43,881 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-17 10:41:43,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:41:44,323 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-17 10:41:44,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117959550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:41:44,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:41:44,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-17 10:41:44,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123215907] [2025-03-17 10:41:44,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:41:44,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 10:41:44,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:44,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 10:41:44,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 10:41:44,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2025-03-17 10:41:44,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 182 transitions, 570 flow. Second operand has 34 states, 34 states have (on average 161.11764705882354) internal successors, (5478), 34 states have internal predecessors, (5478), 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-17 10:41:44,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:44,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2025-03-17 10:41:44,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:45,588 INFO L124 PetriNetUnfolderBase]: 722/3890 cut-off events. [2025-03-17 10:41:45,589 INFO L125 PetriNetUnfolderBase]: For 4577/4609 co-relation queries the response was YES. [2025-03-17 10:41:45,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7472 conditions, 3890 events. 722/3890 cut-off events. For 4577/4609 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 18414 event pairs, 13 based on Foata normal form. 46/3875 useless extension candidates. Maximal degree in co-relation 7457. Up to 378 conditions per place. [2025-03-17 10:41:45,623 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 291 selfloop transitions, 45 changer transitions 0/477 dead transitions. [2025-03-17 10:41:45,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 477 transitions, 3078 flow [2025-03-17 10:41:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-17 10:41:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-17 10:41:45,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7321 transitions. [2025-03-17 10:41:45,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8653664302600473 [2025-03-17 10:41:45,663 INFO L175 Difference]: Start difference. First operand has 196 places, 182 transitions, 570 flow. Second operand 45 states and 7321 transitions. [2025-03-17 10:41:45,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 477 transitions, 3078 flow [2025-03-17 10:41:45,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 477 transitions, 3038 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-03-17 10:41:45,675 INFO L231 Difference]: Finished difference. Result has 243 places, 207 transitions, 848 flow [2025-03-17 10:41:45,676 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=45, PETRI_FLOW=848, PETRI_PLACES=243, PETRI_TRANSITIONS=207} [2025-03-17 10:41:45,676 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 59 predicate places. [2025-03-17 10:41:45,676 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 207 transitions, 848 flow [2025-03-17 10:41:45,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 161.11764705882354) internal successors, (5478), 34 states have internal predecessors, (5478), 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-17 10:41:45,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:45,680 INFO L206 CegarLoopForPetriNet]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:41:45,688 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-17 10:41:45,880 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-17 10:41:45,881 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-17 10:41:45,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash 830270850, now seen corresponding path program 4 times [2025-03-17 10:41:45,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:45,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261675203] [2025-03-17 10:41:45,884 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 10:41:45,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:45,900 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 590 statements into 2 equivalence classes. [2025-03-17 10:41:45,937 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 10:41:45,937 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 10:41:45,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:41:47,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:41:47,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261675203] [2025-03-17 10:41:47,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261675203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:41:47,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724942706] [2025-03-17 10:41:47,305 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 10:41:47,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:41:47,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:41:47,307 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:41:47,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 10:41:47,374 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 590 statements into 2 equivalence classes. [2025-03-17 10:41:47,459 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 590 of 590 statements. [2025-03-17 10:41:47,459 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 10:41:47,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:41:47,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 10:41:47,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:41:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:41:48,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:41:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3720 backedges. 0 proven. 3720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:41:49,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724942706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:41:49,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:41:49,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2025-03-17 10:41:49,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219032799] [2025-03-17 10:41:49,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:41:49,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-17 10:41:49,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:41:49,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-17 10:41:49,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2025-03-17 10:41:49,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 188 [2025-03-17 10:41:49,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 207 transitions, 848 flow. Second operand has 51 states, 51 states have (on average 161.11764705882354) internal successors, (8217), 51 states have internal predecessors, (8217), 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-17 10:41:49,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:41:49,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 188 [2025-03-17 10:41:49,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:41:51,392 INFO L124 PetriNetUnfolderBase]: 1082/5825 cut-off events. [2025-03-17 10:41:51,392 INFO L125 PetriNetUnfolderBase]: For 12456/12488 co-relation queries the response was YES. [2025-03-17 10:41:51,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11792 conditions, 5825 events. 1082/5825 cut-off events. For 12456/12488 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 27382 event pairs, 13 based on Foata normal form. 51/5815 useless extension candidates. Maximal degree in co-relation 11768. Up to 558 conditions per place. [2025-03-17 10:41:51,432 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 462 selfloop transitions, 72 changer transitions 0/675 dead transitions. [2025-03-17 10:41:51,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 675 transitions, 4930 flow [2025-03-17 10:41:51,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-17 10:41:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2025-03-17 10:41:51,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 11705 transitions. [2025-03-17 10:41:51,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8647310874704491 [2025-03-17 10:41:51,443 INFO L175 Difference]: Start difference. First operand has 243 places, 207 transitions, 848 flow. Second operand 72 states and 11705 transitions. [2025-03-17 10:41:51,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 675 transitions, 4930 flow [2025-03-17 10:41:51,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 675 transitions, 4856 flow, removed 19 selfloop flow, removed 18 redundant places. [2025-03-17 10:41:51,461 INFO L231 Difference]: Finished difference. Result has 306 places, 235 transitions, 1230 flow [2025-03-17 10:41:51,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=1230, PETRI_PLACES=306, PETRI_TRANSITIONS=235} [2025-03-17 10:41:51,462 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 122 predicate places. [2025-03-17 10:41:51,462 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 235 transitions, 1230 flow [2025-03-17 10:41:51,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 161.11764705882354) internal successors, (8217), 51 states have internal predecessors, (8217), 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-17 10:41:51,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:41:51,465 INFO L206 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 10:41:51,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 10:41:51,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:41:51,666 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-03-17 10:41:51,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:41:51,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1838445282, now seen corresponding path program 5 times [2025-03-17 10:41:51,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:41:51,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790680605] [2025-03-17 10:41:51,669 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 10:41:51,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:41:51,688 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 905 statements into 25 equivalence classes. [2025-03-17 10:41:51,727 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) and asserted 905 of 905 statements. [2025-03-17 10:41:51,727 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2025-03-17 10:41:51,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:41:51,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:41:51,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 905 statements into 1 equivalence classes. [2025-03-17 10:41:51,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 905 of 905 statements. [2025-03-17 10:41:51,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:41:51,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:41:52,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:41:52,092 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:41:52,092 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2025-03-17 10:41:52,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-03-17 10:41:52,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-03-17 10:41:52,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-03-17 10:41:52,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-03-17 10:41:52,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-03-17 10:41:52,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-03-17 10:41:52,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-03-17 10:41:52,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-03-17 10:41:52,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-03-17 10:41:52,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-03-17 10:41:52,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-03-17 10:41:52,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-03-17 10:41:52,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-03-17 10:41:52,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-03-17 10:41:52,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-03-17 10:41:52,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-03-17 10:41:52,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-03-17 10:41:52,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-03-17 10:41:52,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-03-17 10:41:52,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-03-17 10:41:52,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-03-17 10:41:52,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-03-17 10:41:52,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-03-17 10:41:52,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-03-17 10:41:52,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-03-17 10:41:52,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-03-17 10:41:52,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-03-17 10:41:52,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-03-17 10:41:52,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-03-17 10:41:52,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-03-17 10:41:52,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-03-17 10:41:52,097 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-03-17 10:41:52,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 10:41:52,098 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:41:52,465 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 10:41:52,466 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 10:41:52,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 10:41:52 BasicIcfg [2025-03-17 10:41:52,471 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 10:41:52,472 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 10:41:52,472 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 10:41:52,472 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 10:41:52,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:41:37" (3/4) ... [2025-03-17 10:41:52,474 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 10:41:52,690 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 55. [2025-03-17 10:41:52,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 10:41:52,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 10:41:52,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 10:41:52,755 INFO L158 Benchmark]: Toolchain (without parser) took 16471.81ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 113.7MB in the beginning and 177.6MB in the end (delta: -63.8MB). Peak memory consumption was 342.1MB. Max. memory is 16.1GB. [2025-03-17 10:41:52,755 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:41:52,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.05ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 93.8MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 10:41:52,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.85ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 10:41:52,756 INFO L158 Benchmark]: Boogie Preprocessor took 18.69ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.4MB in the end (delta: 968.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 10:41:52,756 INFO L158 Benchmark]: IcfgBuilder took 439.93ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 68.7MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 10:41:52,758 INFO L158 Benchmark]: TraceAbstraction took 15310.03ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 68.2MB in the beginning and 345.3MB in the end (delta: -277.2MB). Peak memory consumption was 417.6MB. Max. memory is 16.1GB. [2025-03-17 10:41:52,758 INFO L158 Benchmark]: Witness Printer took 282.47ms. Allocated memory is still 553.6MB. Free memory was 345.3MB in the beginning and 177.6MB in the end (delta: 167.8MB). Peak memory consumption was 167.8MB. Max. memory is 16.1GB. [2025-03-17 10:41:52,759 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.43ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.05ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 93.8MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.85ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.69ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.4MB in the end (delta: 968.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 439.93ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 68.7MB in the end (delta: 22.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15310.03ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 68.2MB in the beginning and 345.3MB in the end (delta: -277.2MB). Peak memory consumption was 417.6MB. Max. memory is 16.1GB. * Witness Printer took 282.47ms. Allocated memory is still 553.6MB. Free memory was 345.3MB in the beginning and 177.6MB in the end (delta: 167.8MB). Peak memory consumption was 167.8MB. 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)=75108, \old(argv)={75058:75083}, argc=75108, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L716] 0 i = 1 VAL [\old(argc)=75108, \old(argv)={75058:75083}, argc=75108, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L719] 0 j = 1 VAL [\old(argc)=75108, \old(argv)={75058:75083}, argc=75108, 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)=75108, \old(argv)={75058:75083}, argc=75108, cur=1, i=1, id1=-1, j=1, next=0, p=0, prev=0, q=0, x=0] [L688] 1 p = 0 VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L688] COND TRUE 1 p < 11 [L688] 1 p < 11 VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L688] COND TRUE 1 p < 11 VAL [\old(arg)={0:0}, arg={0:0}, cur=1, i=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)=75108, \old(argv)={75058:75083}, arg={0:0}, argc=75108, 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}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, 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}, 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}, 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}, 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}, 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}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 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] [L706] COND TRUE 0 x < 24 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] [L707] EXPR 0 prev + cur 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] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=377, q=0, x=14] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=610, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=14] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=987, p=0, prev=610, q=0, x=15] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=610, q=0, x=15] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=987, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=15] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=987, q=0, x=16] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=1597, q=0, x=17] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=2584, q=0, x=18] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=4181, q=0, x=19] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=6765, q=0, x=20] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=10946, q=0, x=21] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=46368, p=0, prev=17711, q=0, x=22] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=22] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=22] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] COND TRUE 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L707] EXPR 0 prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L707] 0 next = prev + cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=75025, p=0, prev=28657, q=0, x=23] [L708] 0 prev = cur VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=23] [L709] 0 cur = next VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=23] [L706] 0 x++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] COND TRUE 0 x < 24 [L706] 0 x < 24 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] COND FALSE 0 !(x < 24) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L711] 0 return prev; VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result=46368, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=75108, \old(argv)={75058:75083}, arg={0:0}, argc=75108, correct=46368, cur=75025, i=1, id1=-1, id2=0, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L725] 0 i <= correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=75108, \old(argv)={75058:75083}, arg={0:0}, argc=75108, correct=46368, cur=75025, i=1, id1=-1, id2=0, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L690] EXPR 1 i + j [L690] 1 i = i + j VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, cur=75025, i=2, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L725] 0 i <= correct VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=75108, \old(argv)={75058:75083}, arg={0:0}, argc=75108, correct=46368, cur=75025, i=2, id1=-1, id2=0, j=1, next=75025, p=0, prev=46368, q=0, x=24] 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, 250 edges, 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: 14.8s, OverallIterations: 24, TraceHistogramMax: 25, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1459 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1250 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1217 IncrementalHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 89 mSDtfsCounter, 1217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2712 GetRequests, 2478 SyntacticMatches, 15 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3489 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1230occurred in iteration=23, InterpolantAutomatonStates: 203, 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.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 4429 NumberOfCodeBlocks, 4429 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 4661 ConstructedInterpolants, 0 QuantifiedInterpolants, 10505 SizeOfPredicates, 52 NumberOfNonLiveVariables, 2472 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 33 InterpolantComputations, 19 PerfectInterpolantSequences, 6/13791 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-17 10:41:52,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)