./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:45:47,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:45:47,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:45:47,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:45:47,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:45:47,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:45:47,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:45:47,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:45:47,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:45:47,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:45:47,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:45:47,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:45:47,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:45:47,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:47,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:45:47,471 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d [2025-03-14 01:45:47,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:45:47,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:45:47,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:45:47,724 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:45:47,724 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:45:47,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-14 01:45:48,832 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46c3ad11/25047f4ca0ad456d9979ee2c66fe1754/FLAG8a201454c [2025-03-14 01:45:49,096 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:45:49,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-03-14 01:45:49,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46c3ad11/25047f4ca0ad456d9979ee2c66fe1754/FLAG8a201454c [2025-03-14 01:45:49,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46c3ad11/25047f4ca0ad456d9979ee2c66fe1754 [2025-03-14 01:45:49,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:45:49,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:45:49,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:49,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:45:49,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:45:49,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:49" (1/1) ... [2025-03-14 01:45:49,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533e0edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49, skipping insertion in model container [2025-03-14 01:45:49,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:49" (1/1) ... [2025-03-14 01:45:49,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:45:49,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:49,597 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:45:49,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:49,639 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:45:49,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49 WrapperNode [2025-03-14 01:45:49,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:49,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:49,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:45:49,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:45:49,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49" (1/1) ... [2025-03-14 01:45:49,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49" (1/1) ... [2025-03-14 01:45:49,680 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 322 [2025-03-14 01:45:49,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:49,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:45:49,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:45:49,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:45:49,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49" (1/1) ... [2025-03-14 01:45:49,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49" (1/1) ... [2025-03-14 01:45:49,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49" (1/1) ... [2025-03-14 01:45:49,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49" (1/1) ... [2025-03-14 01:45:49,701 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49" (1/1) ... [2025-03-14 01:45:49,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49" (1/1) ... [2025-03-14 01:45:49,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49" (1/1) ... [2025-03-14 01:45:49,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49" (1/1) ... [2025-03-14 01:45:49,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:45:49,711 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:45:49,711 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:45:49,712 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:45:49,712 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49" (1/1) ... [2025-03-14 01:45:49,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:49,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:45:49,734 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:45:49,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:45:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:45:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:45:49,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:45:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:45:49,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:45:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:45:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:45:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:45:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:45:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:45:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:45:49,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:45:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:45:49,753 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:45:49,822 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:45:49,824 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:45:50,199 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:45:50,200 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:45:50,200 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:45:50,421 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:45:50,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:50 BoogieIcfgContainer [2025-03-14 01:45:50,423 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:45:50,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:45:50,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:45:50,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:45:50,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:45:49" (1/3) ... [2025-03-14 01:45:50,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579ddf20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:45:50, skipping insertion in model container [2025-03-14 01:45:50,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:49" (2/3) ... [2025-03-14 01:45:50,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579ddf20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:45:50, skipping insertion in model container [2025-03-14 01:45:50,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:50" (3/3) ... [2025-03-14 01:45:50,432 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2025-03-14 01:45:50,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:45:50,443 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-2-nl.wvr.c that has 3 procedures, 271 locations, 1 initial locations, 3 loop locations, and 53 error locations. [2025-03-14 01:45:50,444 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:45:50,508 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:45:50,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 277 places, 280 transitions, 574 flow [2025-03-14 01:45:50,622 INFO L124 PetriNetUnfolderBase]: 10/278 cut-off events. [2025-03-14 01:45:50,625 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:45:50,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 278 events. 10/278 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 480 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 197. Up to 2 conditions per place. [2025-03-14 01:45:50,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 280 transitions, 574 flow [2025-03-14 01:45:50,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 258 transitions, 528 flow [2025-03-14 01:45:50,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:45:50,661 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;@32180253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:45:50,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-03-14 01:45:50,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:45:50,671 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-03-14 01:45:50,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:45:50,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:50,672 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] [2025-03-14 01:45:50,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:50,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:50,677 INFO L85 PathProgramCache]: Analyzing trace with hash 695634315, now seen corresponding path program 1 times [2025-03-14 01:45:50,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:50,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037625362] [2025-03-14 01:45:50,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:50,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-14 01:45:50,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-14 01:45:50,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:50,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:50,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:50,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037625362] [2025-03-14 01:45:50,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037625362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:50,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:50,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:50,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341754295] [2025-03-14 01:45:50,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:50,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:50,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:50,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:50,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:50,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-14 01:45:50,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 258 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:50,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:50,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-14 01:45:50,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:50,989 INFO L124 PetriNetUnfolderBase]: 21/390 cut-off events. [2025-03-14 01:45:50,989 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2025-03-14 01:45:50,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 390 events. 21/390 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1239 event pairs, 14 based on Foata normal form. 7/338 useless extension candidates. Maximal degree in co-relation 282. Up to 42 conditions per place. [2025-03-14 01:45:50,994 INFO L140 encePairwiseOnDemand]: 246/280 looper letters, 13 selfloop transitions, 2 changer transitions 3/226 dead transitions. [2025-03-14 01:45:50,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 226 transitions, 494 flow [2025-03-14 01:45:50,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2025-03-14 01:45:51,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8773809523809524 [2025-03-14 01:45:51,011 INFO L175 Difference]: Start difference. First operand has 257 places, 258 transitions, 528 flow. Second operand 3 states and 737 transitions. [2025-03-14 01:45:51,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 226 transitions, 494 flow [2025-03-14 01:45:51,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 226 transitions, 486 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:45:51,022 INFO L231 Difference]: Finished difference. Result has 228 places, 223 transitions, 454 flow [2025-03-14 01:45:51,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=228, PETRI_TRANSITIONS=223} [2025-03-14 01:45:51,028 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -29 predicate places. [2025-03-14 01:45:51,028 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 223 transitions, 454 flow [2025-03-14 01:45:51,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:51,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:51,029 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] [2025-03-14 01:45:51,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:45:51,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:51,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:51,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2133022697, now seen corresponding path program 1 times [2025-03-14 01:45:51,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:51,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678451654] [2025-03-14 01:45:51,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:51,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:51,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-14 01:45:51,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-14 01:45:51,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:51,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:51,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678451654] [2025-03-14 01:45:51,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678451654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:51,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:51,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:51,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64990718] [2025-03-14 01:45:51,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:51,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:51,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:51,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:51,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:51,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-14 01:45:51,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 223 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:51,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:51,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-14 01:45:51,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:51,165 INFO L124 PetriNetUnfolderBase]: 12/306 cut-off events. [2025-03-14 01:45:51,165 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:45:51,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 306 events. 12/306 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 746 event pairs, 7 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 315. Up to 30 conditions per place. [2025-03-14 01:45:51,168 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 13 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-03-14 01:45:51,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 482 flow [2025-03-14 01:45:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2025-03-14 01:45:51,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8404761904761905 [2025-03-14 01:45:51,170 INFO L175 Difference]: Start difference. First operand has 228 places, 223 transitions, 454 flow. Second operand 3 states and 706 transitions. [2025-03-14 01:45:51,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 482 flow [2025-03-14 01:45:51,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 222 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:51,177 INFO L231 Difference]: Finished difference. Result has 224 places, 222 transitions, 452 flow [2025-03-14 01:45:51,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=224, PETRI_TRANSITIONS=222} [2025-03-14 01:45:51,178 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -33 predicate places. [2025-03-14 01:45:51,178 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 222 transitions, 452 flow [2025-03-14 01:45:51,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:51,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:51,179 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] [2025-03-14 01:45:51,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:45:51,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:51,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:51,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1896287523, now seen corresponding path program 1 times [2025-03-14 01:45:51,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:51,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117733585] [2025-03-14 01:45:51,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:51,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:51,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:45:51,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:45:51,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:51,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:51,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:51,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117733585] [2025-03-14 01:45:51,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117733585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:51,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:51,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103897745] [2025-03-14 01:45:51,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:51,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:51,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:51,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:51,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:51,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-14 01:45:51,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 222 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:51,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:51,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-14 01:45:51,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:51,286 INFO L124 PetriNetUnfolderBase]: 11/327 cut-off events. [2025-03-14 01:45:51,287 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-14 01:45:51,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 327 events. 11/327 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 693 event pairs, 5 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 320. Up to 23 conditions per place. [2025-03-14 01:45:51,288 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 11 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-03-14 01:45:51,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 221 transitions, 476 flow [2025-03-14 01:45:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2025-03-14 01:45:51,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8452380952380952 [2025-03-14 01:45:51,290 INFO L175 Difference]: Start difference. First operand has 224 places, 222 transitions, 452 flow. Second operand 3 states and 710 transitions. [2025-03-14 01:45:51,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 221 transitions, 476 flow [2025-03-14 01:45:51,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 221 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:51,294 INFO L231 Difference]: Finished difference. Result has 223 places, 221 transitions, 450 flow [2025-03-14 01:45:51,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=223, PETRI_TRANSITIONS=221} [2025-03-14 01:45:51,295 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -34 predicate places. [2025-03-14 01:45:51,295 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 221 transitions, 450 flow [2025-03-14 01:45:51,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:51,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:51,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:51,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:45:51,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:51,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:51,296 INFO L85 PathProgramCache]: Analyzing trace with hash -283518507, now seen corresponding path program 1 times [2025-03-14 01:45:51,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:51,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730920690] [2025-03-14 01:45:51,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:51,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:51,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-14 01:45:51,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-14 01:45:51,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:51,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730920690] [2025-03-14 01:45:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730920690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:51,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:51,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450173492] [2025-03-14 01:45:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:51,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:51,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:51,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:51,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-14 01:45:51,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 221 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:51,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:51,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-14 01:45:51,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:51,426 INFO L124 PetriNetUnfolderBase]: 11/326 cut-off events. [2025-03-14 01:45:51,427 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-03-14 01:45:51,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 326 events. 11/326 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 691 event pairs, 5 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 311. Up to 23 conditions per place. [2025-03-14 01:45:51,429 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 11 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-03-14 01:45:51,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 220 transitions, 474 flow [2025-03-14 01:45:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2025-03-14 01:45:51,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8452380952380952 [2025-03-14 01:45:51,431 INFO L175 Difference]: Start difference. First operand has 223 places, 221 transitions, 450 flow. Second operand 3 states and 710 transitions. [2025-03-14 01:45:51,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 220 transitions, 474 flow [2025-03-14 01:45:51,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 220 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:51,435 INFO L231 Difference]: Finished difference. Result has 222 places, 220 transitions, 448 flow [2025-03-14 01:45:51,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=222, PETRI_TRANSITIONS=220} [2025-03-14 01:45:51,437 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -35 predicate places. [2025-03-14 01:45:51,437 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 220 transitions, 448 flow [2025-03-14 01:45:51,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:51,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:51,438 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] [2025-03-14 01:45:51,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:45:51,438 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:51,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1179648991, now seen corresponding path program 1 times [2025-03-14 01:45:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:51,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221297892] [2025-03-14 01:45:51,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:51,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-14 01:45:51,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-14 01:45:51,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:51,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:51,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:51,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221297892] [2025-03-14 01:45:51,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221297892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:51,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:51,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:51,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259896979] [2025-03-14 01:45:51,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:51,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:51,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:51,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:51,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:51,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 280 [2025-03-14 01:45:51,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 220 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:51,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:51,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 280 [2025-03-14 01:45:51,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:51,560 INFO L124 PetriNetUnfolderBase]: 11/328 cut-off events. [2025-03-14 01:45:51,560 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-03-14 01:45:51,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 328 events. 11/328 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 700 event pairs, 2 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 305. Up to 14 conditions per place. [2025-03-14 01:45:51,561 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 12 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-03-14 01:45:51,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 223 transitions, 483 flow [2025-03-14 01:45:51,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2025-03-14 01:45:51,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8607142857142858 [2025-03-14 01:45:51,563 INFO L175 Difference]: Start difference. First operand has 222 places, 220 transitions, 448 flow. Second operand 3 states and 723 transitions. [2025-03-14 01:45:51,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 223 transitions, 483 flow [2025-03-14 01:45:51,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 223 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:51,568 INFO L231 Difference]: Finished difference. Result has 222 places, 220 transitions, 452 flow [2025-03-14 01:45:51,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=222, PETRI_TRANSITIONS=220} [2025-03-14 01:45:51,569 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -35 predicate places. [2025-03-14 01:45:51,569 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 220 transitions, 452 flow [2025-03-14 01:45:51,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:51,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:51,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:51,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:45:51,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:51,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 742873786, now seen corresponding path program 1 times [2025-03-14 01:45:51,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:51,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465394256] [2025-03-14 01:45:51,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:51,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:51,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-14 01:45:51,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-14 01:45:51,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:51,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:51,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:51,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465394256] [2025-03-14 01:45:51,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465394256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:51,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:51,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:51,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558790560] [2025-03-14 01:45:51,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:51,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:51,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:51,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:51,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:51,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-14 01:45:51,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 220 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:51,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:51,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-14 01:45:51,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:51,674 INFO L124 PetriNetUnfolderBase]: 11/327 cut-off events. [2025-03-14 01:45:51,674 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-03-14 01:45:51,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 327 events. 11/327 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 701 event pairs, 5 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 168. Up to 25 conditions per place. [2025-03-14 01:45:51,676 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 11 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2025-03-14 01:45:51,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 219 transitions, 476 flow [2025-03-14 01:45:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2025-03-14 01:45:51,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2025-03-14 01:45:51,678 INFO L175 Difference]: Start difference. First operand has 222 places, 220 transitions, 452 flow. Second operand 3 states and 712 transitions. [2025-03-14 01:45:51,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 219 transitions, 476 flow [2025-03-14 01:45:51,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 219 transitions, 474 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:51,681 INFO L231 Difference]: Finished difference. Result has 222 places, 219 transitions, 452 flow [2025-03-14 01:45:51,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=222, PETRI_TRANSITIONS=219} [2025-03-14 01:45:51,682 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -35 predicate places. [2025-03-14 01:45:51,682 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 219 transitions, 452 flow [2025-03-14 01:45:51,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:51,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:51,683 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] [2025-03-14 01:45:51,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:45:51,683 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:51,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:51,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1012798503, now seen corresponding path program 1 times [2025-03-14 01:45:51,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:51,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286792971] [2025-03-14 01:45:51,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:51,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-14 01:45:51,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-14 01:45:51,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:51,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:51,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:51,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286792971] [2025-03-14 01:45:51,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286792971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:51,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:51,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:51,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700913229] [2025-03-14 01:45:51,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:51,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:51,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:51,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:51,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:51,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 280 [2025-03-14 01:45:51,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 219 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:51,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:51,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 280 [2025-03-14 01:45:51,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:51,797 INFO L124 PetriNetUnfolderBase]: 11/326 cut-off events. [2025-03-14 01:45:51,797 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-14 01:45:51,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 326 events. 11/326 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 696 event pairs, 5 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 304. Up to 23 conditions per place. [2025-03-14 01:45:51,798 INFO L140 encePairwiseOnDemand]: 278/280 looper letters, 10 selfloop transitions, 1 changer transitions 0/218 dead transitions. [2025-03-14 01:45:51,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 218 transitions, 472 flow [2025-03-14 01:45:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2025-03-14 01:45:51,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8559523809523809 [2025-03-14 01:45:51,800 INFO L175 Difference]: Start difference. First operand has 222 places, 219 transitions, 452 flow. Second operand 3 states and 719 transitions. [2025-03-14 01:45:51,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 218 transitions, 472 flow [2025-03-14 01:45:51,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 218 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:51,803 INFO L231 Difference]: Finished difference. Result has 221 places, 218 transitions, 448 flow [2025-03-14 01:45:51,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=221, PETRI_TRANSITIONS=218} [2025-03-14 01:45:51,803 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -36 predicate places. [2025-03-14 01:45:51,803 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 218 transitions, 448 flow [2025-03-14 01:45:51,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:51,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:51,804 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] [2025-03-14 01:45:51,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:45:51,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:51,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:51,805 INFO L85 PathProgramCache]: Analyzing trace with hash -906755394, now seen corresponding path program 1 times [2025-03-14 01:45:51,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:51,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182754330] [2025-03-14 01:45:51,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:51,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:51,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-14 01:45:51,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:45:51,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:51,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:52,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:52,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182754330] [2025-03-14 01:45:52,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182754330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:52,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:52,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:52,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154796198] [2025-03-14 01:45:52,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:52,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:52,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:52,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:52,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:52,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 280 [2025-03-14 01:45:52,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 218 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 227.5) internal successors, (1365), 6 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:52,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:52,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 280 [2025-03-14 01:45:52,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:52,372 INFO L124 PetriNetUnfolderBase]: 11/325 cut-off events. [2025-03-14 01:45:52,372 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-14 01:45:52,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 325 events. 11/325 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 688 event pairs, 5 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 313. Up to 30 conditions per place. [2025-03-14 01:45:52,374 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 16 selfloop transitions, 5 changer transitions 0/217 dead transitions. [2025-03-14 01:45:52,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 217 transitions, 488 flow [2025-03-14 01:45:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1377 transitions. [2025-03-14 01:45:52,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8196428571428571 [2025-03-14 01:45:52,380 INFO L175 Difference]: Start difference. First operand has 221 places, 218 transitions, 448 flow. Second operand 6 states and 1377 transitions. [2025-03-14 01:45:52,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 217 transitions, 488 flow [2025-03-14 01:45:52,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 217 transitions, 487 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:52,383 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 455 flow [2025-03-14 01:45:52,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2025-03-14 01:45:52,384 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -33 predicate places. [2025-03-14 01:45:52,385 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 455 flow [2025-03-14 01:45:52,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 227.5) internal successors, (1365), 6 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:52,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:52,386 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] [2025-03-14 01:45:52,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:45:52,387 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:52,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash 448625237, now seen corresponding path program 1 times [2025-03-14 01:45:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846066925] [2025-03-14 01:45:52,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:52,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:52,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-14 01:45:52,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:45:52,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:52,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:52,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:52,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846066925] [2025-03-14 01:45:52,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846066925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:52,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:52,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:52,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950348732] [2025-03-14 01:45:52,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:52,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:52,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:52,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:52,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:52,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-14 01:45:52,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:52,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:52,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-14 01:45:52,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:52,507 INFO L124 PetriNetUnfolderBase]: 11/324 cut-off events. [2025-03-14 01:45:52,508 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-03-14 01:45:52,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 324 events. 11/324 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 682 event pairs, 5 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 354. Up to 25 conditions per place. [2025-03-14 01:45:52,509 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 11 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2025-03-14 01:45:52,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 216 transitions, 479 flow [2025-03-14 01:45:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2025-03-14 01:45:52,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2025-03-14 01:45:52,512 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 455 flow. Second operand 3 states and 712 transitions. [2025-03-14 01:45:52,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 216 transitions, 479 flow [2025-03-14 01:45:52,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 216 transitions, 469 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:45:52,515 INFO L231 Difference]: Finished difference. Result has 220 places, 216 transitions, 447 flow [2025-03-14 01:45:52,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=220, PETRI_TRANSITIONS=216} [2025-03-14 01:45:52,516 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -37 predicate places. [2025-03-14 01:45:52,516 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 216 transitions, 447 flow [2025-03-14 01:45:52,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:52,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:52,517 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] [2025-03-14 01:45:52,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:45:52,517 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:52,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:52,518 INFO L85 PathProgramCache]: Analyzing trace with hash 829168575, now seen corresponding path program 1 times [2025-03-14 01:45:52,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:52,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619441028] [2025-03-14 01:45:52,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:52,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:52,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-14 01:45:52,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-14 01:45:52,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:52,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:52,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:52,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619441028] [2025-03-14 01:45:52,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619441028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:52,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:52,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:52,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758138551] [2025-03-14 01:45:52,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:52,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:52,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:52,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:52,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:52,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-14 01:45:52,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 216 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:52,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:52,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-14 01:45:52,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:52,618 INFO L124 PetriNetUnfolderBase]: 19/302 cut-off events. [2025-03-14 01:45:52,619 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:45:52,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 302 events. 19/302 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 740 event pairs, 9 based on Foata normal form. 1/261 useless extension candidates. Maximal degree in co-relation 302. Up to 38 conditions per place. [2025-03-14 01:45:52,620 INFO L140 encePairwiseOnDemand]: 276/280 looper letters, 12 selfloop transitions, 1 changer transitions 2/213 dead transitions. [2025-03-14 01:45:52,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 469 flow [2025-03-14 01:45:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2025-03-14 01:45:52,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8404761904761905 [2025-03-14 01:45:52,622 INFO L175 Difference]: Start difference. First operand has 220 places, 216 transitions, 447 flow. Second operand 3 states and 706 transitions. [2025-03-14 01:45:52,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 469 flow [2025-03-14 01:45:52,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:52,624 INFO L231 Difference]: Finished difference. Result has 217 places, 211 transitions, 435 flow [2025-03-14 01:45:52,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=217, PETRI_TRANSITIONS=211} [2025-03-14 01:45:52,625 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -40 predicate places. [2025-03-14 01:45:52,625 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 211 transitions, 435 flow [2025-03-14 01:45:52,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:52,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:52,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:52,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:45:52,625 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:52,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash 982260674, now seen corresponding path program 1 times [2025-03-14 01:45:52,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:52,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923604456] [2025-03-14 01:45:52,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:52,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:52,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-14 01:45:52,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-14 01:45:52,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:52,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:52,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:52,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923604456] [2025-03-14 01:45:52,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923604456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:52,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:52,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:52,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259693824] [2025-03-14 01:45:52,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:52,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:52,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:52,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:52,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:52,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 280 [2025-03-14 01:45:52,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 211 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:52,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:52,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 280 [2025-03-14 01:45:52,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:52,729 INFO L124 PetriNetUnfolderBase]: 33/377 cut-off events. [2025-03-14 01:45:52,729 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2025-03-14 01:45:52,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 377 events. 33/377 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1208 event pairs, 9 based on Foata normal form. 1/332 useless extension candidates. Maximal degree in co-relation 413. Up to 38 conditions per place. [2025-03-14 01:45:52,731 INFO L140 encePairwiseOnDemand]: 272/280 looper letters, 14 selfloop transitions, 5 changer transitions 0/211 dead transitions. [2025-03-14 01:45:52,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 211 transitions, 478 flow [2025-03-14 01:45:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2025-03-14 01:45:52,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416666666666667 [2025-03-14 01:45:52,756 INFO L175 Difference]: Start difference. First operand has 217 places, 211 transitions, 435 flow. Second operand 3 states and 707 transitions. [2025-03-14 01:45:52,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 211 transitions, 478 flow [2025-03-14 01:45:52,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 211 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:52,759 INFO L231 Difference]: Finished difference. Result has 213 places, 208 transitions, 438 flow [2025-03-14 01:45:52,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=213, PETRI_TRANSITIONS=208} [2025-03-14 01:45:52,760 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -44 predicate places. [2025-03-14 01:45:52,760 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 208 transitions, 438 flow [2025-03-14 01:45:52,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:52,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:52,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:52,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:45:52,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:52,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash -940268411, now seen corresponding path program 1 times [2025-03-14 01:45:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:52,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841549664] [2025-03-14 01:45:52,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:52,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:52,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-14 01:45:52,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-14 01:45:52,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:52,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:52,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:52,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841549664] [2025-03-14 01:45:52,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841549664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:52,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:52,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535407238] [2025-03-14 01:45:52,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:52,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:52,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:52,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:52,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:52,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 280 [2025-03-14 01:45:52,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 208 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:52,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:52,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 280 [2025-03-14 01:45:52,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:52,881 INFO L124 PetriNetUnfolderBase]: 54/500 cut-off events. [2025-03-14 01:45:52,881 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-14 01:45:52,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 500 events. 54/500 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1975 event pairs, 10 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 588. Up to 87 conditions per place. [2025-03-14 01:45:52,885 INFO L140 encePairwiseOnDemand]: 274/280 looper letters, 19 selfloop transitions, 3 changer transitions 0/212 dead transitions. [2025-03-14 01:45:52,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 212 transitions, 493 flow [2025-03-14 01:45:52,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-14 01:45:52,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-03-14 01:45:52,887 INFO L175 Difference]: Start difference. First operand has 213 places, 208 transitions, 438 flow. Second operand 3 states and 714 transitions. [2025-03-14 01:45:52,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 212 transitions, 493 flow [2025-03-14 01:45:52,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 212 transitions, 483 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:52,890 INFO L231 Difference]: Finished difference. Result has 211 places, 208 transitions, 443 flow [2025-03-14 01:45:52,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=211, PETRI_TRANSITIONS=208} [2025-03-14 01:45:52,892 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -46 predicate places. [2025-03-14 01:45:52,892 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 208 transitions, 443 flow [2025-03-14 01:45:52,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:52,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:52,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:52,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:45:52,893 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:52,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:52,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1322327773, now seen corresponding path program 1 times [2025-03-14 01:45:52,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:52,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050578174] [2025-03-14 01:45:52,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:52,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:52,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-14 01:45:52,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-14 01:45:52,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:52,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:52,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:52,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050578174] [2025-03-14 01:45:52,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050578174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:52,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:52,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:52,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048356850] [2025-03-14 01:45:52,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:52,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:52,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:52,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:52,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:52,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-14 01:45:52,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 208 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:52,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:52,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-14 01:45:52,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:52,996 INFO L124 PetriNetUnfolderBase]: 67/488 cut-off events. [2025-03-14 01:45:52,996 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2025-03-14 01:45:52,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 488 events. 67/488 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1994 event pairs, 26 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 592. Up to 100 conditions per place. [2025-03-14 01:45:52,998 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 16 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2025-03-14 01:45:52,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 210 transitions, 484 flow [2025-03-14 01:45:52,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-14 01:45:53,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-03-14 01:45:53,000 INFO L175 Difference]: Start difference. First operand has 211 places, 208 transitions, 443 flow. Second operand 3 states and 714 transitions. [2025-03-14 01:45:53,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 210 transitions, 484 flow [2025-03-14 01:45:53,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 210 transitions, 484 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:45:53,003 INFO L231 Difference]: Finished difference. Result has 212 places, 207 transitions, 445 flow [2025-03-14 01:45:53,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=212, PETRI_TRANSITIONS=207} [2025-03-14 01:45:53,003 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -45 predicate places. [2025-03-14 01:45:53,003 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 207 transitions, 445 flow [2025-03-14 01:45:53,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:53,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:45:53,004 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:53,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1107212790, now seen corresponding path program 1 times [2025-03-14 01:45:53,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420620118] [2025-03-14 01:45:53,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-14 01:45:53,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-14 01:45:53,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:53,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:53,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420620118] [2025-03-14 01:45:53,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420620118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:53,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:53,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:53,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441017675] [2025-03-14 01:45:53,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:53,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:53,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:53,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:53,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:53,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 280 [2025-03-14 01:45:53,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 207 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:53,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 280 [2025-03-14 01:45:53,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,121 INFO L124 PetriNetUnfolderBase]: 57/447 cut-off events. [2025-03-14 01:45:53,121 INFO L125 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2025-03-14 01:45:53,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 447 events. 57/447 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1665 event pairs, 23 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 566. Up to 81 conditions per place. [2025-03-14 01:45:53,123 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 17 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2025-03-14 01:45:53,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 209 transitions, 492 flow [2025-03-14 01:45:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2025-03-14 01:45:53,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464285714285714 [2025-03-14 01:45:53,125 INFO L175 Difference]: Start difference. First operand has 212 places, 207 transitions, 445 flow. Second operand 3 states and 711 transitions. [2025-03-14 01:45:53,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 209 transitions, 492 flow [2025-03-14 01:45:53,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 209 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:53,128 INFO L231 Difference]: Finished difference. Result has 211 places, 206 transitions, 443 flow [2025-03-14 01:45:53,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=439, 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=443, PETRI_PLACES=211, PETRI_TRANSITIONS=206} [2025-03-14 01:45:53,129 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -46 predicate places. [2025-03-14 01:45:53,129 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 206 transitions, 443 flow [2025-03-14 01:45:53,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:53,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:45:53,130 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:53,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1933539703, now seen corresponding path program 1 times [2025-03-14 01:45:53,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802166908] [2025-03-14 01:45:53,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-14 01:45:53,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-14 01:45:53,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:53,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:53,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802166908] [2025-03-14 01:45:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802166908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:53,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:53,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699894432] [2025-03-14 01:45:53,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:53,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:53,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:53,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:53,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 280 [2025-03-14 01:45:53,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 206 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:53,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 280 [2025-03-14 01:45:53,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,231 INFO L124 PetriNetUnfolderBase]: 57/444 cut-off events. [2025-03-14 01:45:53,231 INFO L125 PetriNetUnfolderBase]: For 38/43 co-relation queries the response was YES. [2025-03-14 01:45:53,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 444 events. 57/444 cut-off events. For 38/43 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1635 event pairs, 23 based on Foata normal form. 1/400 useless extension candidates. Maximal degree in co-relation 563. Up to 81 conditions per place. [2025-03-14 01:45:53,233 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 17 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2025-03-14 01:45:53,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 208 transitions, 490 flow [2025-03-14 01:45:53,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2025-03-14 01:45:53,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464285714285714 [2025-03-14 01:45:53,235 INFO L175 Difference]: Start difference. First operand has 211 places, 206 transitions, 443 flow. Second operand 3 states and 711 transitions. [2025-03-14 01:45:53,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 208 transitions, 490 flow [2025-03-14 01:45:53,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 208 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:53,238 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 441 flow [2025-03-14 01:45:53,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=437, 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=441, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2025-03-14 01:45:53,239 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -47 predicate places. [2025-03-14 01:45:53,239 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 441 flow [2025-03-14 01:45:53,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:53,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:45:53,240 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:53,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash 854837483, now seen corresponding path program 1 times [2025-03-14 01:45:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103967295] [2025-03-14 01:45:53,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-14 01:45:53,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-14 01:45:53,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:53,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:53,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103967295] [2025-03-14 01:45:53,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103967295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:53,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:53,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:53,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725681964] [2025-03-14 01:45:53,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:53,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:53,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:53,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:53,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-14 01:45:53,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:53,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-14 01:45:53,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,363 INFO L124 PetriNetUnfolderBase]: 62/470 cut-off events. [2025-03-14 01:45:53,363 INFO L125 PetriNetUnfolderBase]: For 23/24 co-relation queries the response was YES. [2025-03-14 01:45:53,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 470 events. 62/470 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1829 event pairs, 19 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 562. Up to 69 conditions per place. [2025-03-14 01:45:53,365 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 13 selfloop transitions, 2 changer transitions 4/206 dead transitions. [2025-03-14 01:45:53,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 206 transitions, 476 flow [2025-03-14 01:45:53,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-03-14 01:45:53,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488095238095238 [2025-03-14 01:45:53,367 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 441 flow. Second operand 3 states and 713 transitions. [2025-03-14 01:45:53,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 206 transitions, 476 flow [2025-03-14 01:45:53,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 206 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:53,369 INFO L231 Difference]: Finished difference. Result has 208 places, 199 transitions, 429 flow [2025-03-14 01:45:53,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=433, 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=429, PETRI_PLACES=208, PETRI_TRANSITIONS=199} [2025-03-14 01:45:53,370 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -49 predicate places. [2025-03-14 01:45:53,370 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 199 transitions, 429 flow [2025-03-14 01:45:53,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:53,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:45:53,371 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:53,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1837169235, now seen corresponding path program 1 times [2025-03-14 01:45:53,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560316686] [2025-03-14 01:45:53,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-14 01:45:53,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-14 01:45:53,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:53,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:53,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:53,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560316686] [2025-03-14 01:45:53,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560316686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:53,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:53,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:53,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604237496] [2025-03-14 01:45:53,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:53,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:53,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:53,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:53,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:53,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 280 [2025-03-14 01:45:53,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 199 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:53,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 280 [2025-03-14 01:45:53,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,485 INFO L124 PetriNetUnfolderBase]: 82/477 cut-off events. [2025-03-14 01:45:53,485 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2025-03-14 01:45:53,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 477 events. 82/477 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1940 event pairs, 29 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 622. Up to 107 conditions per place. [2025-03-14 01:45:53,487 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 15 selfloop transitions, 2 changer transitions 0/201 dead transitions. [2025-03-14 01:45:53,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 201 transitions, 468 flow [2025-03-14 01:45:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-03-14 01:45:53,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8488095238095238 [2025-03-14 01:45:53,488 INFO L175 Difference]: Start difference. First operand has 208 places, 199 transitions, 429 flow. Second operand 3 states and 713 transitions. [2025-03-14 01:45:53,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 201 transitions, 468 flow [2025-03-14 01:45:53,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 201 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:53,492 INFO L231 Difference]: Finished difference. Result has 203 places, 198 transitions, 427 flow [2025-03-14 01:45:53,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=203, PETRI_TRANSITIONS=198} [2025-03-14 01:45:53,492 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -54 predicate places. [2025-03-14 01:45:53,492 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 198 transitions, 427 flow [2025-03-14 01:45:53,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:53,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:45:53,493 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:53,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,493 INFO L85 PathProgramCache]: Analyzing trace with hash -339475630, now seen corresponding path program 1 times [2025-03-14 01:45:53,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263960212] [2025-03-14 01:45:53,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-14 01:45:53,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-14 01:45:53,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:53,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:53,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:53,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263960212] [2025-03-14 01:45:53,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263960212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:53,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:53,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:53,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776456368] [2025-03-14 01:45:53,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:53,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:53,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:53,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:53,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:53,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-14 01:45:53,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 198 transitions, 427 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:53,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-14 01:45:53,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,611 INFO L124 PetriNetUnfolderBase]: 52/434 cut-off events. [2025-03-14 01:45:53,611 INFO L125 PetriNetUnfolderBase]: For 21/22 co-relation queries the response was YES. [2025-03-14 01:45:53,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 434 events. 52/434 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1575 event pairs, 12 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 523. Up to 50 conditions per place. [2025-03-14 01:45:53,613 INFO L140 encePairwiseOnDemand]: 275/280 looper letters, 11 selfloop transitions, 2 changer transitions 4/199 dead transitions. [2025-03-14 01:45:53,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 199 transitions, 460 flow [2025-03-14 01:45:53,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2025-03-14 01:45:53,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8511904761904762 [2025-03-14 01:45:53,615 INFO L175 Difference]: Start difference. First operand has 203 places, 198 transitions, 427 flow. Second operand 3 states and 715 transitions. [2025-03-14 01:45:53,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 199 transitions, 460 flow [2025-03-14 01:45:53,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 199 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:53,619 INFO L231 Difference]: Finished difference. Result has 201 places, 192 transitions, 414 flow [2025-03-14 01:45:53,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=414, PETRI_PLACES=201, PETRI_TRANSITIONS=192} [2025-03-14 01:45:53,619 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -56 predicate places. [2025-03-14 01:45:53,619 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 192 transitions, 414 flow [2025-03-14 01:45:53,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:53,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:45:53,620 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:53,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1301445333, now seen corresponding path program 1 times [2025-03-14 01:45:53,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964906848] [2025-03-14 01:45:53,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-14 01:45:53,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-14 01:45:53,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:53,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:53,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964906848] [2025-03-14 01:45:53,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964906848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:53,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:53,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:45:53,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390025177] [2025-03-14 01:45:53,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:53,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:53,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:53,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:53,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:53,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 280 [2025-03-14 01:45:53,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 192 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:53,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 280 [2025-03-14 01:45:53,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,879 INFO L124 PetriNetUnfolderBase]: 24/366 cut-off events. [2025-03-14 01:45:53,879 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-14 01:45:53,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 366 events. 24/366 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 978 event pairs, 3 based on Foata normal form. 1/349 useless extension candidates. Maximal degree in co-relation 393. Up to 33 conditions per place. [2025-03-14 01:45:53,880 INFO L140 encePairwiseOnDemand]: 276/280 looper letters, 11 selfloop transitions, 3 changer transitions 0/195 dead transitions. [2025-03-14 01:45:53,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 195 transitions, 449 flow [2025-03-14 01:45:53,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2025-03-14 01:45:53,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8595238095238096 [2025-03-14 01:45:53,882 INFO L175 Difference]: Start difference. First operand has 201 places, 192 transitions, 414 flow. Second operand 3 states and 722 transitions. [2025-03-14 01:45:53,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 195 transitions, 449 flow [2025-03-14 01:45:53,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 195 transitions, 445 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:53,885 INFO L231 Difference]: Finished difference. Result has 198 places, 194 transitions, 429 flow [2025-03-14 01:45:53,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=198, PETRI_TRANSITIONS=194} [2025-03-14 01:45:53,886 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -59 predicate places. [2025-03-14 01:45:53,886 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 194 transitions, 429 flow [2025-03-14 01:45:53,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:53,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 01:45:53,887 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-03-14 01:45:53,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1150565793, now seen corresponding path program 1 times [2025-03-14 01:45:53,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031404826] [2025-03-14 01:45:53,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-14 01:45:53,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-14 01:45:53,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:53,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:53,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:53,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031404826] [2025-03-14 01:45:53,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031404826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:53,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:53,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:53,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620789452] [2025-03-14 01:45:53,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:53,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:53,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:53,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:53,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:53,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 280 [2025-03-14 01:45:53,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 194 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:53,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 280 [2025-03-14 01:45:53,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,985 INFO L124 PetriNetUnfolderBase]: 40/381 cut-off events. [2025-03-14 01:45:53,986 INFO L125 PetriNetUnfolderBase]: For 54/61 co-relation queries the response was YES. [2025-03-14 01:45:53,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 381 events. 40/381 cut-off events. For 54/61 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1184 event pairs, 12 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 468. Up to 61 conditions per place. [2025-03-14 01:45:53,987 INFO L140 encePairwiseOnDemand]: 277/280 looper letters, 0 selfloop transitions, 0 changer transitions 196/196 dead transitions. [2025-03-14 01:45:53,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 196 transitions, 472 flow [2025-03-14 01:45:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-03-14 01:45:53,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-03-14 01:45:53,989 INFO L175 Difference]: Start difference. First operand has 198 places, 194 transitions, 429 flow. Second operand 3 states and 714 transitions. [2025-03-14 01:45:53,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 196 transitions, 472 flow [2025-03-14 01:45:53,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 196 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:53,991 INFO L231 Difference]: Finished difference. Result has 198 places, 0 transitions, 0 flow [2025-03-14 01:45:53,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=280, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=198, PETRI_TRANSITIONS=0} [2025-03-14 01:45:53,991 INFO L279 CegarLoopForPetriNet]: 257 programPoint places, -59 predicate places. [2025-03-14 01:45:53,991 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 0 transitions, 0 flow [2025-03-14 01:45:53,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:45:53,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2025-03-14 01:45:53,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2025-03-14 01:45:53,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2025-03-14 01:45:53,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (38 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2025-03-14 01:45:53,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2025-03-14 01:45:53,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2025-03-14 01:45:53,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2025-03-14 01:45:53,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2025-03-14 01:45:53,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2025-03-14 01:45:53,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2025-03-14 01:45:53,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2025-03-14 01:45:53,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2025-03-14 01:45:53,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2025-03-14 01:45:53,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2025-03-14 01:45:53,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2025-03-14 01:45:53,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2025-03-14 01:45:53,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:45:53,998 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:54,003 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:45:54,004 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:45:54,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:45:54 BasicIcfg [2025-03-14 01:45:54,011 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:45:54,011 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:45:54,011 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:45:54,011 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:45:54,012 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:50" (3/4) ... [2025-03-14 01:45:54,013 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:45:54,015 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:45:54,016 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:45:54,019 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-14 01:45:54,019 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:45:54,020 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:45:54,020 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:45:54,090 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:45:54,090 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:45:54,090 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:45:54,091 INFO L158 Benchmark]: Toolchain (without parser) took 4661.99ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 112.7MB in the beginning and 205.1MB in the end (delta: -92.4MB). Peak memory consumption was 143.1MB. Max. memory is 16.1GB. [2025-03-14 01:45:54,091 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:45:54,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.04ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:45:54,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.38ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 97.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:45:54,092 INFO L158 Benchmark]: Boogie Preprocessor took 26.35ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:45:54,092 INFO L158 Benchmark]: IcfgBuilder took 712.21ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 95.1MB in the end (delta: 544.4kB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2025-03-14 01:45:54,092 INFO L158 Benchmark]: TraceAbstraction took 3585.23ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 95.1MB in the beginning and 75.8MB in the end (delta: 19.4MB). Peak memory consumption was 120.4MB. Max. memory is 16.1GB. [2025-03-14 01:45:54,092 INFO L158 Benchmark]: Witness Printer took 79.15ms. Allocated memory is still 243.3MB. Free memory was 75.8MB in the beginning and 205.1MB in the end (delta: -129.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:45:54,093 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.25ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.04ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.38ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 97.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.35ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 712.21ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 95.1MB in the end (delta: 544.4kB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3585.23ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 95.1MB in the beginning and 75.8MB in the end (delta: 19.4MB). Peak memory consumption was 120.4MB. Max. memory is 16.1GB. * Witness Printer took 79.15ms. Allocated memory is still 243.3MB. Free memory was 75.8MB in the beginning and 205.1MB in the end (delta: -129.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: 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: 52]: 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: 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: 55]: 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: 55]: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: 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: 72]: 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: 72]: 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: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: 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 - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: 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 5 procedures, 372 locations, 94 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: 3.5s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 630 IncrementalHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 66 mSDtfsCounter, 630 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=0, InterpolantAutomatonStates: 63, 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, 1.2s InterpolantComputationTime, 1794 NumberOfCodeBlocks, 1794 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1774 ConstructedInterpolants, 0 QuantifiedInterpolants, 2053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 53 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:45:54,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE