./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 09:34:16,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:34:16,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:34:16,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:34:16,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:34:17,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:34:17,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:34:17,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:34:17,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:34:17,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:34:17,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:34:17,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:34:17,010 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:34:17,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:34:17,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:34:17,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:34:17,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:34:17,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:34:17,011 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:34:17,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:34:17,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:34:17,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:34:17,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:34:17,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:34:17,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:34:17,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:34:17,012 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-jdk21/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-02-06 09:34:17,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:34:17,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:34:17,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:34:17,244 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:34:17,244 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:34:17,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2025-02-06 09:34:18,429 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88ff9ce3e/4601799769ae400dbc981578276405b2/FLAG589668b91 [2025-02-06 09:34:18,723 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:34:18,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2025-02-06 09:34:18,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88ff9ce3e/4601799769ae400dbc981578276405b2/FLAG589668b91 [2025-02-06 09:34:18,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/88ff9ce3e/4601799769ae400dbc981578276405b2 [2025-02-06 09:34:18,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:34:18,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:34:18,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:34:18,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:34:18,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:34:18,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:34:18" (1/1) ... [2025-02-06 09:34:18,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d57396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:18, skipping insertion in model container [2025-02-06 09:34:18,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:34:18" (1/1) ... [2025-02-06 09:34:18,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:34:19,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:34:19,062 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:34:19,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:34:19,163 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:34:19,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:19 WrapperNode [2025-02-06 09:34:19,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:34:19,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:34:19,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:34:19,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:34:19,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:19" (1/1) ... [2025-02-06 09:34:19,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:19" (1/1) ... [2025-02-06 09:34:19,197 INFO L138 Inliner]: procedures = 261, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-02-06 09:34:19,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:34:19,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:34:19,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:34:19,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:34:19,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:19" (1/1) ... [2025-02-06 09:34:19,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:19" (1/1) ... [2025-02-06 09:34:19,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:19" (1/1) ... [2025-02-06 09:34:19,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:19" (1/1) ... [2025-02-06 09:34:19,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:19" (1/1) ... [2025-02-06 09:34:19,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:19" (1/1) ... [2025-02-06 09:34:19,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:19" (1/1) ... [2025-02-06 09:34:19,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:19" (1/1) ... [2025-02-06 09:34:19,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:34:19,213 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:34:19,213 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:34:19,213 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:34:19,214 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:19" (1/1) ... [2025-02-06 09:34:19,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:34:19,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:34:19,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:34:19,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:34:19,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:34:19,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:34:19,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:34:19,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:34:19,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-06 09:34:19,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-06 09:34:19,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:34:19,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:34:19,275 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:34:19,362 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:34:19,364 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:34:19,502 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:34:19,502 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:34:19,508 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:34:19,509 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:34:19,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:34:19 BoogieIcfgContainer [2025-02-06 09:34:19,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:34:19,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:34:19,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:34:19,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:34:19,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:34:18" (1/3) ... [2025-02-06 09:34:19,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dee09ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:34:19, skipping insertion in model container [2025-02-06 09:34:19,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:34:19" (2/3) ... [2025-02-06 09:34:19,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dee09ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:34:19, skipping insertion in model container [2025-02-06 09:34:19,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:34:19" (3/3) ... [2025-02-06 09:34:19,515 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2025-02-06 09:34:19,527 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:34:19,528 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-02-06 09:34:19,529 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:34:19,577 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 09:34:19,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 88 transitions, 183 flow [2025-02-06 09:34:19,641 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2025-02-06 09:34:19,642 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:34:19,645 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-02-06 09:34:19,645 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 88 transitions, 183 flow [2025-02-06 09:34:19,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 88 transitions, 183 flow [2025-02-06 09:34:19,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:34:19,660 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;@4e0245b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:34:19,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 09:34:19,673 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:34:19,675 INFO L124 PetriNetUnfolderBase]: 1/42 cut-off events. [2025-02-06 09:34:19,675 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:34:19,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:19,676 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-02-06 09:34:19,676 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-02-06 09:34:19,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:19,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1825531627, now seen corresponding path program 1 times [2025-02-06 09:34:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:19,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816474119] [2025-02-06 09:34:19,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:19,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:19,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 09:34:19,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 09:34:19,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:19,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:20,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:20,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816474119] [2025-02-06 09:34:20,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816474119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:20,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:20,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:20,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062365221] [2025-02-06 09:34:20,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:20,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:34:20,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:20,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:34:20,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:34:20,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 88 [2025-02-06 09:34:20,506 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-02-06 09:34:20,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:20,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 88 [2025-02-06 09:34:20,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:20,718 INFO L124 PetriNetUnfolderBase]: 91/418 cut-off events. [2025-02-06 09:34:20,719 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:34:20,720 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 2026 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-02-06 09:34:20,722 INFO L140 encePairwiseOnDemand]: 76/88 looper letters, 27 selfloop transitions, 22 changer transitions 1/108 dead transitions. [2025-02-06 09:34:20,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 108 transitions, 321 flow [2025-02-06 09:34:20,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 405 transitions. [2025-02-06 09:34:20,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7670454545454546 [2025-02-06 09:34:20,736 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 183 flow. Second operand 6 states and 405 transitions. [2025-02-06 09:34:20,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 108 transitions, 321 flow [2025-02-06 09:34:20,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 108 transitions, 321 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:20,746 INFO L231 Difference]: Finished difference. Result has 99 places, 107 transitions, 329 flow [2025-02-06 09:34:20,748 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-02-06 09:34:20,752 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 10 predicate places. [2025-02-06 09:34:20,752 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 107 transitions, 329 flow [2025-02-06 09:34:20,753 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-02-06 09:34:20,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:20,753 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-02-06 09:34:20,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:34:20,753 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-02-06 09:34:20,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1969281508, now seen corresponding path program 1 times [2025-02-06 09:34:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:20,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227029351] [2025-02-06 09:34:20,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:20,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:20,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:34:20,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:34:20,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:20,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:20,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:20,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227029351] [2025-02-06 09:34:20,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227029351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:20,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:20,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:20,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36697822] [2025-02-06 09:34:20,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:20,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:34:20,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:20,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:34:20,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:34:20,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 88 [2025-02-06 09:34:20,982 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-02-06 09:34:20,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:20,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 88 [2025-02-06 09:34:20,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:21,017 INFO L124 PetriNetUnfolderBase]: 40/253 cut-off events. [2025-02-06 09:34:21,017 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 09:34:21,018 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 835 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-02-06 09:34:21,023 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 11 selfloop transitions, 2 changer transitions 5/112 dead transitions. [2025-02-06 09:34:21,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 112 transitions, 375 flow [2025-02-06 09:34:21,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 463 transitions. [2025-02-06 09:34:21,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8768939393939394 [2025-02-06 09:34:21,025 INFO L175 Difference]: Start difference. First operand has 99 places, 107 transitions, 329 flow. Second operand 6 states and 463 transitions. [2025-02-06 09:34:21,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 112 transitions, 375 flow [2025-02-06 09:34:21,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 112 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:21,029 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 347 flow [2025-02-06 09:34:21,029 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-02-06 09:34:21,030 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 18 predicate places. [2025-02-06 09:34:21,030 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 347 flow [2025-02-06 09:34:21,030 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-02-06 09:34:21,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:21,030 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-02-06 09:34:21,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:34:21,030 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-02-06 09:34:21,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:21,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2058554719, now seen corresponding path program 1 times [2025-02-06 09:34:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:21,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794002223] [2025-02-06 09:34:21,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:21,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:34:21,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:34:21,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:21,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:21,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:21,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794002223] [2025-02-06 09:34:21,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794002223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:21,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:21,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:21,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505133472] [2025-02-06 09:34:21,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:21,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:34:21,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:21,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:34:21,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:34:21,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 88 [2025-02-06 09:34:21,475 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-02-06 09:34:21,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:21,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 88 [2025-02-06 09:34:21,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:21,553 INFO L124 PetriNetUnfolderBase]: 109/469 cut-off events. [2025-02-06 09:34:21,554 INFO L125 PetriNetUnfolderBase]: For 102/105 co-relation queries the response was YES. [2025-02-06 09:34:21,555 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 2296 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-02-06 09:34:21,557 INFO L140 encePairwiseOnDemand]: 77/88 looper letters, 46 selfloop transitions, 22 changer transitions 0/128 dead transitions. [2025-02-06 09:34:21,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 128 transitions, 557 flow [2025-02-06 09:34:21,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:21,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 404 transitions. [2025-02-06 09:34:21,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7651515151515151 [2025-02-06 09:34:21,559 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 347 flow. Second operand 6 states and 404 transitions. [2025-02-06 09:34:21,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 128 transitions, 557 flow [2025-02-06 09:34:21,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 128 transitions, 543 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-06 09:34:21,562 INFO L231 Difference]: Finished difference. Result has 109 places, 128 transitions, 515 flow [2025-02-06 09:34:21,563 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-02-06 09:34:21,563 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 20 predicate places. [2025-02-06 09:34:21,563 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 128 transitions, 515 flow [2025-02-06 09:34:21,564 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-02-06 09:34:21,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:21,564 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-02-06 09:34:21,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:34:21,564 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-02-06 09:34:21,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:21,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1548332964, now seen corresponding path program 1 times [2025-02-06 09:34:21,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:21,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257831833] [2025-02-06 09:34:21,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:21,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:21,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 09:34:21,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 09:34:21,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:21,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:21,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:21,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257831833] [2025-02-06 09:34:21,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257831833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:21,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:21,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:21,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319398157] [2025-02-06 09:34:21,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:21,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:34:21,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:21,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:34:21,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:34:21,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 88 [2025-02-06 09:34:21,974 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-02-06 09:34:21,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:21,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 88 [2025-02-06 09:34:21,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:22,171 INFO L124 PetriNetUnfolderBase]: 140/585 cut-off events. [2025-02-06 09:34:22,173 INFO L125 PetriNetUnfolderBase]: For 340/365 co-relation queries the response was YES. [2025-02-06 09:34:22,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 585 events. 140/585 cut-off events. For 340/365 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3035 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-02-06 09:34:22,176 INFO L140 encePairwiseOnDemand]: 74/88 looper letters, 46 selfloop transitions, 57 changer transitions 8/176 dead transitions. [2025-02-06 09:34:22,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 176 transitions, 963 flow [2025-02-06 09:34:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 474 transitions. [2025-02-06 09:34:22,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8977272727272727 [2025-02-06 09:34:22,178 INFO L175 Difference]: Start difference. First operand has 109 places, 128 transitions, 515 flow. Second operand 6 states and 474 transitions. [2025-02-06 09:34:22,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 176 transitions, 963 flow [2025-02-06 09:34:22,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 176 transitions, 925 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:22,187 INFO L231 Difference]: Finished difference. Result has 119 places, 168 transitions, 981 flow [2025-02-06 09:34:22,187 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-02-06 09:34:22,187 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 30 predicate places. [2025-02-06 09:34:22,187 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 168 transitions, 981 flow [2025-02-06 09:34:22,188 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-02-06 09:34:22,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:22,188 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-02-06 09:34:22,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:34:22,188 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-02-06 09:34:22,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash -74011974, now seen corresponding path program 1 times [2025-02-06 09:34:22,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:22,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500756252] [2025-02-06 09:34:22,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:22,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:22,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 09:34:22,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 09:34:22,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:22,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:22,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:22,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500756252] [2025-02-06 09:34:22,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500756252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:22,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:22,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:34:22,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035991913] [2025-02-06 09:34:22,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:22,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:34:22,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:22,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:34:22,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:34:22,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 88 [2025-02-06 09:34:22,584 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-02-06 09:34:22,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:22,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 88 [2025-02-06 09:34:22,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:22,678 INFO L124 PetriNetUnfolderBase]: 125/536 cut-off events. [2025-02-06 09:34:22,679 INFO L125 PetriNetUnfolderBase]: For 639/656 co-relation queries the response was YES. [2025-02-06 09:34:22,681 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 2794 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-02-06 09:34:22,683 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 55 selfloop transitions, 0 changer transitions 15/167 dead transitions. [2025-02-06 09:34:22,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 167 transitions, 1105 flow [2025-02-06 09:34:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:34:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:34:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 410 transitions. [2025-02-06 09:34:22,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7765151515151515 [2025-02-06 09:34:22,686 INFO L175 Difference]: Start difference. First operand has 119 places, 168 transitions, 981 flow. Second operand 6 states and 410 transitions. [2025-02-06 09:34:22,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 167 transitions, 1105 flow [2025-02-06 09:34:22,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 167 transitions, 1069 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-02-06 09:34:22,697 INFO L231 Difference]: Finished difference. Result has 115 places, 152 transitions, 908 flow [2025-02-06 09:34:22,697 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-02-06 09:34:22,697 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 26 predicate places. [2025-02-06 09:34:22,698 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 152 transitions, 908 flow [2025-02-06 09:34:22,699 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-02-06 09:34:22,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:22,700 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-02-06 09:34:22,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:34:22,701 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-02-06 09:34:22,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:22,701 INFO L85 PathProgramCache]: Analyzing trace with hash -51073103, now seen corresponding path program 1 times [2025-02-06 09:34:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:22,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648955235] [2025-02-06 09:34:22,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:22,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:22,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:34:22,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:34:22,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:22,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:23,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648955235] [2025-02-06 09:34:23,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648955235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:23,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:23,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:34:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715905243] [2025-02-06 09:34:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:23,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:34:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:23,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:34:23,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:34:23,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 88 [2025-02-06 09:34:23,947 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-02-06 09:34:23,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:23,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 88 [2025-02-06 09:34:23,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:24,392 INFO L124 PetriNetUnfolderBase]: 186/656 cut-off events. [2025-02-06 09:34:24,393 INFO L125 PetriNetUnfolderBase]: For 784/799 co-relation queries the response was YES. [2025-02-06 09:34:24,395 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 3353 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-02-06 09:34:24,397 INFO L140 encePairwiseOnDemand]: 70/88 looper letters, 114 selfloop transitions, 46 changer transitions 0/200 dead transitions. [2025-02-06 09:34:24,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 200 transitions, 1524 flow [2025-02-06 09:34:24,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 09:34:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 09:34:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 861 transitions. [2025-02-06 09:34:24,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6988636363636364 [2025-02-06 09:34:24,400 INFO L175 Difference]: Start difference. First operand has 115 places, 152 transitions, 908 flow. Second operand 14 states and 861 transitions. [2025-02-06 09:34:24,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 200 transitions, 1524 flow [2025-02-06 09:34:24,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 200 transitions, 1522 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:34:24,408 INFO L231 Difference]: Finished difference. Result has 117 places, 167 transitions, 1203 flow [2025-02-06 09:34:24,408 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-02-06 09:34:24,409 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 28 predicate places. [2025-02-06 09:34:24,409 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 167 transitions, 1203 flow [2025-02-06 09:34:24,409 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-02-06 09:34:24,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:24,410 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-02-06 09:34:24,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:34:24,410 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-02-06 09:34:24,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash -640876453, now seen corresponding path program 1 times [2025-02-06 09:34:24,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:24,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663534612] [2025-02-06 09:34:24,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:34:24,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:24,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:34:24,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:34:24,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:34:24,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:24,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:24,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663534612] [2025-02-06 09:34:24,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663534612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:24,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:24,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:34:24,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595914110] [2025-02-06 09:34:24,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:24,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:34:24,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:24,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:34:24,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:34:25,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 88 [2025-02-06 09:34:25,472 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-02-06 09:34:25,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:25,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 88 [2025-02-06 09:34:25,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:25,786 INFO L124 PetriNetUnfolderBase]: 193/700 cut-off events. [2025-02-06 09:34:25,787 INFO L125 PetriNetUnfolderBase]: For 1243/1274 co-relation queries the response was YES. [2025-02-06 09:34:25,789 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 32. Compared 3715 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-02-06 09:34:25,791 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 130 selfloop transitions, 37 changer transitions 0/212 dead transitions. [2025-02-06 09:34:25,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 212 transitions, 1845 flow [2025-02-06 09:34:25,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 09:34:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 09:34:25,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 911 transitions. [2025-02-06 09:34:25,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.739448051948052 [2025-02-06 09:34:25,794 INFO L175 Difference]: Start difference. First operand has 117 places, 167 transitions, 1203 flow. Second operand 14 states and 911 transitions. [2025-02-06 09:34:25,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 212 transitions, 1845 flow [2025-02-06 09:34:25,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 212 transitions, 1807 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-02-06 09:34:25,805 INFO L231 Difference]: Finished difference. Result has 136 places, 195 transitions, 1567 flow [2025-02-06 09:34:25,805 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-02-06 09:34:25,806 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 47 predicate places. [2025-02-06 09:34:25,806 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 195 transitions, 1567 flow [2025-02-06 09:34:25,806 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-02-06 09:34:25,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:25,806 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-02-06 09:34:25,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:34:25,807 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-02-06 09:34:25,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:25,807 INFO L85 PathProgramCache]: Analyzing trace with hash 17282619, now seen corresponding path program 2 times [2025-02-06 09:34:25,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:25,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096305347] [2025-02-06 09:34:25,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:34:25,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:25,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 1 equivalence classes. [2025-02-06 09:34:25,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:34:25,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:34:25,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:26,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:26,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096305347] [2025-02-06 09:34:26,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096305347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:34:26,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:34:26,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 09:34:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723192842] [2025-02-06 09:34:26,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:34:26,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 09:34:26,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:26,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 09:34:26,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-06 09:34:26,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 88 [2025-02-06 09:34:26,790 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-02-06 09:34:26,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:34:26,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 88 [2025-02-06 09:34:26,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:34:27,365 INFO L124 PetriNetUnfolderBase]: 214/791 cut-off events. [2025-02-06 09:34:27,365 INFO L125 PetriNetUnfolderBase]: For 2181/2216 co-relation queries the response was YES. [2025-02-06 09:34:27,367 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 37. Compared 4468 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-02-06 09:34:27,370 INFO L140 encePairwiseOnDemand]: 67/88 looper letters, 137 selfloop transitions, 77 changer transitions 0/263 dead transitions. [2025-02-06 09:34:27,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 263 transitions, 2641 flow [2025-02-06 09:34:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 09:34:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 09:34:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1435 transitions. [2025-02-06 09:34:27,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7412190082644629 [2025-02-06 09:34:27,374 INFO L175 Difference]: Start difference. First operand has 136 places, 195 transitions, 1567 flow. Second operand 22 states and 1435 transitions. [2025-02-06 09:34:27,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 263 transitions, 2641 flow [2025-02-06 09:34:27,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 263 transitions, 2589 flow, removed 25 selfloop flow, removed 1 redundant places. [2025-02-06 09:34:27,389 INFO L231 Difference]: Finished difference. Result has 168 places, 247 transitions, 2323 flow [2025-02-06 09:34:27,390 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-02-06 09:34:27,390 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 79 predicate places. [2025-02-06 09:34:27,390 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 247 transitions, 2323 flow [2025-02-06 09:34:27,391 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-02-06 09:34:27,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:34:27,391 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-02-06 09:34:27,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:34:27,391 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-02-06 09:34:27,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:34:27,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1344097717, now seen corresponding path program 3 times [2025-02-06 09:34:27,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:34:27,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699200195] [2025-02-06 09:34:27,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:34:27,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:34:27,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 2 equivalence classes. [2025-02-06 09:34:27,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:34:27,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 09:34:27,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:28,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:34:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699200195] [2025-02-06 09:34:28,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699200195] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:34:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368791167] [2025-02-06 09:34:28,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 09:34:28,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:34:28,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:34:28,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:34:28,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:34:28,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 2 equivalence classes. [2025-02-06 09:34:28,152 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-02-06 09:34:28,152 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 09:34:28,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:34:28,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 09:34:28,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:34:28,428 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-02-06 09:34:28,468 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-02-06 09:34:28,511 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-02-06 09:34:28,587 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-02-06 09:34:28,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:34:28,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:34:28,742 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-02-06 09:34:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:28,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:34:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:34:40,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368791167] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:34:40,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:34:40,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 11] total 35 [2025-02-06 09:34:40,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655860588] [2025-02-06 09:34:40,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:34:40,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 09:34:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:34:40,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 09:34:40,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1090, Unknown=4, NotChecked=0, Total=1260 [2025-02-06 09:34:44,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:34:46,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:34:48,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:34:50,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:34:54,376 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-02-06 09:34:57,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:35:01,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:35:06,959 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-02-06 09:35:11,833 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-02-06 09:35:16,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:35:21,953 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-02-06 09:35:26,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:35:30,846 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-02-06 09:35:33,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 09:35:33,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 88 [2025-02-06 09:35:33,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 247 transitions, 2323 flow. Second operand has 36 states, 36 states have (on average 50.22222222222222) internal successors, (1808), 36 states have internal predecessors, (1808), 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-02-06 09:35:33,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:35:33,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 88 [2025-02-06 09:35:33,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:35:36,009 INFO L124 PetriNetUnfolderBase]: 431/1515 cut-off events. [2025-02-06 09:35:36,009 INFO L125 PetriNetUnfolderBase]: For 5760/5805 co-relation queries the response was YES. [2025-02-06 09:35:36,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6805 conditions, 1515 events. 431/1515 cut-off events. For 5760/5805 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 10757 event pairs, 34 based on Foata normal form. 14/1526 useless extension candidates. Maximal degree in co-relation 6756. Up to 374 conditions per place. [2025-02-06 09:35:36,021 INFO L140 encePairwiseOnDemand]: 62/88 looper letters, 265 selfloop transitions, 125 changer transitions 0/431 dead transitions. [2025-02-06 09:35:36,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 431 transitions, 5065 flow [2025-02-06 09:35:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 09:35:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-06 09:35:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1581 transitions. [2025-02-06 09:35:36,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5988636363636364 [2025-02-06 09:35:36,025 INFO L175 Difference]: Start difference. First operand has 168 places, 247 transitions, 2323 flow. Second operand 30 states and 1581 transitions. [2025-02-06 09:35:36,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 431 transitions, 5065 flow [2025-02-06 09:35:36,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 431 transitions, 4957 flow, removed 43 selfloop flow, removed 4 redundant places. [2025-02-06 09:35:36,058 INFO L231 Difference]: Finished difference. Result has 209 places, 310 transitions, 3573 flow [2025-02-06 09:35:36,059 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-02-06 09:35:36,059 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 120 predicate places. [2025-02-06 09:35:36,059 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 310 transitions, 3573 flow [2025-02-06 09:35:36,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 50.22222222222222) internal successors, (1808), 36 states have internal predecessors, (1808), 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-02-06 09:35:36,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:35:36,060 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-02-06 09:35:36,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 09:35:36,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:35:36,264 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-02-06 09:35:36,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:35:36,264 INFO L85 PathProgramCache]: Analyzing trace with hash -7062969, now seen corresponding path program 4 times [2025-02-06 09:35:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:35:36,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661487203] [2025-02-06 09:35:36,265 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:35:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:35:36,274 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-02-06 09:35:36,282 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 58 statements. [2025-02-06 09:35:36,282 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 09:35:36,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:36,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:36,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:35:36,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661487203] [2025-02-06 09:35:36,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661487203] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:35:36,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294823224] [2025-02-06 09:35:36,732 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 09:35:36,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:35:36,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:35:36,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:35:36,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:35:36,785 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 58 statements into 2 equivalence classes. [2025-02-06 09:35:36,802 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 58 statements. [2025-02-06 09:35:36,802 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 09:35:36,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:35:36,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 09:35:36,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:35:36,854 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-02-06 09:35:36,880 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-02-06 09:35:36,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:35:36,907 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-02-06 09:35:36,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:35:36,975 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-02-06 09:35:37,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:35:37,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:35:37,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:35:37,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 09:35:37,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:35:37,079 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-02-06 09:35:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:35:37,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:35:52,050 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