./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.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-race-challenges/per-thread-array-init.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 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:16:33,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:16:33,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:16:33,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:16:33,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:16:33,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:16:33,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:16:33,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:16:33,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:16:33,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:16:33,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:16:33,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:16:33,679 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:16:33,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:16:33,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:16:33,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:16:33,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:16:33,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:16:33,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:16:33,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:16:33,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:16:33,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:16:33,679 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:16:33,679 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:16:33,679 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:16:33,680 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:16:33,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:16:33,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:16:33,681 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 -> 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e [2025-03-17 11:16:33,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:16:33,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:16:33,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:16:33,915 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:16:33,915 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:16:33,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2025-03-17 11:16:35,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8ffa8f6/bdd9a99fc2aa4f32a5fc48d677a89424/FLAG4c4cc7198 [2025-03-17 11:16:35,332 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:16:35,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2025-03-17 11:16:35,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8ffa8f6/bdd9a99fc2aa4f32a5fc48d677a89424/FLAG4c4cc7198 [2025-03-17 11:16:35,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8ffa8f6/bdd9a99fc2aa4f32a5fc48d677a89424 [2025-03-17 11:16:35,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:16:35,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:16:35,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:16:35,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:16:35,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:16:35,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:16:35" (1/1) ... [2025-03-17 11:16:35,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2dd7a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35, skipping insertion in model container [2025-03-17 11:16:35,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:16:35" (1/1) ... [2025-03-17 11:16:35,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:16:35,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:16:35,901 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:16:35,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:16:35,984 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:16:35,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35 WrapperNode [2025-03-17 11:16:35,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:16:35,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:16:35,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:16:35,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:16:35,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35" (1/1) ... [2025-03-17 11:16:36,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35" (1/1) ... [2025-03-17 11:16:36,015 INFO L138 Inliner]: procedures = 261, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-03-17 11:16:36,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:16:36,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:16:36,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:16:36,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:16:36,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35" (1/1) ... [2025-03-17 11:16:36,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35" (1/1) ... [2025-03-17 11:16:36,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35" (1/1) ... [2025-03-17 11:16:36,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35" (1/1) ... [2025-03-17 11:16:36,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35" (1/1) ... [2025-03-17 11:16:36,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35" (1/1) ... [2025-03-17 11:16:36,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35" (1/1) ... [2025-03-17 11:16:36,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35" (1/1) ... [2025-03-17 11:16:36,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:16:36,038 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:16:36,038 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:16:36,038 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:16:36,039 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35" (1/1) ... [2025-03-17 11:16:36,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:16:36,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:16:36,065 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 11:16:36,068 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 11:16:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:16:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:16:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:16:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:16:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-03-17 11:16:36,086 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-03-17 11:16:36,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:16:36,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:16:36,087 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 11:16:36,192 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:16:36,193 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:16:36,398 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:16:36,398 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:16:36,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:16:36,409 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:16:36,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:16:36 BoogieIcfgContainer [2025-03-17 11:16:36,410 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:16:36,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:16:36,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:16:36,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:16:36,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:16:35" (1/3) ... [2025-03-17 11:16:36,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1998c327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:16:36, skipping insertion in model container [2025-03-17 11:16:36,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:16:35" (2/3) ... [2025-03-17 11:16:36,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1998c327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:16:36, skipping insertion in model container [2025-03-17 11:16:36,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:16:36" (3/3) ... [2025-03-17 11:16:36,417 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2025-03-17 11:16:36,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:16:36,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-init.i that has 2 procedures, 86 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-17 11:16:36,429 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:16:36,481 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:16:36,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 88 transitions, 183 flow [2025-03-17 11:16:36,557 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2025-03-17 11:16:36,559 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:16:36,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 2/127 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 188 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 62. Up to 3 conditions per place. [2025-03-17 11:16:36,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 88 transitions, 183 flow [2025-03-17 11:16:36,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 88 transitions, 183 flow [2025-03-17 11:16:36,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:16:36,584 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;@10b69c53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:16:36,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 11:16:36,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:16:36,597 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-03-17 11:16:36,597 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:16:36,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:36,598 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] [2025-03-17 11:16:36,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:16:36,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:36,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1844761379, now seen corresponding path program 1 times [2025-03-17 11:16:36,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:36,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699185548] [2025-03-17 11:16:36,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:36,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:36,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:16:36,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:16:36,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:36,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:37,273 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 11:16:37,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:37,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699185548] [2025-03-17 11:16:37,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699185548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:37,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:37,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:16:37,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477666613] [2025-03-17 11:16:37,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:37,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:16:37,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:37,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:16:37,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:16:37,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 88 [2025-03-17 11:16:37,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 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 11:16:37,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:37,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 88 [2025-03-17 11:16:37,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:37,681 INFO L124 PetriNetUnfolderBase]: 91/418 cut-off events. [2025-03-17 11:16:37,681 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 11:16:37,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 418 events. 91/418 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2020 event pairs, 52 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 559. Up to 197 conditions per place. [2025-03-17 11:16:37,684 INFO L140 encePairwiseOnDemand]: 76/88 looper letters, 27 selfloop transitions, 22 changer transitions 1/108 dead transitions. [2025-03-17 11:16:37,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 108 transitions, 321 flow [2025-03-17 11:16:37,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:16:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:16:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 405 transitions. [2025-03-17 11:16:37,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7670454545454546 [2025-03-17 11:16:37,700 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 183 flow. Second operand 6 states and 405 transitions. [2025-03-17 11:16:37,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 108 transitions, 321 flow [2025-03-17 11:16:37,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 108 transitions, 321 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:16:37,709 INFO L231 Difference]: Finished difference. Result has 99 places, 107 transitions, 329 flow [2025-03-17 11:16:37,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=99, PETRI_TRANSITIONS=107} [2025-03-17 11:16:37,715 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 10 predicate places. [2025-03-17 11:16:37,716 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 107 transitions, 329 flow [2025-03-17 11:16:37,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 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 11:16:37,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:37,716 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] [2025-03-17 11:16:37,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:16:37,717 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:16:37,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:37,718 INFO L85 PathProgramCache]: Analyzing trace with hash 758834377, now seen corresponding path program 1 times [2025-03-17 11:16:37,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:37,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916273188] [2025-03-17 11:16:37,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:37,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:37,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:16:37,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:16:37,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:37,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:37,796 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 11:16:37,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:37,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916273188] [2025-03-17 11:16:37,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916273188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:37,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:37,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:16:37,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316684367] [2025-03-17 11:16:37,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:37,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:16:37,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:37,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:16:37,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:16:37,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 88 [2025-03-17 11:16:37,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 107 transitions, 329 flow. Second operand has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 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 11:16:37,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:37,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 88 [2025-03-17 11:16:37,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:37,926 INFO L124 PetriNetUnfolderBase]: 40/253 cut-off events. [2025-03-17 11:16:37,927 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-17 11:16:37,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 253 events. 40/253 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 834 event pairs, 4 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 333. Up to 50 conditions per place. [2025-03-17 11:16:37,928 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 11 selfloop transitions, 2 changer transitions 5/112 dead transitions. [2025-03-17 11:16:37,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 112 transitions, 375 flow [2025-03-17 11:16:37,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:16:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:16:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 463 transitions. [2025-03-17 11:16:37,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8768939393939394 [2025-03-17 11:16:37,932 INFO L175 Difference]: Start difference. First operand has 99 places, 107 transitions, 329 flow. Second operand 6 states and 463 transitions. [2025-03-17 11:16:37,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 112 transitions, 375 flow [2025-03-17 11:16:37,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 112 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:16:37,937 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 347 flow [2025-03-17 11:16:37,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2025-03-17 11:16:37,938 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 18 predicate places. [2025-03-17 11:16:37,938 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 347 flow [2025-03-17 11:16:37,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 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 11:16:37,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:37,939 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] [2025-03-17 11:16:37,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:16:37,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:16:37,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:37,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1487311313, now seen corresponding path program 1 times [2025-03-17 11:16:37,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:37,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694559703] [2025-03-17 11:16:37,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:37,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:37,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:16:37,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:16:37,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:37,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:38,293 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 11:16:38,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:38,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694559703] [2025-03-17 11:16:38,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694559703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:38,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:38,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:16:38,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276312209] [2025-03-17 11:16:38,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:38,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:16:38,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:38,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:16:38,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:16:38,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 88 [2025-03-17 11:16:38,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 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 11:16:38,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:38,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 88 [2025-03-17 11:16:38,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:38,492 INFO L124 PetriNetUnfolderBase]: 109/469 cut-off events. [2025-03-17 11:16:38,492 INFO L125 PetriNetUnfolderBase]: For 102/105 co-relation queries the response was YES. [2025-03-17 11:16:38,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 469 events. 109/469 cut-off events. For 102/105 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2292 event pairs, 36 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 886. Up to 225 conditions per place. [2025-03-17 11:16:38,498 INFO L140 encePairwiseOnDemand]: 77/88 looper letters, 46 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2025-03-17 11:16:38,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 128 transitions, 557 flow [2025-03-17 11:16:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:16:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:16:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 404 transitions. [2025-03-17 11:16:38,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7651515151515151 [2025-03-17 11:16:38,500 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 347 flow. Second operand 6 states and 404 transitions. [2025-03-17 11:16:38,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 128 transitions, 557 flow [2025-03-17 11:16:38,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 128 transitions, 543 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-17 11:16:38,505 INFO L231 Difference]: Finished difference. Result has 109 places, 128 transitions, 515 flow [2025-03-17 11:16:38,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=109, PETRI_TRANSITIONS=128} [2025-03-17 11:16:38,506 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 20 predicate places. [2025-03-17 11:16:38,506 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 128 transitions, 515 flow [2025-03-17 11:16:38,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.166666666666664) internal successors, (367), 6 states have internal predecessors, (367), 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 11:16:38,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:38,507 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] [2025-03-17 11:16:38,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:16:38,507 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:16:38,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash -575932077, now seen corresponding path program 1 times [2025-03-17 11:16:38,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:38,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591747457] [2025-03-17 11:16:38,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:38,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:38,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 11:16:38,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 11:16:38,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:38,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:38,770 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 11:16:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:38,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591747457] [2025-03-17 11:16:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591747457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:38,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:38,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:16:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956898907] [2025-03-17 11:16:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:38,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:16:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:38,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:16:38,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:16:38,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 88 [2025-03-17 11:16:38,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 128 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 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 11:16:38,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:38,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 88 [2025-03-17 11:16:38,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:39,032 INFO L124 PetriNetUnfolderBase]: 140/585 cut-off events. [2025-03-17 11:16:39,033 INFO L125 PetriNetUnfolderBase]: For 346/371 co-relation queries the response was YES. [2025-03-17 11:16:39,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 585 events. 140/585 cut-off events. For 346/371 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3057 event pairs, 14 based on Foata normal form. 4/562 useless extension candidates. Maximal degree in co-relation 1382. Up to 232 conditions per place. [2025-03-17 11:16:39,037 INFO L140 encePairwiseOnDemand]: 74/88 looper letters, 46 selfloop transitions, 57 changer transitions 8/176 dead transitions. [2025-03-17 11:16:39,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 176 transitions, 963 flow [2025-03-17 11:16:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:16:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:16:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 474 transitions. [2025-03-17 11:16:39,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8977272727272727 [2025-03-17 11:16:39,039 INFO L175 Difference]: Start difference. First operand has 109 places, 128 transitions, 515 flow. Second operand 6 states and 474 transitions. [2025-03-17 11:16:39,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 176 transitions, 963 flow [2025-03-17 11:16:39,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 176 transitions, 925 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-17 11:16:39,046 INFO L231 Difference]: Finished difference. Result has 119 places, 168 transitions, 981 flow [2025-03-17 11:16:39,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=981, PETRI_PLACES=119, PETRI_TRANSITIONS=168} [2025-03-17 11:16:39,047 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 30 predicate places. [2025-03-17 11:16:39,047 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 168 transitions, 981 flow [2025-03-17 11:16:39,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 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 11:16:39,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:39,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:16:39,048 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:16:39,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:39,048 INFO L85 PathProgramCache]: Analyzing trace with hash -358018170, now seen corresponding path program 1 times [2025-03-17 11:16:39,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:39,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326613207] [2025-03-17 11:16:39,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:39,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:39,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 11:16:39,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 11:16:39,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:39,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:39,344 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 11:16:39,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:39,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326613207] [2025-03-17 11:16:39,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326613207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:39,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:39,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:16:39,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440692924] [2025-03-17 11:16:39,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:39,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:16:39,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:39,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:16:39,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:16:39,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 88 [2025-03-17 11:16:39,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 168 transitions, 981 flow. Second operand has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 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 11:16:39,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:39,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 88 [2025-03-17 11:16:39,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:39,547 INFO L124 PetriNetUnfolderBase]: 125/536 cut-off events. [2025-03-17 11:16:39,547 INFO L125 PetriNetUnfolderBase]: For 639/656 co-relation queries the response was YES. [2025-03-17 11:16:39,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 536 events. 125/536 cut-off events. For 639/656 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2810 event pairs, 6 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 1501. Up to 135 conditions per place. [2025-03-17 11:16:39,551 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 55 selfloop transitions, 0 changer transitions 15/167 dead transitions. [2025-03-17 11:16:39,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 167 transitions, 1105 flow [2025-03-17 11:16:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:16:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:16:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 410 transitions. [2025-03-17 11:16:39,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7765151515151515 [2025-03-17 11:16:39,553 INFO L175 Difference]: Start difference. First operand has 119 places, 168 transitions, 981 flow. Second operand 6 states and 410 transitions. [2025-03-17 11:16:39,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 167 transitions, 1105 flow [2025-03-17 11:16:39,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 167 transitions, 1069 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-17 11:16:39,560 INFO L231 Difference]: Finished difference. Result has 115 places, 152 transitions, 908 flow [2025-03-17 11:16:39,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=908, PETRI_PLACES=115, PETRI_TRANSITIONS=152} [2025-03-17 11:16:39,561 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 26 predicate places. [2025-03-17 11:16:39,561 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 152 transitions, 908 flow [2025-03-17 11:16:39,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.83333333333333) internal successors, (407), 6 states have internal predecessors, (407), 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 11:16:39,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:39,562 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:39,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:16:39,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:16:39,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:39,563 INFO L85 PathProgramCache]: Analyzing trace with hash 289757406, now seen corresponding path program 1 times [2025-03-17 11:16:39,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:39,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700026725] [2025-03-17 11:16:39,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:39,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:39,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:16:39,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:16:39,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:39,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:40,350 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 11:16:40,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700026725] [2025-03-17 11:16:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700026725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:40,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:40,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:16:40,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157295604] [2025-03-17 11:16:40,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:40,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:16:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:40,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:16:40,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:16:40,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 88 [2025-03-17 11:16:40,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 152 transitions, 908 flow. Second operand has 13 states, 13 states have (on average 57.07692307692308) internal successors, (742), 13 states have internal predecessors, (742), 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 11:16:40,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:40,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 88 [2025-03-17 11:16:40,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:41,243 INFO L124 PetriNetUnfolderBase]: 186/656 cut-off events. [2025-03-17 11:16:41,243 INFO L125 PetriNetUnfolderBase]: For 784/799 co-relation queries the response was YES. [2025-03-17 11:16:41,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2184 conditions, 656 events. 186/656 cut-off events. For 784/799 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3340 event pairs, 9 based on Foata normal form. 1/653 useless extension candidates. Maximal degree in co-relation 2164. Up to 286 conditions per place. [2025-03-17 11:16:41,247 INFO L140 encePairwiseOnDemand]: 70/88 looper letters, 114 selfloop transitions, 46 changer transitions 0/200 dead transitions. [2025-03-17 11:16:41,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 200 transitions, 1524 flow [2025-03-17 11:16:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:16:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 11:16:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 861 transitions. [2025-03-17 11:16:41,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6988636363636364 [2025-03-17 11:16:41,250 INFO L175 Difference]: Start difference. First operand has 115 places, 152 transitions, 908 flow. Second operand 14 states and 861 transitions. [2025-03-17 11:16:41,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 200 transitions, 1524 flow [2025-03-17 11:16:41,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 200 transitions, 1522 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:16:41,257 INFO L231 Difference]: Finished difference. Result has 117 places, 167 transitions, 1203 flow [2025-03-17 11:16:41,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1203, PETRI_PLACES=117, PETRI_TRANSITIONS=167} [2025-03-17 11:16:41,258 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 28 predicate places. [2025-03-17 11:16:41,258 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 167 transitions, 1203 flow [2025-03-17 11:16:41,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 57.07692307692308) internal successors, (742), 13 states have internal predecessors, (742), 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 11:16:41,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:41,259 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:41,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:16:41,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:16:41,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash -920152563, now seen corresponding path program 1 times [2025-03-17 11:16:41,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:41,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014244501] [2025-03-17 11:16:41,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:16:41,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:41,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:16:41,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:16:41,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:16:41,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:41,871 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 11:16:41,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:41,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014244501] [2025-03-17 11:16:41,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014244501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:41,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:41,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:16:41,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576043576] [2025-03-17 11:16:41,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:41,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:16:41,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:41,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:16:41,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:16:42,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 88 [2025-03-17 11:16:42,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 167 transitions, 1203 flow. Second operand has 13 states, 13 states have (on average 61.84615384615385) internal successors, (804), 13 states have internal predecessors, (804), 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 11:16:42,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:42,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 88 [2025-03-17 11:16:42,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:42,740 INFO L124 PetriNetUnfolderBase]: 193/700 cut-off events. [2025-03-17 11:16:42,740 INFO L125 PetriNetUnfolderBase]: For 1243/1274 co-relation queries the response was YES. [2025-03-17 11:16:42,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2593 conditions, 700 events. 193/700 cut-off events. For 1243/1274 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3710 event pairs, 12 based on Foata normal form. 4/703 useless extension candidates. Maximal degree in co-relation 2565. Up to 354 conditions per place. [2025-03-17 11:16:42,747 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 130 selfloop transitions, 37 changer transitions 0/212 dead transitions. [2025-03-17 11:16:42,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 212 transitions, 1845 flow [2025-03-17 11:16:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:16:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 11:16:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 911 transitions. [2025-03-17 11:16:42,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.739448051948052 [2025-03-17 11:16:42,750 INFO L175 Difference]: Start difference. First operand has 117 places, 167 transitions, 1203 flow. Second operand 14 states and 911 transitions. [2025-03-17 11:16:42,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 212 transitions, 1845 flow [2025-03-17 11:16:42,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 212 transitions, 1807 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-17 11:16:42,764 INFO L231 Difference]: Finished difference. Result has 136 places, 195 transitions, 1567 flow [2025-03-17 11:16:42,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1567, PETRI_PLACES=136, PETRI_TRANSITIONS=195} [2025-03-17 11:16:42,766 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 47 predicate places. [2025-03-17 11:16:42,767 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 195 transitions, 1567 flow [2025-03-17 11:16:42,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 61.84615384615385) internal successors, (804), 13 states have internal predecessors, (804), 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 11:16:42,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:42,767 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:42,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:16:42,768 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:16:42,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1565288221, now seen corresponding path program 2 times [2025-03-17 11:16:42,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:42,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29380279] [2025-03-17 11:16:42,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:16:42,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:42,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:16:42,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:16:42,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:16:42,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:43,273 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 11:16:43,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:43,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29380279] [2025-03-17 11:16:43,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29380279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:16:43,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:16:43,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:16:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137851665] [2025-03-17 11:16:43,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:16:43,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:16:43,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:43,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:16:43,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:16:43,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 88 [2025-03-17 11:16:43,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 195 transitions, 1567 flow. Second operand has 13 states, 13 states have (on average 62.76923076923077) internal successors, (816), 13 states have internal predecessors, (816), 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 11:16:43,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:16:43,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 88 [2025-03-17 11:16:43,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:16:44,213 INFO L124 PetriNetUnfolderBase]: 214/791 cut-off events. [2025-03-17 11:16:44,213 INFO L125 PetriNetUnfolderBase]: For 2181/2216 co-relation queries the response was YES. [2025-03-17 11:16:44,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3235 conditions, 791 events. 214/791 cut-off events. For 2181/2216 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4460 event pairs, 9 based on Foata normal form. 6/795 useless extension candidates. Maximal degree in co-relation 3198. Up to 350 conditions per place. [2025-03-17 11:16:44,219 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 137 selfloop transitions, 77 changer transitions 0/263 dead transitions. [2025-03-17 11:16:44,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 263 transitions, 2641 flow [2025-03-17 11:16:44,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 11:16:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 11:16:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1435 transitions. [2025-03-17 11:16:44,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7412190082644629 [2025-03-17 11:16:44,222 INFO L175 Difference]: Start difference. First operand has 136 places, 195 transitions, 1567 flow. Second operand 22 states and 1435 transitions. [2025-03-17 11:16:44,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 263 transitions, 2641 flow [2025-03-17 11:16:44,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 263 transitions, 2589 flow, removed 25 selfloop flow, removed 1 redundant places. [2025-03-17 11:16:44,241 INFO L231 Difference]: Finished difference. Result has 168 places, 247 transitions, 2323 flow [2025-03-17 11:16:44,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2323, PETRI_PLACES=168, PETRI_TRANSITIONS=247} [2025-03-17 11:16:44,242 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 79 predicate places. [2025-03-17 11:16:44,242 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 247 transitions, 2323 flow [2025-03-17 11:16:44,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 62.76923076923077) internal successors, (816), 13 states have internal predecessors, (816), 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 11:16:44,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:16:44,243 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:16:44,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:16:44,243 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:16:44,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:16:44,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1266592231, now seen corresponding path program 3 times [2025-03-17 11:16:44,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:16:44,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60174966] [2025-03-17 11:16:44,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:16:44,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:16:44,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 2 equivalence classes. [2025-03-17 11:16:44,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:16:44,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 11:16:44,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:16:44,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:16:44,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60174966] [2025-03-17 11:16:44,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60174966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:16:44,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662958167] [2025-03-17 11:16:44,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:16:44,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:16:44,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:16:44,778 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 11:16:44,779 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 11:16:44,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 2 equivalence classes. [2025-03-17 11:16:44,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:16:44,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 11:16:44,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:16:44,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 11:16:44,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:16:45,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:16:45,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-17 11:16:45,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-17 11:16:45,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-17 11:16:45,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:16:45,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:16:45,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 41 [2025-03-17 11:16:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:16:45,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:16:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:16:54,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662958167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:16:54,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:16:54,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 11] total 35 [2025-03-17 11:16:54,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155845881] [2025-03-17 11:16:54,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:16:54,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 11:16:54,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:16:54,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 11:16:54,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1091, Unknown=3, NotChecked=0, Total=1260 [2025-03-17 11:16:56,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:16:59,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:17:02,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:17:05,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:17:08,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:17:11,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:17:14,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:17:17,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:17:21,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:17:24,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:17:27,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:17:31,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:17:33,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:17:33,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 88 [2025-03-17 11:17:33,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 247 transitions, 2323 flow. Second operand has 36 states, 36 states have (on average 48.361111111111114) internal successors, (1741), 36 states have internal predecessors, (1741), 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 11:17:33,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:17:33,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 88 [2025-03-17 11:17:33,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:17:35,899 INFO L124 PetriNetUnfolderBase]: 453/1571 cut-off events. [2025-03-17 11:17:35,899 INFO L125 PetriNetUnfolderBase]: For 5661/5734 co-relation queries the response was YES. [2025-03-17 11:17:35,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6985 conditions, 1571 events. 453/1571 cut-off events. For 5661/5734 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 11101 event pairs, 27 based on Foata normal form. 14/1582 useless extension candidates. Maximal degree in co-relation 6936. Up to 402 conditions per place. [2025-03-17 11:17:35,914 INFO L140 encePairwiseOnDemand]: 62/88 looper letters, 276 selfloop transitions, 125 changer transitions 0/441 dead transitions. [2025-03-17 11:17:35,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 441 transitions, 5121 flow [2025-03-17 11:17:35,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 11:17:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 11:17:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1528 transitions. [2025-03-17 11:17:35,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5787878787878787 [2025-03-17 11:17:35,919 INFO L175 Difference]: Start difference. First operand has 168 places, 247 transitions, 2323 flow. Second operand 30 states and 1528 transitions. [2025-03-17 11:17:35,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 441 transitions, 5121 flow [2025-03-17 11:17:35,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 441 transitions, 5013 flow, removed 43 selfloop flow, removed 4 redundant places. [2025-03-17 11:17:35,962 INFO L231 Difference]: Finished difference. Result has 209 places, 310 transitions, 3573 flow [2025-03-17 11:17:35,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3573, PETRI_PLACES=209, PETRI_TRANSITIONS=310} [2025-03-17 11:17:35,963 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 120 predicate places. [2025-03-17 11:17:35,963 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 310 transitions, 3573 flow [2025-03-17 11:17:35,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 48.361111111111114) internal successors, (1741), 36 states have internal predecessors, (1741), 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 11:17:35,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:17:35,964 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:17:35,974 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 11:17:36,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:17:36,165 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-03-17 11:17:36,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:17:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1410920945, now seen corresponding path program 4 times [2025-03-17 11:17:36,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:17:36,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058603345] [2025-03-17 11:17:36,166 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:17:36,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:17:36,177 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-17 11:17:36,185 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 58 statements. [2025-03-17 11:17:36,186 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:17:36,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:36,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:17:36,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:17:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058603345] [2025-03-17 11:17:36,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058603345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:17:36,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526240013] [2025-03-17 11:17:36,629 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:17:36,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:17:36,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:17:36,633 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 11:17:36,635 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 11:17:36,685 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-03-17 11:17:36,700 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 58 statements. [2025-03-17 11:17:36,700 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:17:36,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:17:36,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 11:17:36,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:17:36,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:17:36,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 11:17:36,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:17:36,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-17 11:17:36,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:17:36,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-17 11:17:36,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:17:36,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:17:36,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:17:36,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:17:36,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:17:36,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47 [2025-03-17 11:17:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:17:36,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:18:02,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post11#1| 1)) (.cse1 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 0)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store .cse1 |ULTIMATE.start_main_~is~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store .cse1 |ULTIMATE.start_main_~is~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store .cse1 |ULTIMATE.start_main_~is~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store .cse1 |ULTIMATE.start_main_~is~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) .cse2) 0))))))) is different from false [2025-03-17 11:18:06,462 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post11#1| 1)) (.cse1 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 0) .cse3 0)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store .cse1 |ULTIMATE.start_main_~is~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store .cse1 |ULTIMATE.start_main_~is~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) .cse2) 0)) (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store .cse1 |ULTIMATE.start_main_~is~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_~i~1#1_26| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_26| .cse0) (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int) (|ULTIMATE.start_main_~is~0#1.base| Int)) (= (select (select (store .cse1 |ULTIMATE.start_main_~is~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~is~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~1#1_26| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0))))))) is different from false