./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:04:43,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:04:43,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:04:43,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:04:43,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:04:43,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:04:43,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:04:43,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:04:43,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:04:43,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:04:43,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:04:43,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:04:43,514 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:04:43,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:04:43,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:04:43,514 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:04:43,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:04:43,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:04:43,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:04:43,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:04:43,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:04:43,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:04:43,514 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:04:43,515 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:04:43,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:04:43,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:04:43,516 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 [2025-03-17 11:04:43,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:04:43,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:04:43,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:04:43,759 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:04:43,759 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:04:43,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2025-03-17 11:04:44,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5d24315/f992c18ff99a4a71b14570792c1c3b48/FLAGd5ba62b2a [2025-03-17 11:04:45,178 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:04:45,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2025-03-17 11:04:45,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5d24315/f992c18ff99a4a71b14570792c1c3b48/FLAGd5ba62b2a [2025-03-17 11:04:45,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a5d24315/f992c18ff99a4a71b14570792c1c3b48 [2025-03-17 11:04:45,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:04:45,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:04:45,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:04:45,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:04:45,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:04:45,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:04:45" (1/1) ... [2025-03-17 11:04:45,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ff29b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:45, skipping insertion in model container [2025-03-17 11:04:45,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:04:45" (1/1) ... [2025-03-17 11:04:45,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:04:45,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:04:45,943 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:04:46,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:04:46,062 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:04:46,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:46 WrapperNode [2025-03-17 11:04:46,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:04:46,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:04:46,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:04:46,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:04:46,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:46" (1/1) ... [2025-03-17 11:04:46,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:46" (1/1) ... [2025-03-17 11:04:46,119 INFO L138 Inliner]: procedures = 368, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2025-03-17 11:04:46,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:04:46,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:04:46,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:04:46,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:04:46,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:46" (1/1) ... [2025-03-17 11:04:46,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:46" (1/1) ... [2025-03-17 11:04:46,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:46" (1/1) ... [2025-03-17 11:04:46,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:46" (1/1) ... [2025-03-17 11:04:46,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:46" (1/1) ... [2025-03-17 11:04:46,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:46" (1/1) ... [2025-03-17 11:04:46,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:46" (1/1) ... [2025-03-17 11:04:46,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:46" (1/1) ... [2025-03-17 11:04:46,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:04:46,158 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:04:46,158 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:04:46,158 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:04:46,159 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:46" (1/1) ... [2025-03-17 11:04:46,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:04:46,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:04:46,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:04:46,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:04:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 11:04:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:04:46,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:04:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:04:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:04:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:04:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:04:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 11:04:46,215 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 11:04:46,216 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 11:04:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:04:46,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:04:46,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:04:46,217 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:04:46,339 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:04:46,341 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:04:46,884 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:04:46,885 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:04:46,906 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:04:46,907 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:04:46,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:04:46 BoogieIcfgContainer [2025-03-17 11:04:46,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:04:46,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:04:46,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:04:46,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:04:46,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:04:45" (1/3) ... [2025-03-17 11:04:46,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f682ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:04:46, skipping insertion in model container [2025-03-17 11:04:46,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:04:46" (2/3) ... [2025-03-17 11:04:46,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f682ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:04:46, skipping insertion in model container [2025-03-17 11:04:46,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:04:46" (3/3) ... [2025-03-17 11:04:46,916 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2025-03-17 11:04:46,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:04:46,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_03-list2_rc.i that has 2 procedures, 277 locations, 1 initial locations, 0 loop locations, and 28 error locations. [2025-03-17 11:04:46,931 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:04:47,007 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:04:47,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 276 transitions, 556 flow [2025-03-17 11:04:47,149 INFO L124 PetriNetUnfolderBase]: 0/275 cut-off events. [2025-03-17 11:04:47,151 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:04:47,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 275 events. 0/275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 186 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-17 11:04:47,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 280 places, 276 transitions, 556 flow [2025-03-17 11:04:47,162 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 275 transitions, 553 flow [2025-03-17 11:04:47,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:04:47,180 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;@42549a9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:04:47,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-03-17 11:04:47,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:04:47,189 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-17 11:04:47,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:04:47,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:47,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:47,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:47,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:47,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2001832957, now seen corresponding path program 1 times [2025-03-17 11:04:47,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:47,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6994605] [2025-03-17 11:04:47,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:47,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:47,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:04:47,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:04:47,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:47,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:47,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-03-17 11:04:47,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:47,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6994605] [2025-03-17 11:04:47,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6994605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:47,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:47,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:47,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816491509] [2025-03-17 11:04:47,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:47,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:47,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:47,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:47,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:48,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 276 [2025-03-17 11:04:48,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 275 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:48,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:48,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 276 [2025-03-17 11:04:48,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:48,903 INFO L124 PetriNetUnfolderBase]: 560/2325 cut-off events. [2025-03-17 11:04:48,903 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:04:48,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 2325 events. 560/2325 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14851 event pairs, 560 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 3350. Up to 1193 conditions per place. [2025-03-17 11:04:48,921 INFO L140 encePairwiseOnDemand]: 258/276 looper letters, 72 selfloop transitions, 15 changer transitions 0/272 dead transitions. [2025-03-17 11:04:48,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 272 transitions, 721 flow [2025-03-17 11:04:48,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2025-03-17 11:04:48,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2025-03-17 11:04:48,945 INFO L175 Difference]: Start difference. First operand has 279 places, 275 transitions, 553 flow. Second operand 6 states and 1206 transitions. [2025-03-17 11:04:48,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 272 transitions, 721 flow [2025-03-17 11:04:48,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 272 transitions, 720 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:48,957 INFO L231 Difference]: Finished difference. Result has 280 places, 272 transitions, 576 flow [2025-03-17 11:04:48,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=280, PETRI_TRANSITIONS=272} [2025-03-17 11:04:48,963 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 1 predicate places. [2025-03-17 11:04:48,964 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 272 transitions, 576 flow [2025-03-17 11:04:48,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:48,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:48,965 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] [2025-03-17 11:04:48,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:04:48,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:48,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:48,967 INFO L85 PathProgramCache]: Analyzing trace with hash -531161866, now seen corresponding path program 1 times [2025-03-17 11:04:48,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:48,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786874107] [2025-03-17 11:04:48,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:48,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 11:04:48,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 11:04:48,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:48,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:49,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:49,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786874107] [2025-03-17 11:04:49,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786874107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:49,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:49,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:49,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015851974] [2025-03-17 11:04:49,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:49,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:49,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:49,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:49,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:49,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 276 [2025-03-17 11:04:49,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 272 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:49,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:49,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 276 [2025-03-17 11:04:49,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:49,946 INFO L124 PetriNetUnfolderBase]: 560/2325 cut-off events. [2025-03-17 11:04:49,946 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:04:49,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3552 conditions, 2325 events. 560/2325 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14886 event pairs, 560 based on Foata normal form. 0/2119 useless extension candidates. Maximal degree in co-relation 3394. Up to 1193 conditions per place. [2025-03-17 11:04:49,958 INFO L140 encePairwiseOnDemand]: 258/276 looper letters, 72 selfloop transitions, 15 changer transitions 0/269 dead transitions. [2025-03-17 11:04:49,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 269 transitions, 744 flow [2025-03-17 11:04:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:49,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2025-03-17 11:04:49,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2025-03-17 11:04:49,963 INFO L175 Difference]: Start difference. First operand has 280 places, 272 transitions, 576 flow. Second operand 6 states and 1206 transitions. [2025-03-17 11:04:49,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 269 transitions, 744 flow [2025-03-17 11:04:49,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 269 transitions, 714 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:04:49,969 INFO L231 Difference]: Finished difference. Result has 277 places, 269 transitions, 570 flow [2025-03-17 11:04:49,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=277, PETRI_TRANSITIONS=269} [2025-03-17 11:04:49,969 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -2 predicate places. [2025-03-17 11:04:49,970 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 269 transitions, 570 flow [2025-03-17 11:04:49,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:49,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:49,971 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] [2025-03-17 11:04:49,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:04:49,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:49,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash -307655887, now seen corresponding path program 1 times [2025-03-17 11:04:49,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:49,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151471908] [2025-03-17 11:04:49,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:49,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:49,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:04:49,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:04:49,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:49,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:50,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:50,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151471908] [2025-03-17 11:04:50,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151471908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:50,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:50,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:04:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15267791] [2025-03-17 11:04:50,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:50,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:04:50,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:50,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:04:50,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:04:50,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 276 [2025-03-17 11:04:50,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 269 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:50,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:50,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 276 [2025-03-17 11:04:50,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:50,112 INFO L124 PetriNetUnfolderBase]: 30/718 cut-off events. [2025-03-17 11:04:50,113 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:04:50,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 718 events. 30/718 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2648 event pairs, 30 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 671. Up to 78 conditions per place. [2025-03-17 11:04:50,117 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-03-17 11:04:50,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 268 transitions, 606 flow [2025-03-17 11:04:50,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:04:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:04:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-03-17 11:04:50,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516908212560387 [2025-03-17 11:04:50,121 INFO L175 Difference]: Start difference. First operand has 277 places, 269 transitions, 570 flow. Second operand 3 states and 788 transitions. [2025-03-17 11:04:50,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 268 transitions, 606 flow [2025-03-17 11:04:50,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 268 transitions, 576 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:04:50,124 INFO L231 Difference]: Finished difference. Result has 273 places, 268 transitions, 542 flow [2025-03-17 11:04:50,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=273, PETRI_TRANSITIONS=268} [2025-03-17 11:04:50,126 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -6 predicate places. [2025-03-17 11:04:50,126 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 268 transitions, 542 flow [2025-03-17 11:04:50,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:50,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:50,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:50,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:04:50,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:50,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:50,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1691774696, now seen corresponding path program 1 times [2025-03-17 11:04:50,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:50,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691242212] [2025-03-17 11:04:50,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:50,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:50,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 11:04:50,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 11:04:50,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:50,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691242212] [2025-03-17 11:04:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691242212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:50,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:50,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:04:50,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879230955] [2025-03-17 11:04:50,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:50,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:04:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:50,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:04:50,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:04:50,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 276 [2025-03-17 11:04:50,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 268 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:50,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:50,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 276 [2025-03-17 11:04:50,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:50,238 INFO L124 PetriNetUnfolderBase]: 36/750 cut-off events. [2025-03-17 11:04:50,239 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:04:50,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 750 events. 36/750 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3032 event pairs, 36 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 788. Up to 89 conditions per place. [2025-03-17 11:04:50,241 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 17 selfloop transitions, 1 changer transitions 0/264 dead transitions. [2025-03-17 11:04:50,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 264 transitions, 570 flow [2025-03-17 11:04:50,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:04:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:04:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-03-17 11:04:50,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468599033816425 [2025-03-17 11:04:50,243 INFO L175 Difference]: Start difference. First operand has 273 places, 268 transitions, 542 flow. Second operand 3 states and 784 transitions. [2025-03-17 11:04:50,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 264 transitions, 570 flow [2025-03-17 11:04:50,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 264 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:04:50,246 INFO L231 Difference]: Finished difference. Result has 269 places, 264 transitions, 532 flow [2025-03-17 11:04:50,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=269, PETRI_TRANSITIONS=264} [2025-03-17 11:04:50,247 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -10 predicate places. [2025-03-17 11:04:50,247 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 264 transitions, 532 flow [2025-03-17 11:04:50,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:50,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:50,248 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:50,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:04:50,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:50,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash -45461933, now seen corresponding path program 1 times [2025-03-17 11:04:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:50,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298194683] [2025-03-17 11:04:50,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:50,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:50,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 11:04:50,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 11:04:50,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:50,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:50,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:50,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298194683] [2025-03-17 11:04:50,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298194683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:50,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:50,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:50,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218818028] [2025-03-17 11:04:50,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:50,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:50,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:50,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:50,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:50,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 276 [2025-03-17 11:04:50,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 264 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:50,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:50,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 276 [2025-03-17 11:04:50,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:51,150 INFO L124 PetriNetUnfolderBase]: 638/2519 cut-off events. [2025-03-17 11:04:51,151 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:04:51,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3891 conditions, 2519 events. 638/2519 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 16226 event pairs, 638 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 3822. Up to 1362 conditions per place. [2025-03-17 11:04:51,159 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 85 selfloop transitions, 5 changer transitions 0/263 dead transitions. [2025-03-17 11:04:51,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 263 transitions, 710 flow [2025-03-17 11:04:51,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1201 transitions. [2025-03-17 11:04:51,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7252415458937198 [2025-03-17 11:04:51,163 INFO L175 Difference]: Start difference. First operand has 269 places, 264 transitions, 532 flow. Second operand 6 states and 1201 transitions. [2025-03-17 11:04:51,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 263 transitions, 710 flow [2025-03-17 11:04:51,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 263 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:51,168 INFO L231 Difference]: Finished difference. Result has 272 places, 263 transitions, 539 flow [2025-03-17 11:04:51,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=539, PETRI_PLACES=272, PETRI_TRANSITIONS=263} [2025-03-17 11:04:51,170 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -7 predicate places. [2025-03-17 11:04:51,170 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 263 transitions, 539 flow [2025-03-17 11:04:51,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:51,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:51,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:51,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:04:51,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:51,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash -3113110, now seen corresponding path program 1 times [2025-03-17 11:04:51,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:51,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966907278] [2025-03-17 11:04:51,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:51,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:51,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 11:04:51,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 11:04:51,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:51,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966907278] [2025-03-17 11:04:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966907278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:51,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:51,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:04:51,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472352130] [2025-03-17 11:04:51,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:51,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:04:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:51,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:04:51,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:04:51,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 276 [2025-03-17 11:04:51,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 263 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:51,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:51,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 276 [2025-03-17 11:04:51,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:51,331 INFO L124 PetriNetUnfolderBase]: 30/706 cut-off events. [2025-03-17 11:04:51,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:04:51,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 706 events. 30/706 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2677 event pairs, 30 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 737. Up to 78 conditions per place. [2025-03-17 11:04:51,334 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2025-03-17 11:04:51,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 262 transitions, 575 flow [2025-03-17 11:04:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:04:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:04:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-03-17 11:04:51,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516908212560387 [2025-03-17 11:04:51,335 INFO L175 Difference]: Start difference. First operand has 272 places, 263 transitions, 539 flow. Second operand 3 states and 788 transitions. [2025-03-17 11:04:51,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 262 transitions, 575 flow [2025-03-17 11:04:51,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 262 transitions, 565 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:04:51,338 INFO L231 Difference]: Finished difference. Result has 268 places, 262 transitions, 531 flow [2025-03-17 11:04:51,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=268, PETRI_TRANSITIONS=262} [2025-03-17 11:04:51,339 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -11 predicate places. [2025-03-17 11:04:51,339 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 262 transitions, 531 flow [2025-03-17 11:04:51,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:51,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:51,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:51,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:04:51,340 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:51,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:51,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1676947210, now seen corresponding path program 1 times [2025-03-17 11:04:51,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:51,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504797860] [2025-03-17 11:04:51,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:51,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:51,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 11:04:51,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 11:04:51,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:51,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:04:51,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:51,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504797860] [2025-03-17 11:04:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504797860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:51,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:51,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:04:51,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460428092] [2025-03-17 11:04:51,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:51,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:04:51,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:51,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:04:51,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:04:51,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 276 [2025-03-17 11:04:51,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 262 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:51,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:51,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 276 [2025-03-17 11:04:51,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:51,494 INFO L124 PetriNetUnfolderBase]: 36/734 cut-off events. [2025-03-17 11:04:51,494 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:04:51,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 734 events. 36/734 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2897 event pairs, 36 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 774. Up to 89 conditions per place. [2025-03-17 11:04:51,496 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 17 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2025-03-17 11:04:51,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 258 transitions, 559 flow [2025-03-17 11:04:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:04:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:04:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-03-17 11:04:51,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468599033816425 [2025-03-17 11:04:51,500 INFO L175 Difference]: Start difference. First operand has 268 places, 262 transitions, 531 flow. Second operand 3 states and 784 transitions. [2025-03-17 11:04:51,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 258 transitions, 559 flow [2025-03-17 11:04:51,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 258 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:04:51,503 INFO L231 Difference]: Finished difference. Result has 264 places, 258 transitions, 521 flow [2025-03-17 11:04:51,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=264, PETRI_TRANSITIONS=258} [2025-03-17 11:04:51,505 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -15 predicate places. [2025-03-17 11:04:51,505 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 258 transitions, 521 flow [2025-03-17 11:04:51,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:51,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:51,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:51,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:04:51,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:51,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:51,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1791327929, now seen corresponding path program 1 times [2025-03-17 11:04:51,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:51,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002606649] [2025-03-17 11:04:51,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:51,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:51,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 11:04:51,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 11:04:51,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:51,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:04:51,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:51,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002606649] [2025-03-17 11:04:51,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002606649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:51,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:51,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:51,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652697478] [2025-03-17 11:04:51,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:51,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:51,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:51,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:51,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:52,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 276 [2025-03-17 11:04:52,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 258 transitions, 521 flow. Second operand has 6 states, 6 states have (on average 191.16666666666666) internal successors, (1147), 6 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:52,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:52,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 276 [2025-03-17 11:04:52,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:52,536 INFO L124 PetriNetUnfolderBase]: 638/2432 cut-off events. [2025-03-17 11:04:52,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:04:52,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3805 conditions, 2432 events. 638/2432 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 15362 event pairs, 638 based on Foata normal form. 0/2287 useless extension candidates. Maximal degree in co-relation 3737. Up to 1362 conditions per place. [2025-03-17 11:04:52,547 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 85 selfloop transitions, 5 changer transitions 0/257 dead transitions. [2025-03-17 11:04:52,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 257 transitions, 699 flow [2025-03-17 11:04:52,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1201 transitions. [2025-03-17 11:04:52,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7252415458937198 [2025-03-17 11:04:52,550 INFO L175 Difference]: Start difference. First operand has 264 places, 258 transitions, 521 flow. Second operand 6 states and 1201 transitions. [2025-03-17 11:04:52,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 257 transitions, 699 flow [2025-03-17 11:04:52,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 257 transitions, 698 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:52,556 INFO L231 Difference]: Finished difference. Result has 267 places, 257 transitions, 528 flow [2025-03-17 11:04:52,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=528, PETRI_PLACES=267, PETRI_TRANSITIONS=257} [2025-03-17 11:04:52,558 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -12 predicate places. [2025-03-17 11:04:52,558 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 257 transitions, 528 flow [2025-03-17 11:04:52,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.16666666666666) internal successors, (1147), 6 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:52,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:52,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:52,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:04:52,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:52,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1439217694, now seen corresponding path program 1 times [2025-03-17 11:04:52,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:52,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696666071] [2025-03-17 11:04:52,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:52,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:52,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 11:04:52,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 11:04:52,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:52,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:04:53,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:53,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696666071] [2025-03-17 11:04:53,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696666071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:53,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:53,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:53,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757038634] [2025-03-17 11:04:53,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:53,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:53,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:53,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:53,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:53,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 276 [2025-03-17 11:04:53,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 257 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:53,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:53,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 276 [2025-03-17 11:04:53,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:53,759 INFO L124 PetriNetUnfolderBase]: 232/1787 cut-off events. [2025-03-17 11:04:53,760 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:04:53,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 1787 events. 232/1787 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11415 event pairs, 20 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 2277. Up to 305 conditions per place. [2025-03-17 11:04:53,772 INFO L140 encePairwiseOnDemand]: 257/276 looper letters, 100 selfloop transitions, 38 changer transitions 0/331 dead transitions. [2025-03-17 11:04:53,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 331 transitions, 952 flow [2025-03-17 11:04:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1412 transitions. [2025-03-17 11:04:53,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8526570048309179 [2025-03-17 11:04:53,777 INFO L175 Difference]: Start difference. First operand has 267 places, 257 transitions, 528 flow. Second operand 6 states and 1412 transitions. [2025-03-17 11:04:53,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 331 transitions, 952 flow [2025-03-17 11:04:53,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 331 transitions, 942 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:04:53,786 INFO L231 Difference]: Finished difference. Result has 271 places, 293 transitions, 776 flow [2025-03-17 11:04:53,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=271, PETRI_TRANSITIONS=293} [2025-03-17 11:04:53,788 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -8 predicate places. [2025-03-17 11:04:53,789 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 293 transitions, 776 flow [2025-03-17 11:04:53,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:53,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:53,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:53,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:04:53,790 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:53,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1907233153, now seen corresponding path program 1 times [2025-03-17 11:04:53,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:53,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448025219] [2025-03-17 11:04:53,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:53,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:53,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 11:04:53,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 11:04:53,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:53,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:04:54,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:54,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448025219] [2025-03-17 11:04:54,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448025219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:54,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:54,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:54,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759577748] [2025-03-17 11:04:54,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:54,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:54,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:54,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:54,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:54,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 276 [2025-03-17 11:04:54,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 293 transitions, 776 flow. Second operand has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:54,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:54,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 276 [2025-03-17 11:04:54,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:54,692 INFO L124 PetriNetUnfolderBase]: 185/1591 cut-off events. [2025-03-17 11:04:54,692 INFO L125 PetriNetUnfolderBase]: For 206/211 co-relation queries the response was YES. [2025-03-17 11:04:54,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2363 conditions, 1591 events. 185/1591 cut-off events. For 206/211 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9980 event pairs, 75 based on Foata normal form. 0/1473 useless extension candidates. Maximal degree in co-relation 2293. Up to 354 conditions per place. [2025-03-17 11:04:54,698 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 96 selfloop transitions, 5 changer transitions 0/308 dead transitions. [2025-03-17 11:04:54,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 308 transitions, 1008 flow [2025-03-17 11:04:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2025-03-17 11:04:54,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2025-03-17 11:04:54,701 INFO L175 Difference]: Start difference. First operand has 271 places, 293 transitions, 776 flow. Second operand 6 states and 1382 transitions. [2025-03-17 11:04:54,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 308 transitions, 1008 flow [2025-03-17 11:04:54,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 308 transitions, 1008 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:54,706 INFO L231 Difference]: Finished difference. Result has 275 places, 292 transitions, 784 flow [2025-03-17 11:04:54,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=784, PETRI_PLACES=275, PETRI_TRANSITIONS=292} [2025-03-17 11:04:54,707 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -4 predicate places. [2025-03-17 11:04:54,707 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 292 transitions, 784 flow [2025-03-17 11:04:54,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:54,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:54,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:54,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:04:54,708 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:54,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:54,708 INFO L85 PathProgramCache]: Analyzing trace with hash -912490012, now seen corresponding path program 1 times [2025-03-17 11:04:54,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:54,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432516267] [2025-03-17 11:04:54,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:54,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:54,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 11:04:54,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 11:04:54,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:54,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:04:55,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:55,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432516267] [2025-03-17 11:04:55,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432516267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:55,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:55,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:55,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754068402] [2025-03-17 11:04:55,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:55,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:55,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:55,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:55,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 276 [2025-03-17 11:04:55,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 292 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:55,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:55,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 276 [2025-03-17 11:04:55,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:55,730 INFO L124 PetriNetUnfolderBase]: 583/2948 cut-off events. [2025-03-17 11:04:55,730 INFO L125 PetriNetUnfolderBase]: For 706/713 co-relation queries the response was YES. [2025-03-17 11:04:55,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 2948 events. 583/2948 cut-off events. For 706/713 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21814 event pairs, 69 based on Foata normal form. 0/2762 useless extension candidates. Maximal degree in co-relation 4953. Up to 795 conditions per place. [2025-03-17 11:04:55,740 INFO L140 encePairwiseOnDemand]: 254/276 looper letters, 111 selfloop transitions, 72 changer transitions 0/381 dead transitions. [2025-03-17 11:04:55,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 381 transitions, 1520 flow [2025-03-17 11:04:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2025-03-17 11:04:55,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8387681159420289 [2025-03-17 11:04:55,743 INFO L175 Difference]: Start difference. First operand has 275 places, 292 transitions, 784 flow. Second operand 6 states and 1389 transitions. [2025-03-17 11:04:55,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 381 transitions, 1520 flow [2025-03-17 11:04:55,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 381 transitions, 1502 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:04:55,749 INFO L231 Difference]: Finished difference. Result has 280 places, 362 transitions, 1440 flow [2025-03-17 11:04:55,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1440, PETRI_PLACES=280, PETRI_TRANSITIONS=362} [2025-03-17 11:04:55,750 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 1 predicate places. [2025-03-17 11:04:55,750 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 362 transitions, 1440 flow [2025-03-17 11:04:55,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:55,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:55,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:55,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:04:55,751 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:55,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:55,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1674643835, now seen corresponding path program 1 times [2025-03-17 11:04:55,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:55,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317083316] [2025-03-17 11:04:55,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:55,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:55,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 11:04:55,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 11:04:55,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:55,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:04:56,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:56,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317083316] [2025-03-17 11:04:56,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317083316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:56,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:56,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:56,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033206462] [2025-03-17 11:04:56,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:56,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:56,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:56,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:56,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:56,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2025-03-17 11:04:56,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 362 transitions, 1440 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:56,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:56,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2025-03-17 11:04:56,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:56,984 INFO L124 PetriNetUnfolderBase]: 1657/5695 cut-off events. [2025-03-17 11:04:56,984 INFO L125 PetriNetUnfolderBase]: For 3355/3415 co-relation queries the response was YES. [2025-03-17 11:04:57,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12784 conditions, 5695 events. 1657/5695 cut-off events. For 3355/3415 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 45837 event pairs, 861 based on Foata normal form. 0/5367 useless extension candidates. Maximal degree in co-relation 12709. Up to 3147 conditions per place. [2025-03-17 11:04:57,063 INFO L140 encePairwiseOnDemand]: 253/276 looper letters, 201 selfloop transitions, 89 changer transitions 0/462 dead transitions. [2025-03-17 11:04:57,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 462 transitions, 2424 flow [2025-03-17 11:04:57,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:57,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1302 transitions. [2025-03-17 11:04:57,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7862318840579711 [2025-03-17 11:04:57,066 INFO L175 Difference]: Start difference. First operand has 280 places, 362 transitions, 1440 flow. Second operand 6 states and 1302 transitions. [2025-03-17 11:04:57,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 462 transitions, 2424 flow [2025-03-17 11:04:57,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 462 transitions, 2424 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:57,080 INFO L231 Difference]: Finished difference. Result has 290 places, 446 transitions, 2242 flow [2025-03-17 11:04:57,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2242, PETRI_PLACES=290, PETRI_TRANSITIONS=446} [2025-03-17 11:04:57,082 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 11 predicate places. [2025-03-17 11:04:57,082 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 446 transitions, 2242 flow [2025-03-17 11:04:57,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:57,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:57,083 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:57,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:04:57,083 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:57,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1881749824, now seen corresponding path program 1 times [2025-03-17 11:04:57,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:57,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983645344] [2025-03-17 11:04:57,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:57,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:57,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 11:04:57,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 11:04:57,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:57,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:04:57,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:57,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983645344] [2025-03-17 11:04:57,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983645344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:57,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:57,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:04:57,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342032404] [2025-03-17 11:04:57,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:57,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:04:57,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:57,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:04:57,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:04:57,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 276 [2025-03-17 11:04:57,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 446 transitions, 2242 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:57,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:57,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 276 [2025-03-17 11:04:57,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:57,385 INFO L124 PetriNetUnfolderBase]: 306/1958 cut-off events. [2025-03-17 11:04:57,386 INFO L125 PetriNetUnfolderBase]: For 1135/1200 co-relation queries the response was YES. [2025-03-17 11:04:57,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 1958 events. 306/1958 cut-off events. For 1135/1200 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 13432 event pairs, 31 based on Foata normal form. 4/1886 useless extension candidates. Maximal degree in co-relation 4014. Up to 312 conditions per place. [2025-03-17 11:04:57,396 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 10 selfloop transitions, 6 changer transitions 0/386 dead transitions. [2025-03-17 11:04:57,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 386 transitions, 1710 flow [2025-03-17 11:04:57,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:04:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:04:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2025-03-17 11:04:57,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9855072463768116 [2025-03-17 11:04:57,398 INFO L175 Difference]: Start difference. First operand has 290 places, 446 transitions, 2242 flow. Second operand 3 states and 816 transitions. [2025-03-17 11:04:57,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 386 transitions, 1710 flow [2025-03-17 11:04:57,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 386 transitions, 1622 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-03-17 11:04:57,415 INFO L231 Difference]: Finished difference. Result has 293 places, 384 transitions, 1612 flow [2025-03-17 11:04:57,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1612, PETRI_PLACES=293, PETRI_TRANSITIONS=384} [2025-03-17 11:04:57,416 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 14 predicate places. [2025-03-17 11:04:57,417 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 384 transitions, 1612 flow [2025-03-17 11:04:57,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:57,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:57,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:57,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:04:57,417 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:57,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:57,418 INFO L85 PathProgramCache]: Analyzing trace with hash -496298289, now seen corresponding path program 1 times [2025-03-17 11:04:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:57,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819789212] [2025-03-17 11:04:57,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:57,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-17 11:04:57,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-17 11:04:57,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:57,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:57,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:04:57,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:57,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819789212] [2025-03-17 11:04:57,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819789212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:57,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:57,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:57,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602394550] [2025-03-17 11:04:57,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:57,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:57,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:57,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:57,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:58,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 276 [2025-03-17 11:04:58,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 384 transitions, 1612 flow. Second operand has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:58,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:58,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 276 [2025-03-17 11:04:58,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:04:58,634 INFO L124 PetriNetUnfolderBase]: 695/3124 cut-off events. [2025-03-17 11:04:58,635 INFO L125 PetriNetUnfolderBase]: For 3027/3227 co-relation queries the response was YES. [2025-03-17 11:04:58,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7481 conditions, 3124 events. 695/3124 cut-off events. For 3027/3227 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 24005 event pairs, 52 based on Foata normal form. 20/3033 useless extension candidates. Maximal degree in co-relation 7398. Up to 741 conditions per place. [2025-03-17 11:04:58,653 INFO L140 encePairwiseOnDemand]: 257/276 looper letters, 184 selfloop transitions, 124 changer transitions 4/542 dead transitions. [2025-03-17 11:04:58,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 542 transitions, 3203 flow [2025-03-17 11:04:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:04:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:04:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1430 transitions. [2025-03-17 11:04:58,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8635265700483091 [2025-03-17 11:04:58,656 INFO L175 Difference]: Start difference. First operand has 293 places, 384 transitions, 1612 flow. Second operand 6 states and 1430 transitions. [2025-03-17 11:04:58,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 542 transitions, 3203 flow [2025-03-17 11:04:58,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 542 transitions, 3180 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:04:58,674 INFO L231 Difference]: Finished difference. Result has 301 places, 486 transitions, 2988 flow [2025-03-17 11:04:58,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2988, PETRI_PLACES=301, PETRI_TRANSITIONS=486} [2025-03-17 11:04:58,677 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 22 predicate places. [2025-03-17 11:04:58,677 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 486 transitions, 2988 flow [2025-03-17 11:04:58,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:58,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:58,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:04:58,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:04:58,678 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:04:58,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1049454800, now seen corresponding path program 1 times [2025-03-17 11:04:58,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:58,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774967144] [2025-03-17 11:04:58,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:04:58,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:58,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 11:04:58,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 11:04:58,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:04:58,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:04:59,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:59,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774967144] [2025-03-17 11:04:59,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774967144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:59,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:59,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:04:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164575620] [2025-03-17 11:04:59,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:59,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:04:59,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:59,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:04:59,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:04:59,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 276 [2025-03-17 11:04:59,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 486 transitions, 2988 flow. Second operand has 6 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:59,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:59,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 276 [2025-03-17 11:04:59,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:00,004 INFO L124 PetriNetUnfolderBase]: 608/2916 cut-off events. [2025-03-17 11:05:00,005 INFO L125 PetriNetUnfolderBase]: For 5476/5690 co-relation queries the response was YES. [2025-03-17 11:05:00,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7892 conditions, 2916 events. 608/2916 cut-off events. For 5476/5690 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 22130 event pairs, 92 based on Foata normal form. 18/2878 useless extension candidates. Maximal degree in co-relation 7806. Up to 810 conditions per place. [2025-03-17 11:05:00,019 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 218 selfloop transitions, 17 changer transitions 0/501 dead transitions. [2025-03-17 11:05:00,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 501 transitions, 3512 flow [2025-03-17 11:05:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2025-03-17 11:05:00,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2025-03-17 11:05:00,023 INFO L175 Difference]: Start difference. First operand has 301 places, 486 transitions, 2988 flow. Second operand 6 states and 1382 transitions. [2025-03-17 11:05:00,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 501 transitions, 3512 flow [2025-03-17 11:05:00,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 501 transitions, 3494 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-17 11:05:00,041 INFO L231 Difference]: Finished difference. Result has 305 places, 485 transitions, 3002 flow [2025-03-17 11:05:00,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3002, PETRI_PLACES=305, PETRI_TRANSITIONS=485} [2025-03-17 11:05:00,043 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 26 predicate places. [2025-03-17 11:05:00,043 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 485 transitions, 3002 flow [2025-03-17 11:05:00,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:00,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:00,043 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:00,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:05:00,044 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:05:00,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:00,044 INFO L85 PathProgramCache]: Analyzing trace with hash 727007188, now seen corresponding path program 1 times [2025-03-17 11:05:00,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:00,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214114067] [2025-03-17 11:05:00,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:00,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:00,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 11:05:00,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 11:05:00,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:00,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:05:00,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:00,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214114067] [2025-03-17 11:05:00,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214114067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:00,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:00,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:00,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121457902] [2025-03-17 11:05:00,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:00,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:00,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:00,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:00,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:00,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2025-03-17 11:05:00,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 485 transitions, 3002 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:00,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:00,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2025-03-17 11:05:00,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:01,204 INFO L124 PetriNetUnfolderBase]: 1547/5155 cut-off events. [2025-03-17 11:05:01,205 INFO L125 PetriNetUnfolderBase]: For 7547/7627 co-relation queries the response was YES. [2025-03-17 11:05:01,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15130 conditions, 5155 events. 1547/5155 cut-off events. For 7547/7627 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 41275 event pairs, 582 based on Foata normal form. 1/5002 useless extension candidates. Maximal degree in co-relation 15043. Up to 2881 conditions per place. [2025-03-17 11:05:01,232 INFO L140 encePairwiseOnDemand]: 253/276 looper letters, 304 selfloop transitions, 103 changer transitions 8/591 dead transitions. [2025-03-17 11:05:01,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 591 transitions, 4442 flow [2025-03-17 11:05:01,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1302 transitions. [2025-03-17 11:05:01,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7862318840579711 [2025-03-17 11:05:01,234 INFO L175 Difference]: Start difference. First operand has 305 places, 485 transitions, 3002 flow. Second operand 6 states and 1302 transitions. [2025-03-17 11:05:01,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 591 transitions, 4442 flow [2025-03-17 11:05:01,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 591 transitions, 4408 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:01,261 INFO L231 Difference]: Finished difference. Result has 310 places, 571 transitions, 3986 flow [2025-03-17 11:05:01,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3986, PETRI_PLACES=310, PETRI_TRANSITIONS=571} [2025-03-17 11:05:01,262 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 31 predicate places. [2025-03-17 11:05:01,262 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 571 transitions, 3986 flow [2025-03-17 11:05:01,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:01,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:01,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:01,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:05:01,263 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:05:01,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash -839721339, now seen corresponding path program 1 times [2025-03-17 11:05:01,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:01,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826689450] [2025-03-17 11:05:01,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:01,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:01,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 11:05:01,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 11:05:01,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:01,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:05:02,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:02,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826689450] [2025-03-17 11:05:02,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826689450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:02,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407080024] [2025-03-17 11:05:02,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:02,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:02,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:02,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:05:02,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:05:02,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 11:05:02,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 11:05:02,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:02,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:02,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 11:05:02,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:02,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-17 11:05:02,505 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:05:02,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 11:05:02,614 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 19 treesize of output 1 [2025-03-17 11:05:02,654 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-03-17 11:05:02,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-03-17 11:05:02,718 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 14 [2025-03-17 11:05:02,755 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 14 [2025-03-17 11:05:02,790 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 14 [2025-03-17 11:05:02,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2025-03-17 11:05:02,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:05:02,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 11:05:02,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:02,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-17 11:05:02,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:02,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-17 11:05:02,995 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 43 treesize of output 32 [2025-03-17 11:05:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:05:03,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:03,023 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ 2 |c_t_funThread1of1ForFork0_#t~mem33.offset|)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset|) |c_t_funThread1of1ForFork0_#t~nondet36|))) is different from false [2025-03-17 11:05:03,037 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet36|)))) (and (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset|) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse1) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ 2 |c_t_funThread1of1ForFork0_#t~mem33.offset|)) |c_t_funThread1of1ForFork0_#t~nondet36|))))) is different from false [2025-03-17 11:05:03,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_t_funThread1of1ForFork0_#t~mem33.offset|)) (.cse1 (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse2 |c_t_funThread1of1ForFork0_#t~nondet36|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet36|)))) (and (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset|) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse1) |c_t_funThread1of1ForFork0_#t~nondet36|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse2) |c_t_funThread1of1ForFork0_#t~nondet36|))))) is different from false [2025-03-17 11:05:05,145 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2014 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2014) c_~B~0.base v_ArrVal_2015) c_~A~0.base) (+ c_~A~0.offset 4)) c_~B~0.base))) is different from false [2025-03-17 11:05:05,168 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2015 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~malloc48#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_ArrVal_2015) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2025-03-17 11:05:05,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:05,249 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-03-17 11:05:05,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-17 11:05:05,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-17 11:05:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:05:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407080024] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:05,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:05,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 32 [2025-03-17 11:05:05,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972565275] [2025-03-17 11:05:05,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:05,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 11:05:05,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:05,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 11:05:05,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=644, Unknown=24, NotChecked=280, Total=1056 [2025-03-17 11:05:05,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 276 [2025-03-17 11:05:05,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 571 transitions, 3986 flow. Second operand has 33 states, 33 states have (on average 112.12121212121212) internal successors, (3700), 33 states have internal predecessors, (3700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:05,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:05,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 276 [2025-03-17 11:05:05,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:08,132 INFO L124 PetriNetUnfolderBase]: 2472/6988 cut-off events. [2025-03-17 11:05:08,132 INFO L125 PetriNetUnfolderBase]: For 12295/12320 co-relation queries the response was YES. [2025-03-17 11:05:08,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23213 conditions, 6988 events. 2472/6988 cut-off events. For 12295/12320 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 55476 event pairs, 326 based on Foata normal form. 19/6950 useless extension candidates. Maximal degree in co-relation 23101. Up to 2994 conditions per place. [2025-03-17 11:05:08,169 INFO L140 encePairwiseOnDemand]: 245/276 looper letters, 619 selfloop transitions, 101 changer transitions 28/843 dead transitions. [2025-03-17 11:05:08,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 843 transitions, 7364 flow [2025-03-17 11:05:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 11:05:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-17 11:05:08,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3295 transitions. [2025-03-17 11:05:08,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.426371635610766 [2025-03-17 11:05:08,176 INFO L175 Difference]: Start difference. First operand has 310 places, 571 transitions, 3986 flow. Second operand 28 states and 3295 transitions. [2025-03-17 11:05:08,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 843 transitions, 7364 flow [2025-03-17 11:05:08,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 843 transitions, 7160 flow, removed 102 selfloop flow, removed 0 redundant places. [2025-03-17 11:05:08,237 INFO L231 Difference]: Finished difference. Result has 347 places, 607 transitions, 4466 flow [2025-03-17 11:05:08,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=3838, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4466, PETRI_PLACES=347, PETRI_TRANSITIONS=607} [2025-03-17 11:05:08,238 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 68 predicate places. [2025-03-17 11:05:08,238 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 607 transitions, 4466 flow [2025-03-17 11:05:08,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 112.12121212121212) internal successors, (3700), 33 states have internal predecessors, (3700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:08,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:08,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:08,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:05:08,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 11:05:08,444 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:05:08,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash -176498741, now seen corresponding path program 1 times [2025-03-17 11:05:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:08,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305669956] [2025-03-17 11:05:08,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:08,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:08,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 11:05:08,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 11:05:08,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:08,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:05:09,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:09,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305669956] [2025-03-17 11:05:09,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305669956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:09,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823115236] [2025-03-17 11:05:09,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:09,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:09,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:09,683 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:05:09,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:05:09,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 11:05:09,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 11:05:09,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:09,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:09,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 11:05:09,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:09,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-17 11:05:09,943 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:05:09,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 11:05:10,047 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 19 treesize of output 1 [2025-03-17 11:05:10,080 INFO L349 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-03-17 11:05:10,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-03-17 11:05:10,179 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 14 [2025-03-17 11:05:10,224 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 14 [2025-03-17 11:05:10,258 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 14 [2025-03-17 11:05:10,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:05:10,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-17 11:05:10,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:10,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-17 11:05:10,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:10,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-17 11:05:10,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2025-03-17 11:05:10,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-17 11:05:10,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-17 11:05:10,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-17 11:05:10,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-17 11:05:10,558 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 45 treesize of output 34 [2025-03-17 11:05:10,579 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 45 treesize of output 34 [2025-03-17 11:05:10,589 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 45 treesize of output 34 [2025-03-17 11:05:10,598 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 45 treesize of output 34 [2025-03-17 11:05:10,635 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 45 treesize of output 34 [2025-03-17 11:05:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:05:10,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:10,656 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2390 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2390) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2390) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2390) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))) is different from false [2025-03-17 11:05:10,819 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) .cse0 v_ArrVal_2390) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) .cse0 v_ArrVal_2390) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) .cse0 v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2385) .cse0 v_ArrVal_2390) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)))) is different from false [2025-03-17 11:05:10,865 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))))) is different from false [2025-03-17 11:05:10,878 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse3 0) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))))) is different from false [2025-03-17 11:05:10,891 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 c_~B~0.offset)) (.cse3 (+ 6 c_~B~0.offset)) (.cse4 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse2 0) .cse3 0) .cse4 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) .cse4) 0)) (forall ((v_ArrVal_2390 (Array Int Int)) (v_ArrVal_2385 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2385) .cse1 v_ArrVal_2390) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))))) is different from false [2025-03-17 11:05:10,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:10,903 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 62 [2025-03-17 11:05:10,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:10,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 206 treesize of output 170 [2025-03-17 11:05:10,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-03-17 11:05:10,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2025-03-17 11:05:10,939 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:10,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-03-17 11:05:10,945 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:10,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-03-17 11:05:10,951 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:10,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-03-17 11:05:11,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:05:11,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823115236] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:11,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:11,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 33 [2025-03-17 11:05:11,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43942087] [2025-03-17 11:05:11,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:11,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 11:05:11,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:11,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 11:05:11,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=713, Unknown=17, NotChecked=290, Total=1122 [2025-03-17 11:05:11,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2025-03-17 11:05:11,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 607 transitions, 4466 flow. Second operand has 34 states, 34 states have (on average 113.3529411764706) internal successors, (3854), 34 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:11,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:11,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2025-03-17 11:05:11,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:14,762 INFO L124 PetriNetUnfolderBase]: 2857/8047 cut-off events. [2025-03-17 11:05:14,762 INFO L125 PetriNetUnfolderBase]: For 18529/18536 co-relation queries the response was YES. [2025-03-17 11:05:14,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28440 conditions, 8047 events. 2857/8047 cut-off events. For 18529/18536 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 66428 event pairs, 385 based on Foata normal form. 12/7976 useless extension candidates. Maximal degree in co-relation 28311. Up to 2077 conditions per place. [2025-03-17 11:05:14,809 INFO L140 encePairwiseOnDemand]: 240/276 looper letters, 775 selfloop transitions, 150 changer transitions 24/1046 dead transitions. [2025-03-17 11:05:14,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 1046 transitions, 9554 flow [2025-03-17 11:05:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 11:05:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-17 11:05:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3218 transitions. [2025-03-17 11:05:14,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4484392419175028 [2025-03-17 11:05:14,812 INFO L175 Difference]: Start difference. First operand has 347 places, 607 transitions, 4466 flow. Second operand 26 states and 3218 transitions. [2025-03-17 11:05:14,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 1046 transitions, 9554 flow [2025-03-17 11:05:14,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 1046 transitions, 9430 flow, removed 51 selfloop flow, removed 10 redundant places. [2025-03-17 11:05:14,897 INFO L231 Difference]: Finished difference. Result has 373 places, 683 transitions, 5852 flow [2025-03-17 11:05:14,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=4384, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5852, PETRI_PLACES=373, PETRI_TRANSITIONS=683} [2025-03-17 11:05:14,898 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 94 predicate places. [2025-03-17 11:05:14,898 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 683 transitions, 5852 flow [2025-03-17 11:05:14,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 113.3529411764706) internal successors, (3854), 34 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:14,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:14,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:14,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:05:15,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 11:05:15,100 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:05:15,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:15,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1799295161, now seen corresponding path program 2 times [2025-03-17 11:05:15,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:15,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798336898] [2025-03-17 11:05:15,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:05:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:15,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-17 11:05:15,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 11:05:15,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:05:15,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:05:15,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:15,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798336898] [2025-03-17 11:05:15,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798336898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:15,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329279320] [2025-03-17 11:05:15,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:05:15,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:15,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:15,943 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:05:15,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:05:16,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-17 11:05:17,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 11:05:17,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:05:17,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:17,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-17 11:05:17,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:17,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:05:17,932 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:05:17,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 11:05:18,027 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:05:18,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-03-17 11:05:18,131 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-17 11:05:18,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2025-03-17 11:05:18,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 11:05:18,403 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 11:05:18,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 11:05:18,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:05:18,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 23 treesize of output 11 [2025-03-17 11:05:18,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-17 11:05:18,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:18,526 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 26 treesize of output 28 [2025-03-17 11:05:18,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:18,559 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 33 treesize of output 38 [2025-03-17 11:05:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:05:18,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:18,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2025-03-17 11:05:27,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:27,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-03-17 11:05:27,064 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~B~0.base Int)) (let ((.cse0 (+ 4 c_~B~0.offset))) (or (not (= .cse0 (select (select (store |c_#memory_$Pointer$.offset| ~B~0.base v_arrayElimArr_6) c_~A~0.base) (+ c_~A~0.offset 4)))) (not (= |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_6 .cse0)))))) is different from false [2025-03-17 11:05:27,109 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~B~0.base Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| ~B~0.base v_arrayElimArr_6) c_~A~0.base) (+ c_~A~0.offset 4)))) (or (not (= (select v_arrayElimArr_6 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= .cse0 (+ 4 |c_ULTIMATE.start_main_#t~malloc48#1.offset|)))))) is different from false [2025-03-17 11:05:27,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:27,205 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-03-17 11:05:27,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-17 11:05:27,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:27,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2025-03-17 11:05:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:05:27,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329279320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:27,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:27,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 19] total 50 [2025-03-17 11:05:27,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303206043] [2025-03-17 11:05:27,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:27,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-17 11:05:27,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:27,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-17 11:05:27,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2107, Unknown=13, NotChecked=190, Total=2550 [2025-03-17 11:05:27,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2025-03-17 11:05:27,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 683 transitions, 5852 flow. Second operand has 51 states, 51 states have (on average 113.23529411764706) internal successors, (5775), 51 states have internal predecessors, (5775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:27,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:27,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2025-03-17 11:05:27,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:33,408 INFO L124 PetriNetUnfolderBase]: 3158/8826 cut-off events. [2025-03-17 11:05:33,408 INFO L125 PetriNetUnfolderBase]: For 25769/25802 co-relation queries the response was YES. [2025-03-17 11:05:33,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33433 conditions, 8826 events. 3158/8826 cut-off events. For 25769/25802 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 75049 event pairs, 344 based on Foata normal form. 17/8764 useless extension candidates. Maximal degree in co-relation 33291. Up to 1259 conditions per place. [2025-03-17 11:05:33,458 INFO L140 encePairwiseOnDemand]: 236/276 looper letters, 816 selfloop transitions, 280 changer transitions 31/1224 dead transitions. [2025-03-17 11:05:33,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 1224 transitions, 11833 flow [2025-03-17 11:05:33,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-17 11:05:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-03-17 11:05:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 5181 transitions. [2025-03-17 11:05:33,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4365520728008089 [2025-03-17 11:05:33,464 INFO L175 Difference]: Start difference. First operand has 373 places, 683 transitions, 5852 flow. Second operand 43 states and 5181 transitions. [2025-03-17 11:05:33,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 1224 transitions, 11833 flow [2025-03-17 11:05:33,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 1224 transitions, 11781 flow, removed 14 selfloop flow, removed 11 redundant places. [2025-03-17 11:05:33,595 INFO L231 Difference]: Finished difference. Result has 420 places, 794 transitions, 7830 flow [2025-03-17 11:05:33,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=5814, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=7830, PETRI_PLACES=420, PETRI_TRANSITIONS=794} [2025-03-17 11:05:33,596 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 141 predicate places. [2025-03-17 11:05:33,596 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 794 transitions, 7830 flow [2025-03-17 11:05:33,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 113.23529411764706) internal successors, (5775), 51 states have internal predecessors, (5775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:33,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:33,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:33,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:05:33,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:33,802 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:05:33,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:33,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1305573717, now seen corresponding path program 1 times [2025-03-17 11:05:33,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:33,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97338912] [2025-03-17 11:05:33,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:33,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:33,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-17 11:05:33,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-17 11:05:33,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:33,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:05:35,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:35,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97338912] [2025-03-17 11:05:35,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97338912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:35,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765203216] [2025-03-17 11:05:35,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:35,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:35,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:35,418 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:05:35,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:05:35,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-17 11:05:35,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-17 11:05:35,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:35,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:35,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-17 11:05:35,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:35,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-17 11:05:35,724 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 11:05:35,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 11:05:35,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:05:35,955 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 11:05:35,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 11:05:36,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 11:05:36,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 11:05:36,244 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 40 treesize of output 27 [2025-03-17 11:05:36,488 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-17 11:05:36,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 56 [2025-03-17 11:05:36,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2025-03-17 11:05:36,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:05:36,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-17 11:05:36,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:36,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-17 11:05:36,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:36,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-17 11:05:36,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-17 11:05:36,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-17 11:05:36,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-17 11:05:36,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-17 11:05:36,851 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 45 treesize of output 34 [2025-03-17 11:05:36,862 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 45 treesize of output 34 [2025-03-17 11:05:36,876 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 45 treesize of output 34 [2025-03-17 11:05:36,888 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 45 treesize of output 34 [2025-03-17 11:05:36,926 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 45 treesize of output 34 [2025-03-17 11:05:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:05:36,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:37,090 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~B~0.base v_ArrVal_3148) |c_t_funThread1of1ForFork0_#t~mem39.base| v_ArrVal_3153) c_~A~0.base) (+ c_~A~0.offset 6)))) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base v_ArrVal_3148) |c_t_funThread1of1ForFork0_#t~mem39.base| v_ArrVal_3153) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base v_ArrVal_3148) |c_t_funThread1of1ForFork0_#t~mem39.base| v_ArrVal_3153) c_~A~0.base) (+ c_~A~0.offset 7)) 0)) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (= (select (select (store (store |c_#race| c_~B~0.base v_ArrVal_3148) |c_t_funThread1of1ForFork0_#t~mem39.base| v_ArrVal_3153) c_~A~0.base) (+ c_~A~0.offset 5)) 0))) is different from false [2025-03-17 11:05:37,123 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (= 0 (select (select (store (store .cse0 c_~B~0.base v_ArrVal_3148) |c_t_funThread1of1ForFork0_#t~mem39.base| v_ArrVal_3153) c_~A~0.base) (+ c_~A~0.offset 6)))) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_3148) |c_t_funThread1of1ForFork0_#t~mem39.base| v_ArrVal_3153) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_3148) |c_t_funThread1of1ForFork0_#t~mem39.base| v_ArrVal_3153) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_3148) |c_t_funThread1of1ForFork0_#t~mem39.base| v_ArrVal_3153) c_~A~0.base) (+ c_~A~0.offset 5)) 0))))) is different from false [2025-03-17 11:05:37,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 6)) (.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_3148) |c_t_funThread1of1ForFork0_#t~mem39.base| v_ArrVal_3153) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_3148) |c_t_funThread1of1ForFork0_#t~mem39.base| v_ArrVal_3153) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_3148) |c_t_funThread1of1ForFork0_#t~mem39.base| v_ArrVal_3153) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_3153 (Array Int Int)) (v_ArrVal_3148 (Array Int Int))) (= (select (select (store (store .cse0 c_~B~0.base v_ArrVal_3148) |c_t_funThread1of1ForFork0_#t~mem39.base| v_ArrVal_3153) c_~A~0.base) (+ c_~A~0.offset 4)) 0))))) is different from false [2025-03-17 11:05:37,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:37,239 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56 [2025-03-17 11:05:37,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:37,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 70 [2025-03-17 11:05:37,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2025-03-17 11:05:37,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2025-03-17 11:05:37,260 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:37,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1 [2025-03-17 11:05:37,267 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:37,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1 [2025-03-17 11:05:37,271 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:37,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1 [2025-03-17 11:05:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:05:38,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765203216] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:38,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:38,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 20] total 48 [2025-03-17 11:05:38,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001583621] [2025-03-17 11:05:38,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:38,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-17 11:05:38,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:38,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-17 11:05:38,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1824, Unknown=62, NotChecked=270, Total=2352 [2025-03-17 11:05:38,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 276 [2025-03-17 11:05:38,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 794 transitions, 7830 flow. Second operand has 49 states, 49 states have (on average 112.0204081632653) internal successors, (5489), 49 states have internal predecessors, (5489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:38,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:38,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 276 [2025-03-17 11:05:38,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:42,991 INFO L124 PetriNetUnfolderBase]: 3256/8744 cut-off events. [2025-03-17 11:05:42,991 INFO L125 PetriNetUnfolderBase]: For 33673/33704 co-relation queries the response was YES. [2025-03-17 11:05:43,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36268 conditions, 8744 events. 3256/8744 cut-off events. For 33673/33704 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 72488 event pairs, 644 based on Foata normal form. 13/8679 useless extension candidates. Maximal degree in co-relation 36106. Up to 3619 conditions per place. [2025-03-17 11:05:43,066 INFO L140 encePairwiseOnDemand]: 249/276 looper letters, 755 selfloop transitions, 54 changer transitions 40/953 dead transitions. [2025-03-17 11:05:43,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 953 transitions, 10842 flow [2025-03-17 11:05:43,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 11:05:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-17 11:05:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2804 transitions. [2025-03-17 11:05:43,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42330917874396135 [2025-03-17 11:05:43,069 INFO L175 Difference]: Start difference. First operand has 420 places, 794 transitions, 7830 flow. Second operand 24 states and 2804 transitions. [2025-03-17 11:05:43,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 953 transitions, 10842 flow [2025-03-17 11:05:43,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 953 transitions, 10492 flow, removed 102 selfloop flow, removed 16 redundant places. [2025-03-17 11:05:43,253 INFO L231 Difference]: Finished difference. Result has 428 places, 796 transitions, 7649 flow [2025-03-17 11:05:43,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=7521, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=7649, PETRI_PLACES=428, PETRI_TRANSITIONS=796} [2025-03-17 11:05:43,254 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 149 predicate places. [2025-03-17 11:05:43,254 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 796 transitions, 7649 flow [2025-03-17 11:05:43,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 112.0204081632653) internal successors, (5489), 49 states have internal predecessors, (5489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:43,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:43,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:43,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:05:43,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:43,460 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:05:43,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1312792950, now seen corresponding path program 1 times [2025-03-17 11:05:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:43,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996190960] [2025-03-17 11:05:43,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:43,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:43,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-17 11:05:43,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-17 11:05:43,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:43,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:05:44,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:44,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996190960] [2025-03-17 11:05:44,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996190960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:44,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220062582] [2025-03-17 11:05:44,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:44,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:44,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:44,887 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:05:44,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:05:45,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-17 11:05:45,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-17 11:05:45,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:45,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:45,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-17 11:05:45,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:45,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-17 11:05:45,251 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 11:05:45,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 11:05:45,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:05:45,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:05:45,720 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 11:05:45,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 11:05:46,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 11:05:46,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 11:05:46,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 11:05:46,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 11:05:46,342 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 40 treesize of output 27 [2025-03-17 11:05:46,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 11:05:47,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:05:47,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:05:47,035 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 52 [2025-03-17 11:05:47,040 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 39 treesize of output 25 [2025-03-17 11:05:47,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2025-03-17 11:05:47,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 10 [2025-03-17 11:05:47,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:05:47,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 11:05:47,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-03-17 11:05:47,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-03-17 11:05:47,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2025-03-17 11:05:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:05:47,794 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:48,781 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 c_~B~0.offset))) (or (forall ((v_ArrVal_3546 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_3546) c_~B~0.base) .cse0) (+ c_~A~0.offset 1))) (forall ((v_ArrVal_3545 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_#t~mem33.base| (store (select |c_#memory_$Pointer$.base| |c_t_funThread1of1ForFork0_#t~mem33.base|) |c_t_funThread1of1ForFork0_#t~mem33.offset| v_ArrVal_3545)) c_~B~0.base) .cse0) c_~A~0.base))))) is different from false [2025-03-17 11:05:48,848 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) .cse2)) (.cse1 (+ 4 c_~B~0.offset))) (or (forall ((v_ArrVal_3546 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3546) c_~B~0.base) .cse1) (+ c_~A~0.offset 1))) (forall ((|v_t_funThread1of1ForFork0_#t~mem33.offset_45| Int) (v_ArrVal_3545 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_t_funThread1of1ForFork0_#t~mem33.offset_45| v_ArrVal_3545)) c_~B~0.base) .cse1) c_~A~0.base)) (< (select (select |c_#memory_$Pointer$.offset| c_~A~0.base) .cse2) |v_t_funThread1of1ForFork0_#t~mem33.offset_45|)))))) is different from false [2025-03-17 11:05:49,437 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_#t~mem33.offset_45| Int) (v_ArrVal_3545 Int) (v_ArrVal_3543 Int) (v_ArrVal_3546 (Array Int Int)) (v_ArrVal_3538 (Array Int Int)) (v_ArrVal_3539 (Array Int Int))) (let ((.cse2 (+ 4 c_~B~0.offset))) (let ((.cse3 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_3538))) (store .cse6 c_~B~0.base (store (select .cse6 c_~B~0.base) .cse2 |c_ULTIMATE.start_main_~p~0#1.base|)))) (.cse4 (+ c_~A~0.offset 4))) (let ((.cse1 (select (select .cse3 c_~A~0.base) .cse4)) (.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_3539))) (store .cse5 c_~B~0.base (store (select .cse5 c_~B~0.base) .cse2 v_ArrVal_3543))))) (or (< (select (select (store .cse0 .cse1 v_ArrVal_3546) c_~B~0.base) .cse2) (+ c_~A~0.offset 1)) (not (= (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) |v_t_funThread1of1ForFork0_#t~mem33.offset_45| v_ArrVal_3545)) c_~B~0.base) .cse2) c_~A~0.base)) (< |c_ULTIMATE.start_main_~p~0#1.offset| v_ArrVal_3543) (< (select (select .cse0 c_~A~0.base) .cse4) |v_t_funThread1of1ForFork0_#t~mem33.offset_45|)))))) is different from false [2025-03-17 11:05:49,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:49,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 82 [2025-03-17 11:05:49,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:49,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 47 [2025-03-17 11:05:49,852 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_#t~mem33.offset_45| Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_3545 Int) (v_ArrVal_3546 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| c_~B~0.base v_arrayElimArr_12)) (.cse3 (+ c_~A~0.offset 4))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_~B~0.base v_arrayElimArr_13)) (.cse2 (select (select .cse4 c_~A~0.base) .cse3)) (.cse0 (+ 4 c_~B~0.offset))) (or (< |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_13 .cse0)) (< (select (select (store .cse1 .cse2 v_ArrVal_3546) c_~B~0.base) .cse0) (+ c_~A~0.offset 1)) (< (select (select .cse1 c_~A~0.base) .cse3) |v_t_funThread1of1ForFork0_#t~mem33.offset_45|) (not (= |c_ULTIMATE.start_main_~p~0#1.base| (select v_arrayElimArr_12 .cse0))) (not (= c_~A~0.base (select (select (store .cse4 .cse2 (store (select .cse4 .cse2) |v_t_funThread1of1ForFork0_#t~mem33.offset_45| v_ArrVal_3545)) c_~B~0.base) .cse0))))))) is different from false [2025-03-17 11:05:50,010 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_#t~mem33.offset_45| Int) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_~B~0.offset_29 Int) (v_ArrVal_3545 Int) (v_ArrVal_3546 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_arrayElimArr_12)) (.cse4 (+ c_~A~0.offset 4))) (let ((.cse1 (select (select .cse3 c_~A~0.base) .cse4)) (.cse2 (+ v_~B~0.offset_29 4)) (.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc48#1.base| v_arrayElimArr_13))) (or (< (select (select (store .cse0 .cse1 v_ArrVal_3546) |c_ULTIMATE.start_main_#t~malloc48#1.base|) .cse2) (+ c_~A~0.offset 1)) (< |c_ULTIMATE.start_main_~p~0#1.offset| (select v_arrayElimArr_13 .cse2)) (not (= (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) |v_t_funThread1of1ForFork0_#t~mem33.offset_45| v_ArrVal_3545)) |c_ULTIMATE.start_main_#t~malloc48#1.base|) .cse2) c_~A~0.base)) (not (= (select v_arrayElimArr_12 .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (< (select (select .cse0 c_~A~0.base) .cse4) |v_t_funThread1of1ForFork0_#t~mem33.offset_45|) (< v_~B~0.offset_29 |c_ULTIMATE.start_main_#t~malloc48#1.offset|))))) is different from false [2025-03-17 11:05:50,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:50,394 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 59 [2025-03-17 11:05:50,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:50,401 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 79 [2025-03-17 11:05:50,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:50,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 310 treesize of output 320 [2025-03-17 11:05:50,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:50,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 254 [2025-03-17 11:05:50,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 88 [2025-03-17 11:05:50,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:50,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2025-03-17 11:05:50,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2025-03-17 11:05:50,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2025-03-17 11:05:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 17 not checked. [2025-03-17 11:05:52,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220062582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:52,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:52,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 57 [2025-03-17 11:05:52,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404074948] [2025-03-17 11:05:52,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:52,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-17 11:05:52,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:52,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-17 11:05:52,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2516, Unknown=10, NotChecked=530, Total=3306 [2025-03-17 11:05:52,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 276 [2025-03-17 11:05:52,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 796 transitions, 7649 flow. Second operand has 58 states, 58 states have (on average 110.13793103448276) internal successors, (6388), 58 states have internal predecessors, (6388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:05:52,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:52,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 276 [2025-03-17 11:05:52,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:00,873 INFO L124 PetriNetUnfolderBase]: 3533/9261 cut-off events. [2025-03-17 11:06:00,873 INFO L125 PetriNetUnfolderBase]: For 34789/34821 co-relation queries the response was YES. [2025-03-17 11:06:00,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38603 conditions, 9261 events. 3533/9261 cut-off events. For 34789/34821 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 76421 event pairs, 692 based on Foata normal form. 61/9247 useless extension candidates. Maximal degree in co-relation 38439. Up to 2774 conditions per place. [2025-03-17 11:06:00,954 INFO L140 encePairwiseOnDemand]: 238/276 looper letters, 797 selfloop transitions, 226 changer transitions 45/1170 dead transitions. [2025-03-17 11:06:00,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 1170 transitions, 13158 flow [2025-03-17 11:06:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 11:06:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 11:06:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3514 transitions. [2025-03-17 11:06:00,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42439613526570047 [2025-03-17 11:06:00,957 INFO L175 Difference]: Start difference. First operand has 428 places, 796 transitions, 7649 flow. Second operand 30 states and 3514 transitions. [2025-03-17 11:06:00,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 1170 transitions, 13158 flow [2025-03-17 11:06:01,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 1170 transitions, 13107 flow, removed 7 selfloop flow, removed 15 redundant places. [2025-03-17 11:06:01,205 INFO L231 Difference]: Finished difference. Result has 448 places, 879 transitions, 9626 flow [2025-03-17 11:06:01,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=7608, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=9626, PETRI_PLACES=448, PETRI_TRANSITIONS=879} [2025-03-17 11:06:01,206 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 169 predicate places. [2025-03-17 11:06:01,206 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 879 transitions, 9626 flow [2025-03-17 11:06:01,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 110.13793103448276) internal successors, (6388), 58 states have internal predecessors, (6388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:06:01,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:01,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:01,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 11:06:01,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:01,408 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-03-17 11:06:01,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1245228076, now seen corresponding path program 1 times [2025-03-17 11:06:01,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:01,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944334722] [2025-03-17 11:06:01,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:01,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:01,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 11:06:01,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 11:06:01,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:01,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:06:01,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:06:01,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 11:06:01,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 11:06:01,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:01,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:06:01,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:06:01,571 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:06:01,572 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 37 remaining) [2025-03-17 11:06:01,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (35 of 37 remaining) [2025-03-17 11:06:01,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (34 of 37 remaining) [2025-03-17 11:06:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (33 of 37 remaining) [2025-03-17 11:06:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (32 of 37 remaining) [2025-03-17 11:06:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (31 of 37 remaining) [2025-03-17 11:06:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (30 of 37 remaining) [2025-03-17 11:06:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (29 of 37 remaining) [2025-03-17 11:06:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (28 of 37 remaining) [2025-03-17 11:06:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (27 of 37 remaining) [2025-03-17 11:06:01,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (26 of 37 remaining) [2025-03-17 11:06:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (25 of 37 remaining) [2025-03-17 11:06:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 37 remaining) [2025-03-17 11:06:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (23 of 37 remaining) [2025-03-17 11:06:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (22 of 37 remaining) [2025-03-17 11:06:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (21 of 37 remaining) [2025-03-17 11:06:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 37 remaining) [2025-03-17 11:06:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 37 remaining) [2025-03-17 11:06:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 37 remaining) [2025-03-17 11:06:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 37 remaining) [2025-03-17 11:06:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 37 remaining) [2025-03-17 11:06:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (15 of 37 remaining) [2025-03-17 11:06:01,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (14 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (13 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (12 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (7 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (6 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 37 remaining) [2025-03-17 11:06:01,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 37 remaining) [2025-03-17 11:06:01,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:06:01,577 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:01,659 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:06:01,659 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:06:01,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:06:01 BasicIcfg [2025-03-17 11:06:01,666 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:06:01,666 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:06:01,666 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:06:01,666 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:06:01,667 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:04:46" (3/4) ... [2025-03-17 11:06:01,668 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 11:06:01,759 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 7. [2025-03-17 11:06:01,792 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:06:01,792 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:06:01,792 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:06:01,793 INFO L158 Benchmark]: Toolchain (without parser) took 76370.92ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 103.2MB in the beginning and 787.4MB in the end (delta: -684.3MB). Peak memory consumption was 341.1MB. Max. memory is 16.1GB. [2025-03-17 11:06:01,793 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:06:01,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 641.20ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 64.3MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 11:06:01,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.33ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 61.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:06:01,793 INFO L158 Benchmark]: Boogie Preprocessor took 37.52ms. Allocated memory is still 142.6MB. Free memory was 61.2MB in the beginning and 58.0MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:06:01,793 INFO L158 Benchmark]: IcfgBuilder took 749.51ms. Allocated memory is still 142.6MB. Free memory was 58.0MB in the beginning and 93.1MB in the end (delta: -35.1MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2025-03-17 11:06:01,795 INFO L158 Benchmark]: TraceAbstraction took 74756.14ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 92.3MB in the beginning and 812.6MB in the end (delta: -720.3MB). Peak memory consumption was 300.5MB. Max. memory is 16.1GB. [2025-03-17 11:06:01,795 INFO L158 Benchmark]: Witness Printer took 126.18ms. Allocated memory is still 1.2GB. Free memory was 812.6MB in the beginning and 787.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 11:06:01,797 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 641.20ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 64.3MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.33ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 61.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.52ms. Allocated memory is still 142.6MB. Free memory was 61.2MB in the beginning and 58.0MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 749.51ms. Allocated memory is still 142.6MB. Free memory was 58.0MB in the beginning and 93.1MB in the end (delta: -35.1MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * TraceAbstraction took 74756.14ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 92.3MB in the beginning and 812.6MB in the end (delta: -720.3MB). Peak memory consumption was 300.5MB. Max. memory is 16.1GB. * Witness Printer took 126.18ms. Allocated memory is still 1.2GB. Free memory was 812.6MB in the beginning and 787.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1259]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={1:0}, B={0:0}] [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1243] 0 pthread_t t1; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1244] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-2:0}] [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(p)={-2:0}, \old(x)=9, p={-2:0}, x=9] [L1229] 0 p -> next = ((void *)0) VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(p)={-2:0}, \old(x)=9, p={-2:0}, x=9] [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) VAL [A={-3:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-2:0}] [L1247] 0 init(A,3) VAL [A={-3:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-2:0}] [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(p)={-3:0}, \old(x)=3, p={-3:0}, x=3] [L1229] 0 p -> next = ((void *)0) VAL [A={-3:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(p)={-3:0}, \old(x)=3, p={-3:0}, x=3] [L1247] RET 0 init(A,3) [L1248] EXPR 0 A->next VAL [A={-3:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-2:0}] [L1248] 0 A->next = p VAL [A={-3:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, p={-2:0}] [L1249] 0 B = malloc(sizeof(struct s)) VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, p={-2:0}] [L1250] 0 init(B,5) VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, p={-2:0}] [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(p)={-4:0}, \old(x)=5, p={-4:0}, x=5] [L1229] 0 p -> next = ((void *)0) VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(p)={-4:0}, \old(x)=5, p={-4:0}, x=5] [L1250] RET 0 init(B,5) [L1251] EXPR 0 B->next VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, p={-2:0}] [L1251] 0 B->next = p VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, p={-2:0}] [L1252] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, p={-2:0}, t1=-1] [L1254] EXPR 0 A->next VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, p={-2:0}, t1=-1] [L1254] 0 p = A->next VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, p={-2:0}, t1=-1] [L1255] EXPR 0 p->datum VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, p={-2:0}, t1=-1] [L1255] 0 printf("%d\n", p->datum) VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, p={-2:0}, t1=-1] [L1258] EXPR 0 B->next VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, p={-2:0}, t1=-1] [L1235] EXPR 1 A->next VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1235] EXPR 1 A->next->datum VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, p={-2:0}, t1=-1] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, p={-2:0}, t1=-1] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, p={-2:0}, t1=-1] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, p={-2:0}, t1=-1] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, p={-2:0}, t1=-1] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1258] 0 p = B->next VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, p={-2:0}, t1=-1] [L1259] EXPR 0 p->datum VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, p={-2:0}, t1=-1] [L1235] 1 A->next->datum++ VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1259] 0 printf("%d\n", p->datum) VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, p={-2:0}, t1=-1] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: p -> datum = x [1228] * C: p -> datum = x [1228] * C: p -> next = ((void *)0) [1229] * C: B->next = p [1251] * C: B->next = p [1251] * C: p -> datum = x [1228] * C: A->next = p [1248] * C: B->next = p [1251] * C: p -> next = ((void *)0) [1229] * C: A->next = p [1248] * C: p -> datum = x [1228] * C: A->next = p [1248] * C: B = malloc(sizeof(struct s)) [1249] * C: B->next = p [1251] * C: A = malloc(sizeof(struct s)) [1246] * C: A->next = p [1248] * C: p -> next = ((void *)0) [1229] * C: A->next->datum++ [1235] * C: p -> next = ((void *)0) [1229] and C: printf("%d\n", p->datum) [1259] - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1249]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1250]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1228]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1255]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1258]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1252]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1235]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1238]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 350 locations, 348 edges, 37 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 74.5s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 35.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8080 SdHoareTripleChecker+Valid, 18.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6814 mSDsluCounter, 6851 SdHoareTripleChecker+Invalid, 16.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8193 IncrementalHoareTripleChecker+Unchecked, 6334 mSDsCounter, 1796 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29457 IncrementalHoareTripleChecker+Invalid, 39446 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1796 mSolverCounterUnsat, 517 mSDtfsCounter, 29457 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2235 GetRequests, 1842 SyntacticMatches, 20 SemanticMatches, 373 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 5103 ImplicationChecksByTransitivity, 19.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9626occurred in iteration=21, InterpolantAutomatonStates: 232, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 34.3s InterpolantComputationTime, 3990 NumberOfCodeBlocks, 3990 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4716 ConstructedInterpolants, 420 QuantifiedInterpolants, 60493 SizeOfPredicates, 101 NumberOfNonLiveVariables, 3580 ConjunctsInSsa, 298 ConjunctsInUnsatCore, 31 InterpolantComputations, 16 PerfectInterpolantSequences, 78/246 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-17 11:06:01,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)