./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:31:09,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:31:09,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:31:09,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:31:09,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:31:09,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:31:09,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:31:09,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:31:09,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:31:09,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:31:09,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:31:09,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:31:09,288 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:31:09,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:31:09,288 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:31:09,288 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:31:09,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:31:09,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:31:09,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:31:09,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:31:09,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:31:09,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:31:09,288 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:31:09,288 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:31:09,289 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:31:09,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:31:09,289 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:31:09,289 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:31:09,289 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:31:09,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:31:09,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:31:09,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:31:09,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:31:09,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:31:09,289 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:31:09,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:31:09,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:31:09,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:31:09,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:31:09,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:31:09,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:31:09,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:31:09,294 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe [2025-02-06 09:31:09,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:31:09,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:31:09,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:31:09,523 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:31:09,524 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:31:09,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c [2025-02-06 09:31:10,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/296c492db/1717bbe16a6847e3822cb5c7ead94d98/FLAGa0cfc8985 [2025-02-06 09:31:11,009 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:31:11,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-ring.wvr.c [2025-02-06 09:31:11,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/296c492db/1717bbe16a6847e3822cb5c7ead94d98/FLAGa0cfc8985 [2025-02-06 09:31:11,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/296c492db/1717bbe16a6847e3822cb5c7ead94d98 [2025-02-06 09:31:11,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:31:11,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:31:11,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:31:11,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:31:11,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:31:11,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:31:11" (1/1) ... [2025-02-06 09:31:11,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b185fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11, skipping insertion in model container [2025-02-06 09:31:11,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:31:11" (1/1) ... [2025-02-06 09:31:11,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:31:11,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:31:11,471 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:31:11,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:31:11,506 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:31:11,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11 WrapperNode [2025-02-06 09:31:11,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:31:11,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:31:11,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:31:11,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:31:11,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11" (1/1) ... [2025-02-06 09:31:11,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11" (1/1) ... [2025-02-06 09:31:11,545 INFO L138 Inliner]: procedures = 24, calls = 47, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 598 [2025-02-06 09:31:11,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:31:11,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:31:11,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:31:11,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:31:11,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11" (1/1) ... [2025-02-06 09:31:11,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11" (1/1) ... [2025-02-06 09:31:11,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11" (1/1) ... [2025-02-06 09:31:11,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11" (1/1) ... [2025-02-06 09:31:11,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11" (1/1) ... [2025-02-06 09:31:11,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11" (1/1) ... [2025-02-06 09:31:11,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11" (1/1) ... [2025-02-06 09:31:11,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11" (1/1) ... [2025-02-06 09:31:11,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:31:11,577 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:31:11,577 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:31:11,578 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:31:11,578 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11" (1/1) ... [2025-02-06 09:31:11,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:31:11,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:31:11,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:31:11,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:31:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:31:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:31:11,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:31:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:31:11,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:31:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:31:11,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:31:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:31:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:31:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 09:31:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 09:31:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:31:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:31:11,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:31:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:31:11,639 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:31:11,727 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:31:11,728 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:31:12,417 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:31:12,418 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:31:12,690 WARN L170 LargeBlockEncoding]: Complex 2:6 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-02-06 09:31:12,701 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:31:12,702 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:31:12,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:31:12 BoogieIcfgContainer [2025-02-06 09:31:12,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:31:12,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:31:12,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:31:12,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:31:12,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:31:11" (1/3) ... [2025-02-06 09:31:12,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fd6927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:31:12, skipping insertion in model container [2025-02-06 09:31:12,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:31:11" (2/3) ... [2025-02-06 09:31:12,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fd6927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:31:12, skipping insertion in model container [2025-02-06 09:31:12,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:31:12" (3/3) ... [2025-02-06 09:31:12,709 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2025-02-06 09:31:12,754 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:31:12,756 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-ring.wvr.c that has 4 procedures, 439 locations, 1 initial locations, 6 loop locations, and 90 error locations. [2025-02-06 09:31:12,757 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:31:12,866 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:31:12,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 448 places, 461 transitions, 943 flow [2025-02-06 09:31:13,056 INFO L124 PetriNetUnfolderBase]: 23/458 cut-off events. [2025-02-06 09:31:13,058 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:31:13,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 458 events. 23/458 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 794 event pairs, 0 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 407. Up to 2 conditions per place. [2025-02-06 09:31:13,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 448 places, 461 transitions, 943 flow [2025-02-06 09:31:13,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 429 places, 441 transitions, 900 flow [2025-02-06 09:31:13,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:31:13,096 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;@6c8ee566, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:31:13,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 159 error locations. [2025-02-06 09:31:13,102 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:31:13,103 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-02-06 09:31:13,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:31:13,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:13,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:13,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:13,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:13,110 INFO L85 PathProgramCache]: Analyzing trace with hash -846795745, now seen corresponding path program 1 times [2025-02-06 09:31:13,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:13,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284369278] [2025-02-06 09:31:13,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:13,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:13,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:31:13,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:31:13,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:13,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:13,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:13,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284369278] [2025-02-06 09:31:13,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284369278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:13,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:13,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:13,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277210650] [2025-02-06 09:31:13,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:13,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:13,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:13,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:13,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:13,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 461 [2025-02-06 09:31:13,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 441 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:13,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:13,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 461 [2025-02-06 09:31:13,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:13,574 INFO L124 PetriNetUnfolderBase]: 148/865 cut-off events. [2025-02-06 09:31:13,576 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 09:31:13,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 865 events. 148/865 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3687 event pairs, 92 based on Foata normal form. 73/837 useless extension candidates. Maximal degree in co-relation 754. Up to 219 conditions per place. [2025-02-06 09:31:13,582 INFO L140 encePairwiseOnDemand]: 380/461 looper letters, 18 selfloop transitions, 2 changer transitions 7/362 dead transitions. [2025-02-06 09:31:13,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 362 transitions, 782 flow [2025-02-06 09:31:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2025-02-06 09:31:13,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8503253796095445 [2025-02-06 09:31:13,595 INFO L175 Difference]: Start difference. First operand has 429 places, 441 transitions, 900 flow. Second operand 3 states and 1176 transitions. [2025-02-06 09:31:13,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 362 transitions, 782 flow [2025-02-06 09:31:13,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 362 transitions, 770 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:31:13,605 INFO L231 Difference]: Finished difference. Result has 362 places, 355 transitions, 720 flow [2025-02-06 09:31:13,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=362, PETRI_TRANSITIONS=355} [2025-02-06 09:31:13,610 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -67 predicate places. [2025-02-06 09:31:13,610 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 355 transitions, 720 flow [2025-02-06 09:31:13,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:13,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:13,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:13,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:31:13,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:13,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:13,612 INFO L85 PathProgramCache]: Analyzing trace with hash 404676147, now seen corresponding path program 1 times [2025-02-06 09:31:13,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:13,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084600418] [2025-02-06 09:31:13,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:13,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:13,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:31:13,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:31:13,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:13,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:13,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:13,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084600418] [2025-02-06 09:31:13,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084600418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:13,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:13,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:13,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557668718] [2025-02-06 09:31:13,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:13,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:13,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:13,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:13,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:13,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-06 09:31:13,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 355 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:13,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:13,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-06 09:31:13,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:13,851 INFO L124 PetriNetUnfolderBase]: 135/830 cut-off events. [2025-02-06 09:31:13,852 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:31:13,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 830 events. 135/830 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3567 event pairs, 74 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1009. Up to 195 conditions per place. [2025-02-06 09:31:13,856 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2025-02-06 09:31:13,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 354 transitions, 756 flow [2025-02-06 09:31:13,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-06 09:31:13,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953723788864787 [2025-02-06 09:31:13,863 INFO L175 Difference]: Start difference. First operand has 362 places, 355 transitions, 720 flow. Second operand 3 states and 1100 transitions. [2025-02-06 09:31:13,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 354 transitions, 756 flow [2025-02-06 09:31:13,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 354 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:13,868 INFO L231 Difference]: Finished difference. Result has 354 places, 354 transitions, 718 flow [2025-02-06 09:31:13,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=354, PETRI_TRANSITIONS=354} [2025-02-06 09:31:13,876 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -75 predicate places. [2025-02-06 09:31:13,876 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 354 transitions, 718 flow [2025-02-06 09:31:13,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:13,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:13,877 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] [2025-02-06 09:31:13,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:31:13,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:13,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash -138193304, now seen corresponding path program 1 times [2025-02-06 09:31:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:13,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266471238] [2025-02-06 09:31:13,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:13,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:13,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 09:31:13,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 09:31:13,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:13,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:13,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:13,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266471238] [2025-02-06 09:31:13,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266471238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:13,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:13,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:13,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064172341] [2025-02-06 09:31:13,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:13,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:13,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:13,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:13,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:13,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-06 09:31:13,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 354 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:13,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:13,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-06 09:31:13,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:14,118 INFO L124 PetriNetUnfolderBase]: 135/829 cut-off events. [2025-02-06 09:31:14,119 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:31:14,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 829 events. 135/829 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3544 event pairs, 74 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1000. Up to 195 conditions per place. [2025-02-06 09:31:14,123 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/353 dead transitions. [2025-02-06 09:31:14,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 353 transitions, 754 flow [2025-02-06 09:31:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-06 09:31:14,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953723788864787 [2025-02-06 09:31:14,126 INFO L175 Difference]: Start difference. First operand has 354 places, 354 transitions, 718 flow. Second operand 3 states and 1100 transitions. [2025-02-06 09:31:14,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 353 transitions, 754 flow [2025-02-06 09:31:14,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 353 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:14,131 INFO L231 Difference]: Finished difference. Result has 353 places, 353 transitions, 716 flow [2025-02-06 09:31:14,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=353, PETRI_TRANSITIONS=353} [2025-02-06 09:31:14,132 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -76 predicate places. [2025-02-06 09:31:14,132 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 353 transitions, 716 flow [2025-02-06 09:31:14,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:14,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:14,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:14,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:31:14,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:14,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash 101682089, now seen corresponding path program 1 times [2025-02-06 09:31:14,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:14,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115272666] [2025-02-06 09:31:14,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:14,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:14,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 09:31:14,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 09:31:14,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:14,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:14,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:14,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115272666] [2025-02-06 09:31:14,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115272666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:14,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:14,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:14,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268722705] [2025-02-06 09:31:14,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:14,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:14,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:14,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:14,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:14,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-06 09:31:14,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 353 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:14,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:14,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-06 09:31:14,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:14,466 INFO L124 PetriNetUnfolderBase]: 135/828 cut-off events. [2025-02-06 09:31:14,467 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:31:14,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 828 events. 135/828 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3542 event pairs, 74 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 991. Up to 195 conditions per place. [2025-02-06 09:31:14,471 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/352 dead transitions. [2025-02-06 09:31:14,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 352 transitions, 752 flow [2025-02-06 09:31:14,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-06 09:31:14,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953723788864787 [2025-02-06 09:31:14,473 INFO L175 Difference]: Start difference. First operand has 353 places, 353 transitions, 716 flow. Second operand 3 states and 1100 transitions. [2025-02-06 09:31:14,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 352 transitions, 752 flow [2025-02-06 09:31:14,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 352 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:14,478 INFO L231 Difference]: Finished difference. Result has 352 places, 352 transitions, 714 flow [2025-02-06 09:31:14,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=352, PETRI_TRANSITIONS=352} [2025-02-06 09:31:14,479 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -77 predicate places. [2025-02-06 09:31:14,479 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 352 transitions, 714 flow [2025-02-06 09:31:14,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:14,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:14,480 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-02-06 09:31:14,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:31:14,481 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:14,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:14,481 INFO L85 PathProgramCache]: Analyzing trace with hash 424567733, now seen corresponding path program 1 times [2025-02-06 09:31:14,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:14,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33988462] [2025-02-06 09:31:14,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:14,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:14,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 09:31:14,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 09:31:14,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:14,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:14,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:14,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33988462] [2025-02-06 09:31:14,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33988462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:14,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:14,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:14,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133721323] [2025-02-06 09:31:14,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:14,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:14,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:14,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:14,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:14,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 461 [2025-02-06 09:31:14,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 352 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:14,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:14,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 461 [2025-02-06 09:31:14,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:14,673 INFO L124 PetriNetUnfolderBase]: 135/827 cut-off events. [2025-02-06 09:31:14,673 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:31:14,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 827 events. 135/827 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3547 event pairs, 74 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 979. Up to 192 conditions per place. [2025-02-06 09:31:14,679 INFO L140 encePairwiseOnDemand]: 459/461 looper letters, 15 selfloop transitions, 1 changer transitions 0/351 dead transitions. [2025-02-06 09:31:14,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 351 transitions, 744 flow [2025-02-06 09:31:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2025-02-06 09:31:14,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8018799710773681 [2025-02-06 09:31:14,684 INFO L175 Difference]: Start difference. First operand has 352 places, 352 transitions, 714 flow. Second operand 3 states and 1109 transitions. [2025-02-06 09:31:14,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 351 transitions, 744 flow [2025-02-06 09:31:14,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 351 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:14,689 INFO L231 Difference]: Finished difference. Result has 351 places, 351 transitions, 710 flow [2025-02-06 09:31:14,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=351, PETRI_TRANSITIONS=351} [2025-02-06 09:31:14,691 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -78 predicate places. [2025-02-06 09:31:14,692 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 351 transitions, 710 flow [2025-02-06 09:31:14,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:14,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:14,695 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-02-06 09:31:14,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:31:14,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:14,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1857055213, now seen corresponding path program 1 times [2025-02-06 09:31:14,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:14,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800319684] [2025-02-06 09:31:14,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:14,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:14,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 09:31:14,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 09:31:14,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:14,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:15,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:15,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800319684] [2025-02-06 09:31:15,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800319684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:15,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:15,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:31:15,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094568191] [2025-02-06 09:31:15,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:15,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:31:15,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:15,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:31:15,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:31:15,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 461 [2025-02-06 09:31:15,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 351 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 327.5) internal successors, (1965), 6 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:15,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:15,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 461 [2025-02-06 09:31:15,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:15,591 INFO L124 PetriNetUnfolderBase]: 135/824 cut-off events. [2025-02-06 09:31:15,591 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:31:15,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 824 events. 135/824 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3530 event pairs, 74 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1012. Up to 215 conditions per place. [2025-02-06 09:31:15,594 INFO L140 encePairwiseOnDemand]: 443/461 looper letters, 37 selfloop transitions, 15 changer transitions 0/348 dead transitions. [2025-02-06 09:31:15,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 348 transitions, 808 flow [2025-02-06 09:31:15,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:31:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:31:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2011 transitions. [2025-02-06 09:31:15,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7270426608821403 [2025-02-06 09:31:15,598 INFO L175 Difference]: Start difference. First operand has 351 places, 351 transitions, 710 flow. Second operand 6 states and 2011 transitions. [2025-02-06 09:31:15,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 348 transitions, 808 flow [2025-02-06 09:31:15,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 348 transitions, 807 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:15,604 INFO L231 Difference]: Finished difference. Result has 352 places, 348 transitions, 733 flow [2025-02-06 09:31:15,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=733, PETRI_PLACES=352, PETRI_TRANSITIONS=348} [2025-02-06 09:31:15,605 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -77 predicate places. [2025-02-06 09:31:15,606 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 348 transitions, 733 flow [2025-02-06 09:31:15,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 327.5) internal successors, (1965), 6 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:15,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:15,607 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-02-06 09:31:15,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:31:15,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:15,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:15,609 INFO L85 PathProgramCache]: Analyzing trace with hash -119101506, now seen corresponding path program 1 times [2025-02-06 09:31:15,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:15,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532957376] [2025-02-06 09:31:15,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:15,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:15,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 09:31:15,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 09:31:15,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:15,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:15,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:15,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532957376] [2025-02-06 09:31:15,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532957376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:15,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:15,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:15,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762482597] [2025-02-06 09:31:15,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:15,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:15,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:15,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:15,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:15,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-06 09:31:15,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 348 transitions, 733 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:15,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:15,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-06 09:31:15,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:15,790 INFO L124 PetriNetUnfolderBase]: 135/823 cut-off events. [2025-02-06 09:31:15,791 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:31:15,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 823 events. 135/823 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3530 event pairs, 74 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1006. Up to 194 conditions per place. [2025-02-06 09:31:15,795 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 16 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2025-02-06 09:31:15,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 347 transitions, 767 flow [2025-02-06 09:31:15,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-06 09:31:15,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-06 09:31:15,798 INFO L175 Difference]: Start difference. First operand has 352 places, 348 transitions, 733 flow. Second operand 3 states and 1102 transitions. [2025-02-06 09:31:15,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 347 transitions, 767 flow [2025-02-06 09:31:15,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 347 transitions, 737 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:31:15,802 INFO L231 Difference]: Finished difference. Result has 348 places, 347 transitions, 705 flow [2025-02-06 09:31:15,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=348, PETRI_TRANSITIONS=347} [2025-02-06 09:31:15,803 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -81 predicate places. [2025-02-06 09:31:15,803 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 347 transitions, 705 flow [2025-02-06 09:31:15,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:15,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:15,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, 1, 1, 1, 1] [2025-02-06 09:31:15,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:31:15,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:15,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1411445736, now seen corresponding path program 1 times [2025-02-06 09:31:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:15,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502043950] [2025-02-06 09:31:15,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:15,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:15,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:31:15,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:31:15,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:15,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:15,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:15,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502043950] [2025-02-06 09:31:15,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502043950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:15,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:15,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713478237] [2025-02-06 09:31:15,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:15,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:15,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:15,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:15,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:15,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 461 [2025-02-06 09:31:15,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 347 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:15,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:15,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 461 [2025-02-06 09:31:15,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:15,965 INFO L124 PetriNetUnfolderBase]: 135/822 cut-off events. [2025-02-06 09:31:15,965 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:31:15,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 822 events. 135/822 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3508 event pairs, 74 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 975. Up to 192 conditions per place. [2025-02-06 09:31:15,968 INFO L140 encePairwiseOnDemand]: 459/461 looper letters, 15 selfloop transitions, 1 changer transitions 0/346 dead transitions. [2025-02-06 09:31:15,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 346 transitions, 735 flow [2025-02-06 09:31:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:15,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2025-02-06 09:31:15,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8018799710773681 [2025-02-06 09:31:15,971 INFO L175 Difference]: Start difference. First operand has 348 places, 347 transitions, 705 flow. Second operand 3 states and 1109 transitions. [2025-02-06 09:31:15,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 346 transitions, 735 flow [2025-02-06 09:31:15,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 346 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:15,976 INFO L231 Difference]: Finished difference. Result has 347 places, 346 transitions, 701 flow [2025-02-06 09:31:15,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=347, PETRI_TRANSITIONS=346} [2025-02-06 09:31:15,977 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -82 predicate places. [2025-02-06 09:31:15,977 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 346 transitions, 701 flow [2025-02-06 09:31:15,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:15,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:15,978 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-02-06 09:31:15,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:31:15,978 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:15,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash 507731027, now seen corresponding path program 1 times [2025-02-06 09:31:15,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:15,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464768179] [2025-02-06 09:31:15,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:15,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:15,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 09:31:15,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 09:31:15,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:15,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:16,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:16,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464768179] [2025-02-06 09:31:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464768179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:16,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456122843] [2025-02-06 09:31:16,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:16,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:16,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:16,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:16,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-06 09:31:16,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 346 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:16,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:16,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-06 09:31:16,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:16,189 INFO L124 PetriNetUnfolderBase]: 135/821 cut-off events. [2025-02-06 09:31:16,189 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:31:16,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 821 events. 135/821 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3503 event pairs, 74 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 975. Up to 194 conditions per place. [2025-02-06 09:31:16,193 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 16 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2025-02-06 09:31:16,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 345 transitions, 735 flow [2025-02-06 09:31:16,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-06 09:31:16,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-06 09:31:16,196 INFO L175 Difference]: Start difference. First operand has 347 places, 346 transitions, 701 flow. Second operand 3 states and 1102 transitions. [2025-02-06 09:31:16,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 345 transitions, 735 flow [2025-02-06 09:31:16,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 345 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:16,200 INFO L231 Difference]: Finished difference. Result has 347 places, 345 transitions, 702 flow [2025-02-06 09:31:16,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=347, PETRI_TRANSITIONS=345} [2025-02-06 09:31:16,201 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -82 predicate places. [2025-02-06 09:31:16,201 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 345 transitions, 702 flow [2025-02-06 09:31:16,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:16,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:16,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:16,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:31:16,202 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:16,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:16,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1556676735, now seen corresponding path program 1 times [2025-02-06 09:31:16,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:16,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072462691] [2025-02-06 09:31:16,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:16,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 09:31:16,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 09:31:16,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:16,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:16,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:16,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072462691] [2025-02-06 09:31:16,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072462691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:16,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:16,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:16,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273768462] [2025-02-06 09:31:16,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:16,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:16,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:16,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:16,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 461 [2025-02-06 09:31:16,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 345 transitions, 702 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:16,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:16,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 461 [2025-02-06 09:31:16,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:16,357 INFO L124 PetriNetUnfolderBase]: 135/820 cut-off events. [2025-02-06 09:31:16,358 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:31:16,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 820 events. 135/820 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3510 event pairs, 74 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 974. Up to 192 conditions per place. [2025-02-06 09:31:16,360 INFO L140 encePairwiseOnDemand]: 459/461 looper letters, 15 selfloop transitions, 1 changer transitions 0/344 dead transitions. [2025-02-06 09:31:16,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 344 transitions, 732 flow [2025-02-06 09:31:16,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1109 transitions. [2025-02-06 09:31:16,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8018799710773681 [2025-02-06 09:31:16,363 INFO L175 Difference]: Start difference. First operand has 347 places, 345 transitions, 702 flow. Second operand 3 states and 1109 transitions. [2025-02-06 09:31:16,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 344 transitions, 732 flow [2025-02-06 09:31:16,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 344 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:16,366 INFO L231 Difference]: Finished difference. Result has 346 places, 344 transitions, 698 flow [2025-02-06 09:31:16,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=346, PETRI_TRANSITIONS=344} [2025-02-06 09:31:16,368 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -83 predicate places. [2025-02-06 09:31:16,368 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 344 transitions, 698 flow [2025-02-06 09:31:16,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:16,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:16,368 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:16,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:31:16,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:16,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:16,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1651134868, now seen corresponding path program 1 times [2025-02-06 09:31:16,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:16,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839167292] [2025-02-06 09:31:16,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:16,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:16,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 09:31:16,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 09:31:16,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:16,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:16,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:16,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839167292] [2025-02-06 09:31:16,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839167292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:16,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:16,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254636709] [2025-02-06 09:31:16,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:16,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:16,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:16,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:16,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:16,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-06 09:31:16,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 344 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:16,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:16,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-06 09:31:16,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:16,518 INFO L124 PetriNetUnfolderBase]: 135/819 cut-off events. [2025-02-06 09:31:16,518 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:31:16,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 819 events. 135/819 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3489 event pairs, 74 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 974. Up to 194 conditions per place. [2025-02-06 09:31:16,523 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 16 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2025-02-06 09:31:16,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 343 transitions, 732 flow [2025-02-06 09:31:16,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-06 09:31:16,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-06 09:31:16,526 INFO L175 Difference]: Start difference. First operand has 346 places, 344 transitions, 698 flow. Second operand 3 states and 1102 transitions. [2025-02-06 09:31:16,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 343 transitions, 732 flow [2025-02-06 09:31:16,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 343 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:16,530 INFO L231 Difference]: Finished difference. Result has 346 places, 343 transitions, 699 flow [2025-02-06 09:31:16,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=346, PETRI_TRANSITIONS=343} [2025-02-06 09:31:16,531 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -83 predicate places. [2025-02-06 09:31:16,531 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 343 transitions, 699 flow [2025-02-06 09:31:16,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:16,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:16,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:16,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:31:16,533 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:16,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:16,533 INFO L85 PathProgramCache]: Analyzing trace with hash 182564079, now seen corresponding path program 1 times [2025-02-06 09:31:16,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:16,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025938799] [2025-02-06 09:31:16,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:16,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:16,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 09:31:16,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 09:31:16,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:16,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:16,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:16,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025938799] [2025-02-06 09:31:16,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025938799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:16,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:16,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990329301] [2025-02-06 09:31:16,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:16,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:16,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:16,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:16,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:16,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-06 09:31:16,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 343 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:16,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:16,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-06 09:31:16,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:16,723 INFO L124 PetriNetUnfolderBase]: 135/818 cut-off events. [2025-02-06 09:31:16,723 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:31:16,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 818 events. 135/818 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3505 event pairs, 74 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 976. Up to 195 conditions per place. [2025-02-06 09:31:16,733 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2025-02-06 09:31:16,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 342 transitions, 735 flow [2025-02-06 09:31:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-06 09:31:16,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953723788864787 [2025-02-06 09:31:16,736 INFO L175 Difference]: Start difference. First operand has 346 places, 343 transitions, 699 flow. Second operand 3 states and 1100 transitions. [2025-02-06 09:31:16,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 342 transitions, 735 flow [2025-02-06 09:31:16,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 342 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:16,743 INFO L231 Difference]: Finished difference. Result has 345 places, 342 transitions, 697 flow [2025-02-06 09:31:16,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=345, PETRI_TRANSITIONS=342} [2025-02-06 09:31:16,744 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -84 predicate places. [2025-02-06 09:31:16,744 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 342 transitions, 697 flow [2025-02-06 09:31:16,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:16,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:16,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:16,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:31:16,745 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:16,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:16,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1313753665, now seen corresponding path program 1 times [2025-02-06 09:31:16,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:16,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249496857] [2025-02-06 09:31:16,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:16,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:16,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 09:31:16,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 09:31:16,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:16,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:16,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:16,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249496857] [2025-02-06 09:31:16,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249496857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:16,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:16,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:16,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046278524] [2025-02-06 09:31:16,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:16,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:16,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:16,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:16,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:16,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-06 09:31:16,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 342 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:16,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:16,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-06 09:31:16,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:16,894 INFO L124 PetriNetUnfolderBase]: 135/817 cut-off events. [2025-02-06 09:31:16,894 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:31:16,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 817 events. 135/817 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3503 event pairs, 74 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 975. Up to 195 conditions per place. [2025-02-06 09:31:16,898 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-02-06 09:31:16,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 341 transitions, 733 flow [2025-02-06 09:31:16,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-06 09:31:16,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953723788864787 [2025-02-06 09:31:16,901 INFO L175 Difference]: Start difference. First operand has 345 places, 342 transitions, 697 flow. Second operand 3 states and 1100 transitions. [2025-02-06 09:31:16,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 341 transitions, 733 flow [2025-02-06 09:31:16,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 341 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:16,904 INFO L231 Difference]: Finished difference. Result has 344 places, 341 transitions, 695 flow [2025-02-06 09:31:16,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=344, PETRI_TRANSITIONS=341} [2025-02-06 09:31:16,905 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -85 predicate places. [2025-02-06 09:31:16,905 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 341 transitions, 695 flow [2025-02-06 09:31:16,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:16,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:16,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:16,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:31:16,906 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:16,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:16,907 INFO L85 PathProgramCache]: Analyzing trace with hash 136770705, now seen corresponding path program 1 times [2025-02-06 09:31:16,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:16,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613299382] [2025-02-06 09:31:16,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:16,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:16,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 09:31:16,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 09:31:16,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:16,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:16,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:16,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:16,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613299382] [2025-02-06 09:31:16,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613299382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:16,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:16,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:16,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338078187] [2025-02-06 09:31:16,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:16,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:16,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:16,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:16,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:16,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-06 09:31:16,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 341 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:16,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:16,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-06 09:31:16,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:17,077 INFO L124 PetriNetUnfolderBase]: 135/816 cut-off events. [2025-02-06 09:31:17,077 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-06 09:31:17,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 816 events. 135/816 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3484 event pairs, 74 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 974. Up to 195 conditions per place. [2025-02-06 09:31:17,080 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2025-02-06 09:31:17,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 340 transitions, 731 flow [2025-02-06 09:31:17,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-06 09:31:17,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7953723788864787 [2025-02-06 09:31:17,082 INFO L175 Difference]: Start difference. First operand has 344 places, 341 transitions, 695 flow. Second operand 3 states and 1100 transitions. [2025-02-06 09:31:17,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 340 transitions, 731 flow [2025-02-06 09:31:17,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 340 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:17,086 INFO L231 Difference]: Finished difference. Result has 343 places, 340 transitions, 693 flow [2025-02-06 09:31:17,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=343, PETRI_TRANSITIONS=340} [2025-02-06 09:31:17,086 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-06 09:31:17,087 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 340 transitions, 693 flow [2025-02-06 09:31:17,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:17,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:17,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:17,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:31:17,088 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:17,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:17,088 INFO L85 PathProgramCache]: Analyzing trace with hash -34759642, now seen corresponding path program 1 times [2025-02-06 09:31:17,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:17,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790277045] [2025-02-06 09:31:17,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:17,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:17,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 09:31:17,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 09:31:17,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:17,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:17,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:17,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790277045] [2025-02-06 09:31:17,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790277045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:17,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:17,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:17,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230825656] [2025-02-06 09:31:17,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:17,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:17,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:17,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:17,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:17,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 461 [2025-02-06 09:31:17,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 340 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:17,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:17,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 461 [2025-02-06 09:31:17,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:17,221 INFO L124 PetriNetUnfolderBase]: 127/717 cut-off events. [2025-02-06 09:31:17,221 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-06 09:31:17,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 717 events. 127/717 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2688 event pairs, 14 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 868. Up to 141 conditions per place. [2025-02-06 09:31:17,224 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 22 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2025-02-06 09:31:17,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 347 transitions, 757 flow [2025-02-06 09:31:17,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2025-02-06 09:31:17,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8076644974692697 [2025-02-06 09:31:17,226 INFO L175 Difference]: Start difference. First operand has 343 places, 340 transitions, 693 flow. Second operand 3 states and 1117 transitions. [2025-02-06 09:31:17,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 347 transitions, 757 flow [2025-02-06 09:31:17,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 347 transitions, 753 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:17,232 INFO L231 Difference]: Finished difference. Result has 343 places, 340 transitions, 697 flow [2025-02-06 09:31:17,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=343, PETRI_TRANSITIONS=340} [2025-02-06 09:31:17,233 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-06 09:31:17,233 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 340 transitions, 697 flow [2025-02-06 09:31:17,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:17,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:17,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:17,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:31:17,234 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:17,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:17,235 INFO L85 PathProgramCache]: Analyzing trace with hash -625086433, now seen corresponding path program 1 times [2025-02-06 09:31:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:17,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780833521] [2025-02-06 09:31:17,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:17,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:17,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-06 09:31:17,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-06 09:31:17,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:17,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:17,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:17,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780833521] [2025-02-06 09:31:17,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780833521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:17,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:17,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763878559] [2025-02-06 09:31:17,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:17,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:17,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:17,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:17,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:17,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-06 09:31:17,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 340 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:17,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:17,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-06 09:31:17,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:17,417 INFO L124 PetriNetUnfolderBase]: 136/821 cut-off events. [2025-02-06 09:31:17,417 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-06 09:31:17,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 821 events. 136/821 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3557 event pairs, 74 based on Foata normal form. 0/727 useless extension candidates. Maximal degree in co-relation 1038. Up to 198 conditions per place. [2025-02-06 09:31:17,422 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 17 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2025-02-06 09:31:17,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 339 transitions, 733 flow [2025-02-06 09:31:17,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-06 09:31:17,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-06 09:31:17,425 INFO L175 Difference]: Start difference. First operand has 343 places, 340 transitions, 697 flow. Second operand 3 states and 1102 transitions. [2025-02-06 09:31:17,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 339 transitions, 733 flow [2025-02-06 09:31:17,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 339 transitions, 731 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:17,429 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 697 flow [2025-02-06 09:31:17,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=343, PETRI_TRANSITIONS=339} [2025-02-06 09:31:17,430 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-06 09:31:17,430 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 697 flow [2025-02-06 09:31:17,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:17,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:17,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:17,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:31:17,431 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:17,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:17,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1029795552, now seen corresponding path program 1 times [2025-02-06 09:31:17,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:17,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960235474] [2025-02-06 09:31:17,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:17,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:17,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 09:31:17,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 09:31:17,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:17,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:17,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:17,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960235474] [2025-02-06 09:31:17,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960235474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:17,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:17,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:17,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207880287] [2025-02-06 09:31:17,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:17,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:17,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:17,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:17,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:17,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 461 [2025-02-06 09:31:17,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 339 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:17,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:17,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 461 [2025-02-06 09:31:17,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:17,618 INFO L124 PetriNetUnfolderBase]: 137/782 cut-off events. [2025-02-06 09:31:17,618 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-02-06 09:31:17,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 782 events. 137/782 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3161 event pairs, 28 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 985. Up to 119 conditions per place. [2025-02-06 09:31:17,622 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 24 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2025-02-06 09:31:17,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 347 transitions, 771 flow [2025-02-06 09:31:17,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1117 transitions. [2025-02-06 09:31:17,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8076644974692697 [2025-02-06 09:31:17,625 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 697 flow. Second operand 3 states and 1117 transitions. [2025-02-06 09:31:17,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 347 transitions, 771 flow [2025-02-06 09:31:17,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 347 transitions, 767 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:17,629 INFO L231 Difference]: Finished difference. Result has 343 places, 339 transitions, 701 flow [2025-02-06 09:31:17,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=343, PETRI_TRANSITIONS=339} [2025-02-06 09:31:17,630 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-06 09:31:17,630 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 339 transitions, 701 flow [2025-02-06 09:31:17,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:17,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:17,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:17,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:31:17,631 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:17,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1045977242, now seen corresponding path program 1 times [2025-02-06 09:31:17,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:17,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674632106] [2025-02-06 09:31:17,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:17,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 09:31:17,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 09:31:17,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:17,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:17,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:17,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674632106] [2025-02-06 09:31:17,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674632106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:17,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:17,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:17,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003449083] [2025-02-06 09:31:17,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:17,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:17,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:17,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:17,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:17,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-06 09:31:17,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 339 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:17,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:17,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-06 09:31:17,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:17,807 INFO L124 PetriNetUnfolderBase]: 137/826 cut-off events. [2025-02-06 09:31:17,807 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-02-06 09:31:17,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 826 events. 137/826 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3611 event pairs, 74 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 1077. Up to 202 conditions per place. [2025-02-06 09:31:17,811 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 18 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2025-02-06 09:31:17,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 338 transitions, 739 flow [2025-02-06 09:31:17,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-06 09:31:17,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-06 09:31:17,813 INFO L175 Difference]: Start difference. First operand has 343 places, 339 transitions, 701 flow. Second operand 3 states and 1102 transitions. [2025-02-06 09:31:17,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 338 transitions, 739 flow [2025-02-06 09:31:17,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 338 transitions, 737 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:17,817 INFO L231 Difference]: Finished difference. Result has 343 places, 338 transitions, 701 flow [2025-02-06 09:31:17,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=343, PETRI_TRANSITIONS=338} [2025-02-06 09:31:17,818 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-06 09:31:17,818 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 338 transitions, 701 flow [2025-02-06 09:31:17,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:17,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:17,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:17,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:31:17,819 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:17,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash -718970636, now seen corresponding path program 1 times [2025-02-06 09:31:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:17,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414652530] [2025-02-06 09:31:17,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:17,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:17,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-06 09:31:17,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-06 09:31:17,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:17,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:17,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:17,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414652530] [2025-02-06 09:31:17,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414652530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:17,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:17,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:17,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802671746] [2025-02-06 09:31:17,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:17,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:17,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:17,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:17,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:17,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 461 [2025-02-06 09:31:17,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 338 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:17,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:17,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 461 [2025-02-06 09:31:17,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:18,029 INFO L124 PetriNetUnfolderBase]: 196/990 cut-off events. [2025-02-06 09:31:18,029 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-02-06 09:31:18,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 990 events. 196/990 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4741 event pairs, 56 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1375. Up to 163 conditions per place. [2025-02-06 09:31:18,033 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 30 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2025-02-06 09:31:18,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 351 transitions, 804 flow [2025-02-06 09:31:18,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1121 transitions. [2025-02-06 09:31:18,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8105567606652205 [2025-02-06 09:31:18,035 INFO L175 Difference]: Start difference. First operand has 343 places, 338 transitions, 701 flow. Second operand 3 states and 1121 transitions. [2025-02-06 09:31:18,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 351 transitions, 804 flow [2025-02-06 09:31:18,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 351 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:18,039 INFO L231 Difference]: Finished difference. Result has 343 places, 338 transitions, 705 flow [2025-02-06 09:31:18,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=343, PETRI_TRANSITIONS=338} [2025-02-06 09:31:18,040 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-06 09:31:18,040 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 338 transitions, 705 flow [2025-02-06 09:31:18,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.0) internal successors, (1095), 3 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:18,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:18,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:18,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:31:18,041 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:18,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:18,041 INFO L85 PathProgramCache]: Analyzing trace with hash 321692605, now seen corresponding path program 1 times [2025-02-06 09:31:18,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:18,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035624166] [2025-02-06 09:31:18,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:18,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:18,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-06 09:31:18,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-06 09:31:18,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:18,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:18,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:18,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035624166] [2025-02-06 09:31:18,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035624166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:18,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:18,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147182972] [2025-02-06 09:31:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:18,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:18,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:18,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:18,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:18,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-06 09:31:18,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 338 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:18,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:18,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-06 09:31:18,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:18,209 INFO L124 PetriNetUnfolderBase]: 196/1004 cut-off events. [2025-02-06 09:31:18,209 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2025-02-06 09:31:18,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1004 events. 196/1004 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4808 event pairs, 124 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1428. Up to 301 conditions per place. [2025-02-06 09:31:18,214 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 19 selfloop transitions, 2 changer transitions 0/337 dead transitions. [2025-02-06 09:31:18,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 337 transitions, 745 flow [2025-02-06 09:31:18,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-06 09:31:18,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-06 09:31:18,216 INFO L175 Difference]: Start difference. First operand has 343 places, 338 transitions, 705 flow. Second operand 3 states and 1102 transitions. [2025-02-06 09:31:18,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 337 transitions, 745 flow [2025-02-06 09:31:18,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 337 transitions, 743 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:18,219 INFO L231 Difference]: Finished difference. Result has 343 places, 337 transitions, 705 flow [2025-02-06 09:31:18,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=343, PETRI_TRANSITIONS=337} [2025-02-06 09:31:18,220 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -86 predicate places. [2025-02-06 09:31:18,220 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 337 transitions, 705 flow [2025-02-06 09:31:18,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:18,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:18,221 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:18,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:31:18,221 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:18,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:18,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1473818734, now seen corresponding path program 1 times [2025-02-06 09:31:18,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:18,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012844795] [2025-02-06 09:31:18,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:18,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:18,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 09:31:18,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 09:31:18,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:18,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:18,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012844795] [2025-02-06 09:31:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012844795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:18,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:18,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:18,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791106426] [2025-02-06 09:31:18,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:18,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:18,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:18,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:18,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:18,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 461 [2025-02-06 09:31:18,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 337 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:18,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:18,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 461 [2025-02-06 09:31:18,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:18,430 INFO L124 PetriNetUnfolderBase]: 296/1261 cut-off events. [2025-02-06 09:31:18,430 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2025-02-06 09:31:18,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 1261 events. 296/1261 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6764 event pairs, 196 based on Foata normal form. 0/1136 useless extension candidates. Maximal degree in co-relation 1896. Up to 451 conditions per place. [2025-02-06 09:31:18,434 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 20 selfloop transitions, 1 changer transitions 0/335 dead transitions. [2025-02-06 09:31:18,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 335 transitions, 743 flow [2025-02-06 09:31:18,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:18,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-02-06 09:31:18,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7975415762834418 [2025-02-06 09:31:18,436 INFO L175 Difference]: Start difference. First operand has 343 places, 337 transitions, 705 flow. Second operand 3 states and 1103 transitions. [2025-02-06 09:31:18,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 335 transitions, 743 flow [2025-02-06 09:31:18,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 335 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:18,440 INFO L231 Difference]: Finished difference. Result has 341 places, 335 transitions, 699 flow [2025-02-06 09:31:18,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=341, PETRI_TRANSITIONS=335} [2025-02-06 09:31:18,440 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -88 predicate places. [2025-02-06 09:31:18,441 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 335 transitions, 699 flow [2025-02-06 09:31:18,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:18,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:18,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:18,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:31:18,441 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err29ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:18,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:18,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1080058576, now seen corresponding path program 1 times [2025-02-06 09:31:18,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:18,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896698308] [2025-02-06 09:31:18,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:18,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:18,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-06 09:31:18,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-06 09:31:18,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:18,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:18,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:18,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896698308] [2025-02-06 09:31:18,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896698308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:18,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:18,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:18,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864150567] [2025-02-06 09:31:18,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:18,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:18,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:18,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:18,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:18,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-06 09:31:18,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 335 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:18,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:18,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-06 09:31:18,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:18,665 INFO L124 PetriNetUnfolderBase]: 346/1327 cut-off events. [2025-02-06 09:31:18,666 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-02-06 09:31:18,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 1327 events. 346/1327 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7160 event pairs, 196 based on Foata normal form. 0/1194 useless extension candidates. Maximal degree in co-relation 2073. Up to 452 conditions per place. [2025-02-06 09:31:18,671 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 29 selfloop transitions, 2 changer transitions 0/342 dead transitions. [2025-02-06 09:31:18,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 342 transitions, 785 flow [2025-02-06 09:31:18,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1107 transitions. [2025-02-06 09:31:18,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8004338394793926 [2025-02-06 09:31:18,676 INFO L175 Difference]: Start difference. First operand has 341 places, 335 transitions, 699 flow. Second operand 3 states and 1107 transitions. [2025-02-06 09:31:18,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 342 transitions, 785 flow [2025-02-06 09:31:18,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 342 transitions, 784 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:31:18,680 INFO L231 Difference]: Finished difference. Result has 341 places, 334 transitions, 700 flow [2025-02-06 09:31:18,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=341, PETRI_TRANSITIONS=334} [2025-02-06 09:31:18,681 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -88 predicate places. [2025-02-06 09:31:18,681 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 334 transitions, 700 flow [2025-02-06 09:31:18,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 361.3333333333333) internal successors, (1084), 3 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:18,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:18,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:18,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:31:18,683 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:18,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:18,684 INFO L85 PathProgramCache]: Analyzing trace with hash 508163151, now seen corresponding path program 1 times [2025-02-06 09:31:18,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:18,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830782196] [2025-02-06 09:31:18,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:18,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:18,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-06 09:31:18,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-06 09:31:18,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:18,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:18,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:18,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830782196] [2025-02-06 09:31:18,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830782196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:18,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:18,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:18,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929549433] [2025-02-06 09:31:18,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:18,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:18,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:18,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:18,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:18,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-06 09:31:18,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 334 transitions, 700 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:18,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:18,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-06 09:31:18,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:18,989 INFO L124 PetriNetUnfolderBase]: 296/1192 cut-off events. [2025-02-06 09:31:18,989 INFO L125 PetriNetUnfolderBase]: For 215/215 co-relation queries the response was YES. [2025-02-06 09:31:18,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 1192 events. 296/1192 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6048 event pairs, 160 based on Foata normal form. 2/1089 useless extension candidates. Maximal degree in co-relation 1844. Up to 374 conditions per place. [2025-02-06 09:31:18,995 INFO L140 encePairwiseOnDemand]: 456/461 looper letters, 22 selfloop transitions, 2 changer transitions 7/340 dead transitions. [2025-02-06 09:31:18,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 340 transitions, 780 flow [2025-02-06 09:31:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1106 transitions. [2025-02-06 09:31:18,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7997107736804049 [2025-02-06 09:31:18,998 INFO L175 Difference]: Start difference. First operand has 341 places, 334 transitions, 700 flow. Second operand 3 states and 1106 transitions. [2025-02-06 09:31:18,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 340 transitions, 780 flow [2025-02-06 09:31:19,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 340 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:19,002 INFO L231 Difference]: Finished difference. Result has 339 places, 325 transitions, 679 flow [2025-02-06 09:31:19,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=339, PETRI_TRANSITIONS=325} [2025-02-06 09:31:19,003 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -90 predicate places. [2025-02-06 09:31:19,003 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 325 transitions, 679 flow [2025-02-06 09:31:19,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:19,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:31:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:31:19,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:31:19,004 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 155 more)] === [2025-02-06 09:31:19,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:31:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1202361169, now seen corresponding path program 1 times [2025-02-06 09:31:19,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:31:19,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452200721] [2025-02-06 09:31:19,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:31:19,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:31:19,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-06 09:31:19,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-06 09:31:19,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:31:19,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:31:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:31:19,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:31:19,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452200721] [2025-02-06 09:31:19,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452200721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:31:19,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:31:19,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:31:19,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379359981] [2025-02-06 09:31:19,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:31:19,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:31:19,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:31:19,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:31:19,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:31:19,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 461 [2025-02-06 09:31:19,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 325 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:19,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:31:19,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 461 [2025-02-06 09:31:19,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:31:19,272 INFO L124 PetriNetUnfolderBase]: 254/969 cut-off events. [2025-02-06 09:31:19,272 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-02-06 09:31:19,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 969 events. 254/969 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4220 event pairs, 132 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1531. Up to 306 conditions per place. [2025-02-06 09:31:19,275 INFO L140 encePairwiseOnDemand]: 458/461 looper letters, 0 selfloop transitions, 0 changer transitions 332/332 dead transitions. [2025-02-06 09:31:19,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 332 transitions, 755 flow [2025-02-06 09:31:19,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:31:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:31:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1102 transitions. [2025-02-06 09:31:19,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7968185104844541 [2025-02-06 09:31:19,278 INFO L175 Difference]: Start difference. First operand has 339 places, 325 transitions, 679 flow. Second operand 3 states and 1102 transitions. [2025-02-06 09:31:19,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 332 transitions, 755 flow [2025-02-06 09:31:19,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 332 transitions, 751 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:31:19,281 INFO L231 Difference]: Finished difference. Result has 331 places, 0 transitions, 0 flow [2025-02-06 09:31:19,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=461, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=331, PETRI_TRANSITIONS=0} [2025-02-06 09:31:19,282 INFO L279 CegarLoopForPetriNet]: 429 programPoint places, -98 predicate places. [2025-02-06 09:31:19,282 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 0 transitions, 0 flow [2025-02-06 09:31:19,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:31:19,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (158 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (157 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (156 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (155 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (154 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (153 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (152 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (151 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (150 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (149 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (148 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (147 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (146 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (145 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (144 of 159 remaining) [2025-02-06 09:31:19,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (143 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (142 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (141 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (140 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (139 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (138 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (137 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (136 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (135 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (134 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (133 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (132 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (131 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (130 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (129 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (128 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (127 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (126 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (125 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (124 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (123 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (122 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (121 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (120 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (119 of 159 remaining) [2025-02-06 09:31:19,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (118 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (117 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (116 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (115 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (114 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (113 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (112 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (111 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (110 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (109 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (108 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (107 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (106 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (105 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (104 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (103 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (102 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (101 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (100 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (99 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (98 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (97 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (96 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (95 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (94 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (93 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (92 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (91 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (90 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (89 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (88 of 159 remaining) [2025-02-06 09:31:19,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (87 of 159 remaining) [2025-02-06 09:31:19,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (86 of 159 remaining) [2025-02-06 09:31:19,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (85 of 159 remaining) [2025-02-06 09:31:19,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (84 of 159 remaining) [2025-02-06 09:31:19,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (83 of 159 remaining) [2025-02-06 09:31:19,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (82 of 159 remaining) [2025-02-06 09:31:19,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (81 of 159 remaining) [2025-02-06 09:31:19,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (80 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (79 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (78 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (77 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (76 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (75 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (74 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (73 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (72 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (71 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (70 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (69 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (67 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (66 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (65 of 159 remaining) [2025-02-06 09:31:19,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (64 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (62 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (61 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (60 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (59 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (58 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (57 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (56 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (55 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (54 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (53 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (52 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (51 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (50 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (49 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (48 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (47 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (46 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (45 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (44 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (43 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (42 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (41 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (40 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (38 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (37 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (36 of 159 remaining) [2025-02-06 09:31:19,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (35 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (34 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (33 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (32 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (31 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (30 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (29 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (28 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (27 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (26 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (25 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (24 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (23 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (22 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (18 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (15 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (14 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 159 remaining) [2025-02-06 09:31:19,291 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 159 remaining) [2025-02-06 09:31:19,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 159 remaining) [2025-02-06 09:31:19,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 159 remaining) [2025-02-06 09:31:19,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 159 remaining) [2025-02-06 09:31:19,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 159 remaining) [2025-02-06 09:31:19,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 159 remaining) [2025-02-06 09:31:19,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 159 remaining) [2025-02-06 09:31:19,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 159 remaining) [2025-02-06 09:31:19,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 09:31:19,293 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, 1, 1, 1, 1] [2025-02-06 09:31:19,297 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:31:19,297 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:31:19,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:31:19 BasicIcfg [2025-02-06 09:31:19,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:31:19,302 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:31:19,302 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:31:19,302 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:31:19,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:31:12" (3/4) ... [2025-02-06 09:31:19,303 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:31:19,305 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:31:19,305 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:31:19,305 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 09:31:19,310 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-02-06 09:31:19,310 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:31:19,310 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:31:19,311 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:31:19,373 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:31:19,373 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:31:19,373 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:31:19,374 INFO L158 Benchmark]: Toolchain (without parser) took 8047.54ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 121.8MB in the beginning and 172.9MB in the end (delta: -51.0MB). Peak memory consumption was 271.5MB. Max. memory is 16.1GB. [2025-02-06 09:31:19,374 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:31:19,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.38ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 107.9MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:31:19,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.11ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:31:19,379 INFO L158 Benchmark]: Boogie Preprocessor took 30.48ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 101.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:31:19,379 INFO L158 Benchmark]: IcfgBuilder took 1124.71ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 51.3MB in the end (delta: 49.8MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. [2025-02-06 09:31:19,379 INFO L158 Benchmark]: TraceAbstraction took 6597.49ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 51.3MB in the beginning and 181.3MB in the end (delta: -129.9MB). Peak memory consumption was 195.7MB. Max. memory is 16.1GB. [2025-02-06 09:31:19,379 INFO L158 Benchmark]: Witness Printer took 71.41ms. Allocated memory is still 494.9MB. Free memory was 181.3MB in the beginning and 172.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:31:19,380 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.46ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.38ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 107.9MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.11ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.48ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 101.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1124.71ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 51.3MB in the end (delta: 49.8MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6597.49ms. Allocated memory was 167.8MB in the beginning and 494.9MB in the end (delta: 327.2MB). Free memory was 51.3MB in the beginning and 181.3MB in the end (delta: -129.9MB). Peak memory consumption was 195.7MB. Max. memory is 16.1GB. * Witness Printer took 71.41ms. Allocated memory is still 494.9MB. Free memory was 181.3MB in the beginning and 172.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: 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: 55]: 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: 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: 62]: 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: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: 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 7 procedures, 557 locations, 159 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: 6.4s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1095 IncrementalHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 77 mSDtfsCounter, 1095 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=900occurred in iteration=0, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 3487 NumberOfCodeBlocks, 3487 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 3463 ConstructedInterpolants, 0 QuantifiedInterpolants, 3624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 90 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:31:19,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE