./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_23-idxsense_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 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/06-symbeq_23-idxsense_nr.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 9205365dcda04af07212d180b1c6367c5de79b6e0d2e09ec11b949fed58626f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:45:41,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:45:41,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:45:41,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:45:41,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:45:41,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:45:41,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:45:41,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:45:41,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:45:41,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:45:41,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:45:41,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:45:41,125 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:45:41,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:45:41,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:45:41,125 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:45:41,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:45:41,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:45:41,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:45:41,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:45:41,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:45:41,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:45:41,125 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:45:41,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:41,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:45:41,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:45:41,127 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 -> 9205365dcda04af07212d180b1c6367c5de79b6e0d2e09ec11b949fed58626f5 [2025-03-04 06:45:41,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:45:41,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:45:41,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:45:41,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:45:41,352 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:45:41,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_23-idxsense_nr.i [2025-03-04 06:45:42,472 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498fd14c7/9b5344492a9f4dbfb1bb130959466678/FLAGfd903e1fa [2025-03-04 06:45:42,739 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:45:42,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_23-idxsense_nr.i [2025-03-04 06:45:42,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498fd14c7/9b5344492a9f4dbfb1bb130959466678/FLAGfd903e1fa [2025-03-04 06:45:43,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/498fd14c7/9b5344492a9f4dbfb1bb130959466678 [2025-03-04 06:45:43,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:45:43,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:45:43,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:43,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:45:43,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:45:43,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:43" (1/1) ... [2025-03-04 06:45:43,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e4d15bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43, skipping insertion in model container [2025-03-04 06:45:43,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:45:43" (1/1) ... [2025-03-04 06:45:43,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:45:43,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:43,295 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:45:43,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:45:43,373 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:45:43,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43 WrapperNode [2025-03-04 06:45:43,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:45:43,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:43,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:45:43,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:45:43,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43" (1/1) ... [2025-03-04 06:45:43,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43" (1/1) ... [2025-03-04 06:45:43,406 INFO L138 Inliner]: procedures = 162, calls = 77, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2025-03-04 06:45:43,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:45:43,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:45:43,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:45:43,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:45:43,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43" (1/1) ... [2025-03-04 06:45:43,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43" (1/1) ... [2025-03-04 06:45:43,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43" (1/1) ... [2025-03-04 06:45:43,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43" (1/1) ... [2025-03-04 06:45:43,422 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43" (1/1) ... [2025-03-04 06:45:43,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43" (1/1) ... [2025-03-04 06:45:43,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43" (1/1) ... [2025-03-04 06:45:43,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43" (1/1) ... [2025-03-04 06:45:43,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:45:43,432 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:45:43,432 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:45:43,432 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:45:43,433 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43" (1/1) ... [2025-03-04 06:45:43,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:45:43,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:45:43,458 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-04 06:45:43,461 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-04 06:45:43,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:45:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:45:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:45:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:45:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:45:43,478 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:45:43,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:45:43,479 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:45:43,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:45:43,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:45:43,480 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:45:43,573 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:45:43,575 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:45:43,812 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:45:43,812 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:45:43,836 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:45:43,836 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:45:43,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:43 BoogieIcfgContainer [2025-03-04 06:45:43,836 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:45:43,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:45:43,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:45:43,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:45:43,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:45:43" (1/3) ... [2025-03-04 06:45:43,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@854538c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:43, skipping insertion in model container [2025-03-04 06:45:43,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:45:43" (2/3) ... [2025-03-04 06:45:43,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@854538c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:45:43, skipping insertion in model container [2025-03-04 06:45:43,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:43" (3/3) ... [2025-03-04 06:45:43,844 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_23-idxsense_nr.i [2025-03-04 06:45:43,854 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:45:43,855 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_23-idxsense_nr.i that has 2 procedures, 160 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-04 06:45:43,856 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:45:43,910 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:45:43,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 160 transitions, 324 flow [2025-03-04 06:45:44,001 INFO L124 PetriNetUnfolderBase]: 1/159 cut-off events. [2025-03-04 06:45:44,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:44,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 159 events. 1/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2025-03-04 06:45:44,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 160 transitions, 324 flow [2025-03-04 06:45:44,011 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 159 transitions, 321 flow [2025-03-04 06:45:44,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:45:44,025 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a4afa66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:45:44,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 06:45:44,060 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:45:44,060 INFO L124 PetriNetUnfolderBase]: 1/98 cut-off events. [2025-03-04 06:45:44,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:45:44,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:44,061 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] [2025-03-04 06:45:44,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:45:44,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:44,066 INFO L85 PathProgramCache]: Analyzing trace with hash 971379206, now seen corresponding path program 1 times [2025-03-04 06:45:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:44,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243950859] [2025-03-04 06:45:44,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:44,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:44,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:45:44,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:45:44,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:44,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:44,380 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-04 06:45:44,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:44,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243950859] [2025-03-04 06:45:44,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243950859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:44,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:44,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:45:44,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172606613] [2025-03-04 06:45:44,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:44,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:44,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:44,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:44,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:44,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 160 [2025-03-04 06:45:44,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 159 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-04 06:45:44,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:44,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 160 [2025-03-04 06:45:44,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:44,502 INFO L124 PetriNetUnfolderBase]: 11/298 cut-off events. [2025-03-04 06:45:44,503 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:44,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 298 events. 11/298 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 603 event pairs, 10 based on Foata normal form. 1/279 useless extension candidates. Maximal degree in co-relation 240. Up to 34 conditions per place. [2025-03-04 06:45:44,505 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 12 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2025-03-04 06:45:44,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 160 transitions, 351 flow [2025-03-04 06:45:44,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2025-03-04 06:45:44,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95 [2025-03-04 06:45:44,520 INFO L175 Difference]: Start difference. First operand has 162 places, 159 transitions, 321 flow. Second operand 3 states and 456 transitions. [2025-03-04 06:45:44,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 160 transitions, 351 flow [2025-03-04 06:45:44,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 160 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:44,526 INFO L231 Difference]: Finished difference. Result has 164 places, 160 transitions, 332 flow [2025-03-04 06:45:44,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=164, PETRI_TRANSITIONS=160} [2025-03-04 06:45:44,530 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 2 predicate places. [2025-03-04 06:45:44,530 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 160 transitions, 332 flow [2025-03-04 06:45:44,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-04 06:45:44,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:44,531 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] [2025-03-04 06:45:44,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:45:44,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:45:44,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:44,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1372251095, now seen corresponding path program 1 times [2025-03-04 06:45:44,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:44,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630743673] [2025-03-04 06:45:44,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:44,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:44,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 06:45:44,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 06:45:44,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:44,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:44,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:44,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630743673] [2025-03-04 06:45:44,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630743673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:45:44,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122636958] [2025-03-04 06:45:44,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:44,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:45:44,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:45:44,713 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-04 06:45:44,715 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-04 06:45:44,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 06:45:44,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 06:45:44,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:44,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:44,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:45:44,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:45:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:44,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:45:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:44,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122636958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:45:44,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:45:44,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:45:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855383797] [2025-03-04 06:45:44,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:45:44,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:45:44,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:44,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:45:44,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:45:44,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-03-04 06:45:44,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 160 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 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-04 06:45:44,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:44,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-03-04 06:45:44,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:45,068 INFO L124 PetriNetUnfolderBase]: 11/305 cut-off events. [2025-03-04 06:45:45,068 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:45:45,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 305 events. 11/305 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 600 event pairs, 10 based on Foata normal form. 2/287 useless extension candidates. Maximal degree in co-relation 277. Up to 34 conditions per place. [2025-03-04 06:45:45,072 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 16 selfloop transitions, 9 changer transitions 0/168 dead transitions. [2025-03-04 06:45:45,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 400 flow [2025-03-04 06:45:45,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:45:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:45:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1323 transitions. [2025-03-04 06:45:45,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91875 [2025-03-04 06:45:45,075 INFO L175 Difference]: Start difference. First operand has 164 places, 160 transitions, 332 flow. Second operand 9 states and 1323 transitions. [2025-03-04 06:45:45,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 400 flow [2025-03-04 06:45:45,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:45,080 INFO L231 Difference]: Finished difference. Result has 174 places, 166 transitions, 380 flow [2025-03-04 06:45:45,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=380, PETRI_PLACES=174, PETRI_TRANSITIONS=166} [2025-03-04 06:45:45,080 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 12 predicate places. [2025-03-04 06:45:45,081 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 166 transitions, 380 flow [2025-03-04 06:45:45,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 146.0) internal successors, (1460), 10 states have internal predecessors, (1460), 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-04 06:45:45,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:45,081 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:45:45,088 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-04 06:45:45,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:45:45,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:45:45,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:45,283 INFO L85 PathProgramCache]: Analyzing trace with hash -951784887, now seen corresponding path program 2 times [2025-03-04 06:45:45,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:45,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423416796] [2025-03-04 06:45:45,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:45:45,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:45,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-04 06:45:45,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 85 of 100 statements. [2025-03-04 06:45:45,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:45:45,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:45:45,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:45,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423416796] [2025-03-04 06:45:45,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423416796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:45,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:45,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:45,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396328871] [2025-03-04 06:45:45,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:45,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:45,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:45,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:45,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:45,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 160 [2025-03-04 06:45:45,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 166 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 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-04 06:45:45,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:45,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 160 [2025-03-04 06:45:45,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:46,256 INFO L124 PetriNetUnfolderBase]: 285/1089 cut-off events. [2025-03-04 06:45:46,256 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:45:46,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1742 conditions, 1089 events. 285/1089 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6337 event pairs, 68 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1628. Up to 287 conditions per place. [2025-03-04 06:45:46,263 INFO L140 encePairwiseOnDemand]: 138/160 looper letters, 98 selfloop transitions, 42 changer transitions 0/276 dead transitions. [2025-03-04 06:45:46,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 276 transitions, 880 flow [2025-03-04 06:45:46,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:46,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 922 transitions. [2025-03-04 06:45:46,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604166666666667 [2025-03-04 06:45:46,265 INFO L175 Difference]: Start difference. First operand has 174 places, 166 transitions, 380 flow. Second operand 6 states and 922 transitions. [2025-03-04 06:45:46,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 276 transitions, 880 flow [2025-03-04 06:45:46,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 276 transitions, 874 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:45:46,273 INFO L231 Difference]: Finished difference. Result has 183 places, 212 transitions, 690 flow [2025-03-04 06:45:46,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=690, PETRI_PLACES=183, PETRI_TRANSITIONS=212} [2025-03-04 06:45:46,274 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 21 predicate places. [2025-03-04 06:45:46,274 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 212 transitions, 690 flow [2025-03-04 06:45:46,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 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-04 06:45:46,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:46,275 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:45:46,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:45:46,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:45:46,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1952927645, now seen corresponding path program 1 times [2025-03-04 06:45:46,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:46,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220880098] [2025-03-04 06:45:46,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:46,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:46,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 06:45:46,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 06:45:46,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:46,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:46,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:46,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220880098] [2025-03-04 06:45:46,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220880098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:45:46,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003637147] [2025-03-04 06:45:46,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:46,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:45:46,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:45:46,437 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-04 06:45:46,439 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-04 06:45:46,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 06:45:46,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 06:45:46,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:46,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:46,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:45:46,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:45:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:46,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:45:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:46,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003637147] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:45:46,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:45:46,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 06:45:46,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187212643] [2025-03-04 06:45:46,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:45:46,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 06:45:46,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:46,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 06:45:46,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 06:45:46,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-03-04 06:45:46,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 212 transitions, 690 flow. Second operand has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 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-04 06:45:46,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:46,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-03-04 06:45:46,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:46,974 INFO L124 PetriNetUnfolderBase]: 127/838 cut-off events. [2025-03-04 06:45:46,974 INFO L125 PetriNetUnfolderBase]: For 135/150 co-relation queries the response was YES. [2025-03-04 06:45:46,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 838 events. 127/838 cut-off events. For 135/150 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4670 event pairs, 45 based on Foata normal form. 4/822 useless extension candidates. Maximal degree in co-relation 1359. Up to 132 conditions per place. [2025-03-04 06:45:46,978 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 20 selfloop transitions, 21 changer transitions 0/230 dead transitions. [2025-03-04 06:45:46,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 230 transitions, 860 flow [2025-03-04 06:45:46,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 06:45:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 06:45:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3069 transitions. [2025-03-04 06:45:46,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9133928571428571 [2025-03-04 06:45:46,983 INFO L175 Difference]: Start difference. First operand has 183 places, 212 transitions, 690 flow. Second operand 21 states and 3069 transitions. [2025-03-04 06:45:46,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 230 transitions, 860 flow [2025-03-04 06:45:46,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 230 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:46,989 INFO L231 Difference]: Finished difference. Result has 208 places, 225 transitions, 820 flow [2025-03-04 06:45:46,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=820, PETRI_PLACES=208, PETRI_TRANSITIONS=225} [2025-03-04 06:45:46,989 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 46 predicate places. [2025-03-04 06:45:46,989 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 225 transitions, 820 flow [2025-03-04 06:45:46,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 146.0) internal successors, (2628), 18 states have internal predecessors, (2628), 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-04 06:45:46,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:46,991 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:45:46,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:45:47,195 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,SelfDestructingSolverStorable3 [2025-03-04 06:45:47,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:45:47,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:47,196 INFO L85 PathProgramCache]: Analyzing trace with hash 947106653, now seen corresponding path program 2 times [2025-03-04 06:45:47,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:47,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831310276] [2025-03-04 06:45:47,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:45:47,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:47,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 121 statements into 2 equivalence classes. [2025-03-04 06:45:47,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 86 of 121 statements. [2025-03-04 06:45:47,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:45:47,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 06:45:47,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:47,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831310276] [2025-03-04 06:45:47,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831310276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:47,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:47,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:47,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938683853] [2025-03-04 06:45:47,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:47,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:47,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:47,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:47,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:47,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 160 [2025-03-04 06:45:47,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 225 transitions, 820 flow. Second operand has 6 states, 6 states have (on average 142.33333333333334) internal successors, (854), 6 states have internal predecessors, (854), 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-04 06:45:47,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:47,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 160 [2025-03-04 06:45:47,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:47,849 INFO L124 PetriNetUnfolderBase]: 141/900 cut-off events. [2025-03-04 06:45:47,850 INFO L125 PetriNetUnfolderBase]: For 146/168 co-relation queries the response was YES. [2025-03-04 06:45:47,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1642 conditions, 900 events. 141/900 cut-off events. For 146/168 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5158 event pairs, 49 based on Foata normal form. 3/880 useless extension candidates. Maximal degree in co-relation 1444. Up to 129 conditions per place. [2025-03-04 06:45:47,853 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 21 selfloop transitions, 5 changer transitions 0/232 dead transitions. [2025-03-04 06:45:47,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 232 transitions, 886 flow [2025-03-04 06:45:47,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 873 transitions. [2025-03-04 06:45:47,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.909375 [2025-03-04 06:45:47,855 INFO L175 Difference]: Start difference. First operand has 208 places, 225 transitions, 820 flow. Second operand 6 states and 873 transitions. [2025-03-04 06:45:47,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 232 transitions, 886 flow [2025-03-04 06:45:47,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 232 transitions, 862 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 06:45:47,860 INFO L231 Difference]: Finished difference. Result has 206 places, 224 transitions, 804 flow [2025-03-04 06:45:47,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=804, PETRI_PLACES=206, PETRI_TRANSITIONS=224} [2025-03-04 06:45:47,861 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 44 predicate places. [2025-03-04 06:45:47,861 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 224 transitions, 804 flow [2025-03-04 06:45:47,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.33333333333334) internal successors, (854), 6 states have internal predecessors, (854), 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-04 06:45:47,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:47,862 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:45:47,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:45:47,862 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:45:47,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:47,863 INFO L85 PathProgramCache]: Analyzing trace with hash 764387085, now seen corresponding path program 1 times [2025-03-04 06:45:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:47,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716518836] [2025-03-04 06:45:47,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:47,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 06:45:47,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 06:45:47,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:47,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:48,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:48,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716518836] [2025-03-04 06:45:48,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716518836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:45:48,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986345336] [2025-03-04 06:45:48,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:48,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:45:48,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:45:48,116 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-04 06:45:48,118 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-04 06:45:48,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 06:45:48,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 06:45:48,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:48,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:48,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:45:48,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:45:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:48,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:45:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:45:48,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986345336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:45:48,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:45:48,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-04 06:45:48,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730159956] [2025-03-04 06:45:48,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:45:48,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 06:45:48,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:48,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 06:45:48,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 06:45:48,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 160 [2025-03-04 06:45:48,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 224 transitions, 804 flow. Second operand has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 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-04 06:45:48,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:48,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 160 [2025-03-04 06:45:48,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:48,821 INFO L124 PetriNetUnfolderBase]: 127/852 cut-off events. [2025-03-04 06:45:48,821 INFO L125 PetriNetUnfolderBase]: For 252/267 co-relation queries the response was YES. [2025-03-04 06:45:48,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1644 conditions, 852 events. 127/852 cut-off events. For 252/267 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4687 event pairs, 45 based on Foata normal form. 3/836 useless extension candidates. Maximal degree in co-relation 1370. Up to 132 conditions per place. [2025-03-04 06:45:48,826 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 23 selfloop transitions, 30 changer transitions 0/241 dead transitions. [2025-03-04 06:45:48,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 241 transitions, 1032 flow [2025-03-04 06:45:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 06:45:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 06:45:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4376 transitions. [2025-03-04 06:45:48,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9116666666666666 [2025-03-04 06:45:48,833 INFO L175 Difference]: Start difference. First operand has 206 places, 224 transitions, 804 flow. Second operand 30 states and 4376 transitions. [2025-03-04 06:45:48,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 241 transitions, 1032 flow [2025-03-04 06:45:48,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 241 transitions, 1022 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:45:48,839 INFO L231 Difference]: Finished difference. Result has 234 places, 234 transitions, 946 flow [2025-03-04 06:45:48,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=946, PETRI_PLACES=234, PETRI_TRANSITIONS=234} [2025-03-04 06:45:48,840 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 72 predicate places. [2025-03-04 06:45:48,840 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 234 transitions, 946 flow [2025-03-04 06:45:48,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 146.08695652173913) internal successors, (3360), 23 states have internal predecessors, (3360), 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-04 06:45:48,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:48,841 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:45:48,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 06:45:49,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:45:49,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:45:49,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:49,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1371972886, now seen corresponding path program 2 times [2025-03-04 06:45:49,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:49,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243300607] [2025-03-04 06:45:49,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:45:49,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:49,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-04 06:45:49,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 143 statements. [2025-03-04 06:45:49,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:45:49,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-04 06:45:49,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:49,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243300607] [2025-03-04 06:45:49,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243300607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:49,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:49,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:49,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238573479] [2025-03-04 06:45:49,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:49,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:49,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:49,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:49,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:49,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 160 [2025-03-04 06:45:49,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 234 transitions, 946 flow. Second operand has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 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-04 06:45:49,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:49,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 160 [2025-03-04 06:45:49,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:49,747 INFO L124 PetriNetUnfolderBase]: 445/1510 cut-off events. [2025-03-04 06:45:49,747 INFO L125 PetriNetUnfolderBase]: For 719/753 co-relation queries the response was YES. [2025-03-04 06:45:49,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3673 conditions, 1510 events. 445/1510 cut-off events. For 719/753 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9423 event pairs, 117 based on Foata normal form. 24/1510 useless extension candidates. Maximal degree in co-relation 3398. Up to 640 conditions per place. [2025-03-04 06:45:49,757 INFO L140 encePairwiseOnDemand]: 143/160 looper letters, 109 selfloop transitions, 53 changer transitions 6/325 dead transitions. [2025-03-04 06:45:49,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 325 transitions, 1650 flow [2025-03-04 06:45:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 882 transitions. [2025-03-04 06:45:49,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91875 [2025-03-04 06:45:49,759 INFO L175 Difference]: Start difference. First operand has 234 places, 234 transitions, 946 flow. Second operand 6 states and 882 transitions. [2025-03-04 06:45:49,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 325 transitions, 1650 flow [2025-03-04 06:45:49,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 325 transitions, 1604 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-04 06:45:49,769 INFO L231 Difference]: Finished difference. Result has 226 places, 285 transitions, 1406 flow [2025-03-04 06:45:49,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1406, PETRI_PLACES=226, PETRI_TRANSITIONS=285} [2025-03-04 06:45:49,771 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 64 predicate places. [2025-03-04 06:45:49,771 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 285 transitions, 1406 flow [2025-03-04 06:45:49,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 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-04 06:45:49,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:49,771 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:45:49,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:45:49,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:45:49,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2033500526, now seen corresponding path program 1 times [2025-03-04 06:45:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:49,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194811756] [2025-03-04 06:45:49,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:49,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 06:45:49,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 06:45:49,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:49,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-04 06:45:50,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:50,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194811756] [2025-03-04 06:45:50,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194811756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:50,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:50,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:50,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450952893] [2025-03-04 06:45:50,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:50,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:50,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:50,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:50,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:50,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 160 [2025-03-04 06:45:50,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 285 transitions, 1406 flow. Second operand has 6 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 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-04 06:45:50,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:50,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 160 [2025-03-04 06:45:50,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:50,537 INFO L124 PetriNetUnfolderBase]: 255/1247 cut-off events. [2025-03-04 06:45:50,537 INFO L125 PetriNetUnfolderBase]: For 1032/1105 co-relation queries the response was YES. [2025-03-04 06:45:50,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3042 conditions, 1247 events. 255/1247 cut-off events. For 1032/1105 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7961 event pairs, 57 based on Foata normal form. 9/1235 useless extension candidates. Maximal degree in co-relation 2783. Up to 215 conditions per place. [2025-03-04 06:45:50,543 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 25 selfloop transitions, 5 changer transitions 0/292 dead transitions. [2025-03-04 06:45:50,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 292 transitions, 1480 flow [2025-03-04 06:45:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 853 transitions. [2025-03-04 06:45:50,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8885416666666667 [2025-03-04 06:45:50,545 INFO L175 Difference]: Start difference. First operand has 226 places, 285 transitions, 1406 flow. Second operand 6 states and 853 transitions. [2025-03-04 06:45:50,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 292 transitions, 1480 flow [2025-03-04 06:45:50,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 292 transitions, 1472 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-04 06:45:50,555 INFO L231 Difference]: Finished difference. Result has 230 places, 284 transitions, 1406 flow [2025-03-04 06:45:50,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1406, PETRI_PLACES=230, PETRI_TRANSITIONS=284} [2025-03-04 06:45:50,557 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 68 predicate places. [2025-03-04 06:45:50,557 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 284 transitions, 1406 flow [2025-03-04 06:45:50,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 139.5) internal successors, (837), 6 states have internal predecessors, (837), 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-04 06:45:50,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:50,558 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:45:50,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:45:50,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:45:50,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash 730960213, now seen corresponding path program 1 times [2025-03-04 06:45:50,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:50,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850805730] [2025-03-04 06:45:50,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:50,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 06:45:50,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 06:45:50,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:50,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-04 06:45:50,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:50,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850805730] [2025-03-04 06:45:50,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850805730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:50,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:50,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:45:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739846557] [2025-03-04 06:45:50,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:50,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:45:50,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:50,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:45:50,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:45:51,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 160 [2025-03-04 06:45:51,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 284 transitions, 1406 flow. Second operand has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 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-04 06:45:51,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:51,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 160 [2025-03-04 06:45:51,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:51,376 INFO L124 PetriNetUnfolderBase]: 594/1878 cut-off events. [2025-03-04 06:45:51,376 INFO L125 PetriNetUnfolderBase]: For 2513/2558 co-relation queries the response was YES. [2025-03-04 06:45:51,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5684 conditions, 1878 events. 594/1878 cut-off events. For 2513/2558 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12323 event pairs, 150 based on Foata normal form. 25/1870 useless extension candidates. Maximal degree in co-relation 5424. Up to 891 conditions per place. [2025-03-04 06:45:51,386 INFO L140 encePairwiseOnDemand]: 143/160 looper letters, 122 selfloop transitions, 58 changer transitions 39/376 dead transitions. [2025-03-04 06:45:51,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 376 transitions, 2368 flow [2025-03-04 06:45:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:45:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:45:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 864 transitions. [2025-03-04 06:45:51,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9 [2025-03-04 06:45:51,388 INFO L175 Difference]: Start difference. First operand has 230 places, 284 transitions, 1406 flow. Second operand 6 states and 864 transitions. [2025-03-04 06:45:51,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 376 transitions, 2368 flow [2025-03-04 06:45:51,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 376 transitions, 2358 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:45:51,399 INFO L231 Difference]: Finished difference. Result has 234 places, 311 transitions, 1804 flow [2025-03-04 06:45:51,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1804, PETRI_PLACES=234, PETRI_TRANSITIONS=311} [2025-03-04 06:45:51,400 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 72 predicate places. [2025-03-04 06:45:51,400 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 311 transitions, 1804 flow [2025-03-04 06:45:51,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 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-04 06:45:51,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:45:51,401 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:45:51,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:45:51,401 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-04 06:45:51,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:45:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash -655417679, now seen corresponding path program 1 times [2025-03-04 06:45:51,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:45:51,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419710012] [2025-03-04 06:45:51,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:45:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:45:51,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 06:45:51,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 06:45:51,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:45:51,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:45:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-04 06:45:51,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:45:51,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419710012] [2025-03-04 06:45:51,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419710012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:45:51,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:45:51,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:45:51,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70699376] [2025-03-04 06:45:51,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:45:51,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:45:51,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:45:51,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:45:51,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:45:51,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 160 [2025-03-04 06:45:51,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 311 transitions, 1804 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-04 06:45:51,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:51,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 160 [2025-03-04 06:45:51,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:45:51,602 INFO L124 PetriNetUnfolderBase]: 6/275 cut-off events. [2025-03-04 06:45:51,602 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2025-03-04 06:45:51,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 275 events. 6/275 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs, 0 based on Foata normal form. 2/276 useless extension candidates. Maximal degree in co-relation 441. Up to 23 conditions per place. [2025-03-04 06:45:51,603 INFO L140 encePairwiseOnDemand]: 156/160 looper letters, 0 selfloop transitions, 0 changer transitions 185/185 dead transitions. [2025-03-04 06:45:51,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 185 transitions, 738 flow [2025-03-04 06:45:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:45:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:45:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2025-03-04 06:45:51,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9708333333333333 [2025-03-04 06:45:51,605 INFO L175 Difference]: Start difference. First operand has 234 places, 311 transitions, 1804 flow. Second operand 3 states and 466 transitions. [2025-03-04 06:45:51,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 185 transitions, 738 flow [2025-03-04 06:45:51,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 185 transitions, 600 flow, removed 30 selfloop flow, removed 29 redundant places. [2025-03-04 06:45:51,609 INFO L231 Difference]: Finished difference. Result has 203 places, 0 transitions, 0 flow [2025-03-04 06:45:51,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=203, PETRI_TRANSITIONS=0} [2025-03-04 06:45:51,610 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, 41 predicate places. [2025-03-04 06:45:51,610 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 0 transitions, 0 flow [2025-03-04 06:45:51,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-04 06:45:51,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-03-04 06:45:51,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-03-04 06:45:51,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-03-04 06:45:51,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-03-04 06:45:51,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-03-04 06:45:51,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-03-04 06:45:51,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-03-04 06:45:51,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-03-04 06:45:51,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-03-04 06:45:51,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:45:51,613 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1] [2025-03-04 06:45:51,616 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:45:51,616 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:45:51,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:45:51 BasicIcfg [2025-03-04 06:45:51,621 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:45:51,621 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:45:51,621 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:45:51,622 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:45:51,622 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:45:43" (3/4) ... [2025-03-04 06:45:51,623 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:45:51,625 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-04 06:45:51,630 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 06:45:51,630 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 06:45:51,630 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 06:45:51,687 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:45:51,687 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:45:51,687 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:45:51,688 INFO L158 Benchmark]: Toolchain (without parser) took 8642.60ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 103.0MB in the beginning and 364.3MB in the end (delta: -261.3MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2025-03-04 06:45:51,689 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:45:51,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.66ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 81.6MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:45:51,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.34ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:45:51,689 INFO L158 Benchmark]: Boogie Preprocessor took 24.28ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 78.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:45:51,690 INFO L158 Benchmark]: IcfgBuilder took 404.29ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 55.4MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:45:51,690 INFO L158 Benchmark]: TraceAbstraction took 7783.09ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 55.4MB in the beginning and 372.7MB in the end (delta: -317.3MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. [2025-03-04 06:45:51,690 INFO L158 Benchmark]: Witness Printer took 65.99ms. Allocated memory is still 419.4MB. Free memory was 372.7MB in the beginning and 364.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:45:51,691 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.54ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.66ms. Allocated memory is still 142.6MB. Free memory was 103.0MB in the beginning and 81.6MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.34ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.28ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 78.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 404.29ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 55.4MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7783.09ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 55.4MB in the beginning and 372.7MB in the end (delta: -317.3MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. * Witness Printer took 65.99ms. Allocated memory is still 419.4MB. Free memory was 372.7MB in the beginning and 364.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 693]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 693]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 683]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 683]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 188 locations, 9 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: 7.7s, OverallIterations: 10, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1127 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 731 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 369 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2532 IncrementalHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 369 mSolverCounterUnsat, 16 mSDtfsCounter, 2532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 733 GetRequests, 621 SyntacticMatches, 11 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1804occurred in iteration=9, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1566 NumberOfCodeBlocks, 1466 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1869 ConstructedInterpolants, 0 QuantifiedInterpolants, 2680 SizeOfPredicates, 22 NumberOfNonLiveVariables, 721 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 1070/1463 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:45:51,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE