./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:30:46,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:30:46,351 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:30:46,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:30:46,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:30:46,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:30:46,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:30:46,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:30:46,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:30:46,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:30:46,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:30:46,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:30:46,381 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:30:46,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:30:46,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:30:46,381 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:30:46,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:30:46,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:30:46,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:30:46,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:30:46,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:30:46,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:30:46,382 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:30:46,382 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:30:46,382 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:30:46,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:30:46,383 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:30:46,383 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:30:46,383 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:30:46,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:30:46,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:30:46,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:30:46,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:30:46,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:30:46,384 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:30:46,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:30:46,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:30:46,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:30:46,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:30:46,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:30:46,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:30:46,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:30:46,385 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2025-02-06 09:30:46,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:30:46,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:30:46,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:30:46,680 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:30:46,680 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:30:46,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-02-06 09:30:48,056 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a847b48e/5e00261de81b4013becfddcdd5255d1a/FLAGd01ad2548 [2025-02-06 09:30:48,328 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:30:48,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2025-02-06 09:30:48,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a847b48e/5e00261de81b4013becfddcdd5255d1a/FLAGd01ad2548 [2025-02-06 09:30:48,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a847b48e/5e00261de81b4013becfddcdd5255d1a [2025-02-06 09:30:48,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:30:48,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:30:48,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:30:48,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:30:48,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:30:48,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7488c963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48, skipping insertion in model container [2025-02-06 09:30:48,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:30:48,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:30:48,800 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:30:48,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:30:48,824 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:30:48,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48 WrapperNode [2025-02-06 09:30:48,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:30:48,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:30:48,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:30:48,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:30:48,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,851 INFO L138 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 214 [2025-02-06 09:30:48,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:30:48,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:30:48,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:30:48,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:30:48,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,864 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:30:48,877 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:30:48,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:30:48,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:30:48,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (1/1) ... [2025-02-06 09:30:48,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:30:48,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:30:48,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:30:48,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:30:48,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:30:48,934 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:30:48,934 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:30:48,934 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:30:48,934 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:30:48,934 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:30:48,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:30:48,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 09:30:48,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 09:30:48,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:30:48,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:30:48,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:30:48,937 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:30:49,018 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:30:49,025 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:30:49,265 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:30:49,265 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:30:49,297 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:30:49,297 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:30:49,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:30:49 BoogieIcfgContainer [2025-02-06 09:30:49,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:30:49,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:30:49,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:30:49,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:30:49,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:30:48" (1/3) ... [2025-02-06 09:30:49,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469b6969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:30:49, skipping insertion in model container [2025-02-06 09:30:49,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:30:48" (2/3) ... [2025-02-06 09:30:49,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@469b6969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:30:49, skipping insertion in model container [2025-02-06 09:30:49,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:30:49" (3/3) ... [2025-02-06 09:30:49,306 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2025-02-06 09:30:49,316 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:30:49,318 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-4.wvr.c that has 5 procedures, 227 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-02-06 09:30:49,318 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:30:49,379 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 09:30:49,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 235 transitions, 498 flow [2025-02-06 09:30:49,486 INFO L124 PetriNetUnfolderBase]: 9/231 cut-off events. [2025-02-06 09:30:49,487 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:30:49,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 231 events. 9/231 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 358 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 187. Up to 2 conditions per place. [2025-02-06 09:30:49,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 235 transitions, 498 flow [2025-02-06 09:30:49,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 219 places, 214 transitions, 449 flow [2025-02-06 09:30:49,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:30:49,514 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;@7538b1f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:30:49,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-02-06 09:30:49,522 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:30:49,522 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-06 09:30:49,522 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:30:49,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:49,522 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] [2025-02-06 09:30:49,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:30:49,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash -390363681, now seen corresponding path program 1 times [2025-02-06 09:30:49,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:49,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517513642] [2025-02-06 09:30:49,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:49,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:49,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 09:30:49,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 09:30:49,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:49,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:49,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:49,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517513642] [2025-02-06 09:30:49,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517513642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:49,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:49,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:49,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544215648] [2025-02-06 09:30:49,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:49,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:49,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:49,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:49,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:49,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2025-02-06 09:30:49,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:49,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:49,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2025-02-06 09:30:49,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:50,414 INFO L124 PetriNetUnfolderBase]: 1590/4870 cut-off events. [2025-02-06 09:30:50,415 INFO L125 PetriNetUnfolderBase]: For 339/339 co-relation queries the response was YES. [2025-02-06 09:30:50,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7393 conditions, 4870 events. 1590/4870 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 44619 event pairs, 1132 based on Foata normal form. 350/4509 useless extension candidates. Maximal degree in co-relation 7098. Up to 2178 conditions per place. [2025-02-06 09:30:50,459 INFO L140 encePairwiseOnDemand]: 227/235 looper letters, 29 selfloop transitions, 2 changer transitions 1/208 dead transitions. [2025-02-06 09:30:50,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 208 transitions, 499 flow [2025-02-06 09:30:50,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2025-02-06 09:30:50,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8780141843971632 [2025-02-06 09:30:50,473 INFO L175 Difference]: Start difference. First operand has 219 places, 214 transitions, 449 flow. Second operand 3 states and 619 transitions. [2025-02-06 09:30:50,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 208 transitions, 499 flow [2025-02-06 09:30:50,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 208 transitions, 486 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-06 09:30:50,481 INFO L231 Difference]: Finished difference. Result has 213 places, 207 transitions, 426 flow [2025-02-06 09:30:50,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=213, PETRI_TRANSITIONS=207} [2025-02-06 09:30:50,486 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -6 predicate places. [2025-02-06 09:30:50,486 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 207 transitions, 426 flow [2025-02-06 09:30:50,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:50,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:50,487 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] [2025-02-06 09:30:50,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:30:50,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:30:50,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash -223971345, now seen corresponding path program 1 times [2025-02-06 09:30:50,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:50,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955700480] [2025-02-06 09:30:50,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:50,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:50,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 09:30:50,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 09:30:50,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:50,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:50,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:50,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955700480] [2025-02-06 09:30:50,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955700480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:50,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:50,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:50,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211034406] [2025-02-06 09:30:50,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:50,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:50,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:50,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:50,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:50,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2025-02-06 09:30:50,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 207 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:50,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:50,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2025-02-06 09:30:50,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:51,178 INFO L124 PetriNetUnfolderBase]: 1827/4770 cut-off events. [2025-02-06 09:30:51,179 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-02-06 09:30:51,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7534 conditions, 4770 events. 1827/4770 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 40737 event pairs, 1374 based on Foata normal form. 0/4108 useless extension candidates. Maximal degree in co-relation 7500. Up to 2507 conditions per place. [2025-02-06 09:30:51,215 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 29 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2025-02-06 09:30:51,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 206 transitions, 486 flow [2025-02-06 09:30:51,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2025-02-06 09:30:51,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8709219858156029 [2025-02-06 09:30:51,217 INFO L175 Difference]: Start difference. First operand has 213 places, 207 transitions, 426 flow. Second operand 3 states and 614 transitions. [2025-02-06 09:30:51,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 206 transitions, 486 flow [2025-02-06 09:30:51,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 206 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:51,220 INFO L231 Difference]: Finished difference. Result has 211 places, 206 transitions, 424 flow [2025-02-06 09:30:51,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=211, PETRI_TRANSITIONS=206} [2025-02-06 09:30:51,221 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -8 predicate places. [2025-02-06 09:30:51,221 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 206 transitions, 424 flow [2025-02-06 09:30:51,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:51,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:51,222 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] [2025-02-06 09:30:51,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:30:51,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:30:51,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:51,222 INFO L85 PathProgramCache]: Analyzing trace with hash -207963243, now seen corresponding path program 1 times [2025-02-06 09:30:51,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:51,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991704043] [2025-02-06 09:30:51,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:51,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:51,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 09:30:51,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 09:30:51,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:51,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:51,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:51,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991704043] [2025-02-06 09:30:51,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991704043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:51,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:51,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857555174] [2025-02-06 09:30:51,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:51,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:51,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:51,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:51,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:51,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2025-02-06 09:30:51,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 206 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:51,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:51,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2025-02-06 09:30:51,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:51,836 INFO L124 PetriNetUnfolderBase]: 1848/4571 cut-off events. [2025-02-06 09:30:51,836 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-02-06 09:30:51,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7342 conditions, 4571 events. 1848/4571 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 37572 event pairs, 1400 based on Foata normal form. 0/3911 useless extension candidates. Maximal degree in co-relation 7300. Up to 2534 conditions per place. [2025-02-06 09:30:51,868 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 29 selfloop transitions, 2 changer transitions 0/205 dead transitions. [2025-02-06 09:30:51,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 205 transitions, 484 flow [2025-02-06 09:30:51,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2025-02-06 09:30:51,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8709219858156029 [2025-02-06 09:30:51,871 INFO L175 Difference]: Start difference. First operand has 211 places, 206 transitions, 424 flow. Second operand 3 states and 614 transitions. [2025-02-06 09:30:51,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 205 transitions, 484 flow [2025-02-06 09:30:51,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 205 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:51,874 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 422 flow [2025-02-06 09:30:51,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2025-02-06 09:30:51,875 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -9 predicate places. [2025-02-06 09:30:51,875 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 422 flow [2025-02-06 09:30:51,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:51,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:51,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:51,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:30:51,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:30:51,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:51,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2054704289, now seen corresponding path program 1 times [2025-02-06 09:30:51,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:51,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830875300] [2025-02-06 09:30:51,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:51,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:51,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:30:51,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:30:51,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:51,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:51,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830875300] [2025-02-06 09:30:51,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830875300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:51,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:51,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:51,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965853658] [2025-02-06 09:30:51,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:51,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:51,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:51,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:51,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:51,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 235 [2025-02-06 09:30:51,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:51,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:51,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 235 [2025-02-06 09:30:51,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:52,459 INFO L124 PetriNetUnfolderBase]: 1714/4642 cut-off events. [2025-02-06 09:30:52,459 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-02-06 09:30:52,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7165 conditions, 4642 events. 1714/4642 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 39101 event pairs, 1266 based on Foata normal form. 0/3988 useless extension candidates. Maximal degree in co-relation 7115. Up to 2354 conditions per place. [2025-02-06 09:30:52,496 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 29 selfloop transitions, 2 changer transitions 0/204 dead transitions. [2025-02-06 09:30:52,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 204 transitions, 482 flow [2025-02-06 09:30:52,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 614 transitions. [2025-02-06 09:30:52,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8709219858156029 [2025-02-06 09:30:52,499 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 422 flow. Second operand 3 states and 614 transitions. [2025-02-06 09:30:52,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 204 transitions, 482 flow [2025-02-06 09:30:52,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 204 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:52,504 INFO L231 Difference]: Finished difference. Result has 209 places, 204 transitions, 420 flow [2025-02-06 09:30:52,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=209, PETRI_TRANSITIONS=204} [2025-02-06 09:30:52,506 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -10 predicate places. [2025-02-06 09:30:52,506 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 204 transitions, 420 flow [2025-02-06 09:30:52,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:52,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:52,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:52,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:30:52,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:30:52,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:52,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1032916118, now seen corresponding path program 1 times [2025-02-06 09:30:52,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:52,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432620315] [2025-02-06 09:30:52,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:52,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:52,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 09:30:52,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 09:30:52,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:52,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:52,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:52,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432620315] [2025-02-06 09:30:52,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432620315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:52,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:52,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:52,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112731185] [2025-02-06 09:30:52,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:52,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:52,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:52,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:52,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:52,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 235 [2025-02-06 09:30:52,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 204 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:52,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:52,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 235 [2025-02-06 09:30:52,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:53,425 INFO L124 PetriNetUnfolderBase]: 2313/6203 cut-off events. [2025-02-06 09:30:53,426 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-06 09:30:53,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9691 conditions, 6203 events. 2313/6203 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 57579 event pairs, 1319 based on Foata normal form. 0/5320 useless extension candidates. Maximal degree in co-relation 9633. Up to 2498 conditions per place. [2025-02-06 09:30:53,466 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 40 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2025-02-06 09:30:53,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 215 transitions, 530 flow [2025-02-06 09:30:53,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2025-02-06 09:30:53,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8950354609929078 [2025-02-06 09:30:53,469 INFO L175 Difference]: Start difference. First operand has 209 places, 204 transitions, 420 flow. Second operand 3 states and 631 transitions. [2025-02-06 09:30:53,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 215 transitions, 530 flow [2025-02-06 09:30:53,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 215 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:53,475 INFO L231 Difference]: Finished difference. Result has 208 places, 203 transitions, 418 flow [2025-02-06 09:30:53,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=208, PETRI_TRANSITIONS=203} [2025-02-06 09:30:53,476 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -11 predicate places. [2025-02-06 09:30:53,478 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 203 transitions, 418 flow [2025-02-06 09:30:53,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:53,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:53,479 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] [2025-02-06 09:30:53,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:30:53,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:30:53,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:53,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1115249900, now seen corresponding path program 1 times [2025-02-06 09:30:53,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:53,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99870044] [2025-02-06 09:30:53,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:53,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:53,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 09:30:53,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 09:30:53,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:53,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:53,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:53,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99870044] [2025-02-06 09:30:53,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99870044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:53,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:53,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:53,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923188774] [2025-02-06 09:30:53,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:53,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:53,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:53,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:53,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:53,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 235 [2025-02-06 09:30:53,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 203 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:53,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:53,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 235 [2025-02-06 09:30:53,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:54,153 INFO L124 PetriNetUnfolderBase]: 1959/4969 cut-off events. [2025-02-06 09:30:54,154 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2025-02-06 09:30:54,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7991 conditions, 4969 events. 1959/4969 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 42759 event pairs, 431 based on Foata normal form. 0/4352 useless extension candidates. Maximal degree in co-relation 5950. Up to 1962 conditions per place. [2025-02-06 09:30:54,182 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 39 selfloop transitions, 1 changer transitions 0/214 dead transitions. [2025-02-06 09:30:54,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 214 transitions, 524 flow [2025-02-06 09:30:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2025-02-06 09:30:54,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.900709219858156 [2025-02-06 09:30:54,184 INFO L175 Difference]: Start difference. First operand has 208 places, 203 transitions, 418 flow. Second operand 3 states and 635 transitions. [2025-02-06 09:30:54,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 214 transitions, 524 flow [2025-02-06 09:30:54,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 214 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:54,187 INFO L231 Difference]: Finished difference. Result has 207 places, 202 transitions, 414 flow [2025-02-06 09:30:54,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=207, PETRI_TRANSITIONS=202} [2025-02-06 09:30:54,188 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -12 predicate places. [2025-02-06 09:30:54,188 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 202 transitions, 414 flow [2025-02-06 09:30:54,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:54,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:54,189 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-02-06 09:30:54,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:30:54,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:30:54,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:54,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2028137539, now seen corresponding path program 1 times [2025-02-06 09:30:54,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:54,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186015674] [2025-02-06 09:30:54,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:54,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:54,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 09:30:54,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 09:30:54,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:54,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:54,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:54,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186015674] [2025-02-06 09:30:54,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186015674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:54,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:54,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:54,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958703063] [2025-02-06 09:30:54,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:54,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:54,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:54,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:54,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:54,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 235 [2025-02-06 09:30:54,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 202 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:54,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:54,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 235 [2025-02-06 09:30:54,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:54,761 INFO L124 PetriNetUnfolderBase]: 2801/6242 cut-off events. [2025-02-06 09:30:54,762 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-02-06 09:30:54,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10467 conditions, 6242 events. 2801/6242 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 52547 event pairs, 1639 based on Foata normal form. 0/5489 useless extension candidates. Maximal degree in co-relation 8004. Up to 2924 conditions per place. [2025-02-06 09:30:54,796 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 41 selfloop transitions, 2 changer transitions 0/214 dead transitions. [2025-02-06 09:30:54,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 214 transitions, 528 flow [2025-02-06 09:30:54,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2025-02-06 09:30:54,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8964539007092198 [2025-02-06 09:30:54,798 INFO L175 Difference]: Start difference. First operand has 207 places, 202 transitions, 414 flow. Second operand 3 states and 632 transitions. [2025-02-06 09:30:54,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 214 transitions, 528 flow [2025-02-06 09:30:54,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 214 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:54,801 INFO L231 Difference]: Finished difference. Result has 207 places, 201 transitions, 415 flow [2025-02-06 09:30:54,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=207, PETRI_TRANSITIONS=201} [2025-02-06 09:30:54,801 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -12 predicate places. [2025-02-06 09:30:54,802 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 201 transitions, 415 flow [2025-02-06 09:30:54,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:54,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:54,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:54,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:30:54,802 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:30:54,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:54,803 INFO L85 PathProgramCache]: Analyzing trace with hash 976189381, now seen corresponding path program 1 times [2025-02-06 09:30:54,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:54,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836559576] [2025-02-06 09:30:54,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:54,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:54,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 09:30:54,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 09:30:54,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:54,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:54,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:54,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836559576] [2025-02-06 09:30:54,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836559576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:54,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:54,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:54,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362872467] [2025-02-06 09:30:54,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:54,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:54,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:54,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:54,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:54,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 235 [2025-02-06 09:30:54,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 201 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:54,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:54,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 235 [2025-02-06 09:30:54,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:55,426 INFO L124 PetriNetUnfolderBase]: 2062/5252 cut-off events. [2025-02-06 09:30:55,427 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2025-02-06 09:30:55,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8514 conditions, 5252 events. 2062/5252 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 44088 event pairs, 910 based on Foata normal form. 0/4720 useless extension candidates. Maximal degree in co-relation 6469. Up to 1687 conditions per place. [2025-02-06 09:30:55,457 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 40 selfloop transitions, 1 changer transitions 0/213 dead transitions. [2025-02-06 09:30:55,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 213 transitions, 525 flow [2025-02-06 09:30:55,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:55,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-02-06 09:30:55,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.902127659574468 [2025-02-06 09:30:55,461 INFO L175 Difference]: Start difference. First operand has 207 places, 201 transitions, 415 flow. Second operand 3 states and 636 transitions. [2025-02-06 09:30:55,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 213 transitions, 525 flow [2025-02-06 09:30:55,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 213 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:55,466 INFO L231 Difference]: Finished difference. Result has 206 places, 200 transitions, 411 flow [2025-02-06 09:30:55,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=206, PETRI_TRANSITIONS=200} [2025-02-06 09:30:55,468 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -13 predicate places. [2025-02-06 09:30:55,468 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 411 flow [2025-02-06 09:30:55,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:55,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:55,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:55,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:30:55,469 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:30:55,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:55,470 INFO L85 PathProgramCache]: Analyzing trace with hash 744594477, now seen corresponding path program 1 times [2025-02-06 09:30:55,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:55,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322805990] [2025-02-06 09:30:55,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:55,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:55,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 09:30:55,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 09:30:55,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:55,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:55,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:55,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:55,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322805990] [2025-02-06 09:30:55,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322805990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:55,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:55,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:55,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627038437] [2025-02-06 09:30:55,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:55,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:55,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:55,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:55,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:55,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 235 [2025-02-06 09:30:55,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 200 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:55,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:55,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 235 [2025-02-06 09:30:55,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:55,996 INFO L124 PetriNetUnfolderBase]: 2675/6405 cut-off events. [2025-02-06 09:30:55,997 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-02-06 09:30:56,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10417 conditions, 6405 events. 2675/6405 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 55117 event pairs, 1449 based on Foata normal form. 0/5645 useless extension candidates. Maximal degree in co-relation 8037. Up to 2744 conditions per place. [2025-02-06 09:30:56,021 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 41 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2025-02-06 09:30:56,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 212 transitions, 525 flow [2025-02-06 09:30:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2025-02-06 09:30:56,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8964539007092198 [2025-02-06 09:30:56,023 INFO L175 Difference]: Start difference. First operand has 206 places, 200 transitions, 411 flow. Second operand 3 states and 632 transitions. [2025-02-06 09:30:56,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 212 transitions, 525 flow [2025-02-06 09:30:56,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 212 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:56,026 INFO L231 Difference]: Finished difference. Result has 206 places, 199 transitions, 412 flow [2025-02-06 09:30:56,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=206, PETRI_TRANSITIONS=199} [2025-02-06 09:30:56,026 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -13 predicate places. [2025-02-06 09:30:56,026 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 199 transitions, 412 flow [2025-02-06 09:30:56,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:56,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:56,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:56,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:30:56,027 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:30:56,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1381183121, now seen corresponding path program 1 times [2025-02-06 09:30:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928871165] [2025-02-06 09:30:56,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:56,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 09:30:56,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 09:30:56,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:56,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:56,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:56,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928871165] [2025-02-06 09:30:56,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928871165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:56,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:56,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:56,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289794569] [2025-02-06 09:30:56,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:56,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:56,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:56,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:56,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:56,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 235 [2025-02-06 09:30:56,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 199 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:56,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:56,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 235 [2025-02-06 09:30:56,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:56,413 INFO L124 PetriNetUnfolderBase]: 2090/5019 cut-off events. [2025-02-06 09:30:56,414 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2025-02-06 09:30:56,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8324 conditions, 5019 events. 2090/5019 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 40256 event pairs, 809 based on Foata normal form. 0/4540 useless extension candidates. Maximal degree in co-relation 6378. Up to 1626 conditions per place. [2025-02-06 09:30:56,444 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 37 selfloop transitions, 1 changer transitions 6/211 dead transitions. [2025-02-06 09:30:56,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 211 transitions, 522 flow [2025-02-06 09:30:56,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-02-06 09:30:56,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.902127659574468 [2025-02-06 09:30:56,446 INFO L175 Difference]: Start difference. First operand has 206 places, 199 transitions, 412 flow. Second operand 3 states and 636 transitions. [2025-02-06 09:30:56,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 211 transitions, 522 flow [2025-02-06 09:30:56,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 211 transitions, 518 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:56,451 INFO L231 Difference]: Finished difference. Result has 205 places, 194 transitions, 400 flow [2025-02-06 09:30:56,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=205, PETRI_TRANSITIONS=194} [2025-02-06 09:30:56,452 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -14 predicate places. [2025-02-06 09:30:56,452 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 194 transitions, 400 flow [2025-02-06 09:30:56,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:56,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:56,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:56,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:30:56,452 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread4Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:30:56,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:56,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1102906694, now seen corresponding path program 1 times [2025-02-06 09:30:56,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:56,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975891115] [2025-02-06 09:30:56,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:56,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:56,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 09:30:56,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 09:30:56,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:56,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:56,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:56,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975891115] [2025-02-06 09:30:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975891115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:56,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:56,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754241603] [2025-02-06 09:30:56,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:56,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:56,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:56,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:56,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:56,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 235 [2025-02-06 09:30:56,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 194 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:56,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:56,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 235 [2025-02-06 09:30:56,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:56,845 INFO L124 PetriNetUnfolderBase]: 2100/5349 cut-off events. [2025-02-06 09:30:56,845 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-02-06 09:30:56,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8453 conditions, 5349 events. 2100/5349 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 44793 event pairs, 1147 based on Foata normal form. 0/4565 useless extension candidates. Maximal degree in co-relation 7132. Up to 2129 conditions per place. [2025-02-06 09:30:56,869 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 40 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2025-02-06 09:30:56,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 206 transitions, 511 flow [2025-02-06 09:30:56,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2025-02-06 09:30:56,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8950354609929078 [2025-02-06 09:30:56,871 INFO L175 Difference]: Start difference. First operand has 205 places, 194 transitions, 400 flow. Second operand 3 states and 631 transitions. [2025-02-06 09:30:56,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 206 transitions, 511 flow [2025-02-06 09:30:56,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 206 transitions, 510 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:30:56,873 INFO L231 Difference]: Finished difference. Result has 201 places, 193 transitions, 401 flow [2025-02-06 09:30:56,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=201, PETRI_TRANSITIONS=193} [2025-02-06 09:30:56,874 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -18 predicate places. [2025-02-06 09:30:56,874 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 193 transitions, 401 flow [2025-02-06 09:30:56,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:56,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:30:56,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:56,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:30:56,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread2Err1ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-02-06 09:30:56,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:30:56,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1721283784, now seen corresponding path program 1 times [2025-02-06 09:30:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:30:56,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951512462] [2025-02-06 09:30:56,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:30:56,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:30:56,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 09:30:56,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 09:30:56,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:30:56,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:30:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:30:56,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:30:56,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951512462] [2025-02-06 09:30:56,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951512462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:30:56,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:30:56,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:30:56,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593256149] [2025-02-06 09:30:56,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:30:56,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:30:56,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:30:56,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:30:56,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:30:56,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 235 [2025-02-06 09:30:56,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 193 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:56,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:30:56,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 235 [2025-02-06 09:30:56,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:30:57,204 INFO L124 PetriNetUnfolderBase]: 1527/4385 cut-off events. [2025-02-06 09:30:57,204 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-02-06 09:30:57,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6793 conditions, 4385 events. 1527/4385 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 36385 event pairs, 686 based on Foata normal form. 0/3814 useless extension candidates. Maximal degree in co-relation 5472. Up to 1242 conditions per place. [2025-02-06 09:30:57,219 INFO L140 encePairwiseOnDemand]: 233/235 looper letters, 0 selfloop transitions, 0 changer transitions 205/205 dead transitions. [2025-02-06 09:30:57,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 205 transitions, 508 flow [2025-02-06 09:30:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:30:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:30:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2025-02-06 09:30:57,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.900709219858156 [2025-02-06 09:30:57,220 INFO L175 Difference]: Start difference. First operand has 201 places, 193 transitions, 401 flow. Second operand 3 states and 635 transitions. [2025-02-06 09:30:57,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 205 transitions, 508 flow [2025-02-06 09:30:57,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 205 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:30:57,222 INFO L231 Difference]: Finished difference. Result has 200 places, 0 transitions, 0 flow [2025-02-06 09:30:57,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=200, PETRI_TRANSITIONS=0} [2025-02-06 09:30:57,223 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -19 predicate places. [2025-02-06 09:30:57,223 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 0 transitions, 0 flow [2025-02-06 09:30:57,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.33333333333334) internal successors, (607), 3 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (23 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (22 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (21 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (19 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (18 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (9 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (8 of 24 remaining) [2025-02-06 09:30:57,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (7 of 24 remaining) [2025-02-06 09:30:57,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (6 of 24 remaining) [2025-02-06 09:30:57,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 24 remaining) [2025-02-06 09:30:57,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 24 remaining) [2025-02-06 09:30:57,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (3 of 24 remaining) [2025-02-06 09:30:57,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (2 of 24 remaining) [2025-02-06 09:30:57,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 24 remaining) [2025-02-06 09:30:57,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 24 remaining) [2025-02-06 09:30:57,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:30:57,227 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:30:57,233 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:30:57,233 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:30:57,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:30:57 BasicIcfg [2025-02-06 09:30:57,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:30:57,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:30:57,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:30:57,238 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:30:57,238 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:30:49" (3/4) ... [2025-02-06 09:30:57,240 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:30:57,242 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:30:57,242 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:30:57,242 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 09:30:57,242 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-06 09:30:57,247 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 09:30:57,247 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:30:57,247 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 09:30:57,247 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:30:57,301 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:30:57,310 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:30:57,310 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:30:57,310 INFO L158 Benchmark]: Toolchain (without parser) took 8688.66ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 112.8MB in the beginning and 197.1MB in the end (delta: -84.3MB). Peak memory consumption was 523.3MB. Max. memory is 16.1GB. [2025-02-06 09:30:57,310 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:30:57,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.28ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 100.8MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:30:57,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.29ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:30:57,311 INFO L158 Benchmark]: Boogie Preprocessor took 24.74ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.9MB in the end (delta: 888.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:30:57,311 INFO L158 Benchmark]: IcfgBuilder took 419.71ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 76.3MB in the end (delta: 21.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:30:57,311 INFO L158 Benchmark]: TraceAbstraction took 7937.28ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 75.9MB in the beginning and 205.5MB in the end (delta: -129.6MB). Peak memory consumption was 481.4MB. Max. memory is 16.1GB. [2025-02-06 09:30:57,311 INFO L158 Benchmark]: Witness Printer took 71.87ms. Allocated memory is still 755.0MB. Free memory was 205.5MB in the beginning and 197.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:30:57,312 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.30ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.28ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 100.8MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.29ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 98.8MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.74ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.9MB in the end (delta: 888.6kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 419.71ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 76.3MB in the end (delta: 21.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7937.28ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 75.9MB in the beginning and 205.5MB in the end (delta: -129.6MB). Peak memory consumption was 481.4MB. Max. memory is 16.1GB. * Witness Printer took 71.87ms. Allocated memory is still 755.0MB. Free memory was 205.5MB in the beginning and 197.1MB 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: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: 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 9 procedures, 335 locations, 24 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.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 839 IncrementalHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 30 mSDtfsCounter, 839 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=449occurred in iteration=0, InterpolantAutomatonStates: 36, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 912 NumberOfCodeBlocks, 912 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 900 ConstructedInterpolants, 0 QuantifiedInterpolants, 924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:30:57,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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