./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:55:30,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:55:30,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:55:30,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:55:30,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:55:30,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:55:30,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:55:30,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:55:30,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:55:30,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:55:30,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:55:30,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:55:30,140 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:55:30,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:55:30,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:55:30,141 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:55:30,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:55:30,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:55:30,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:55:30,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:55:30,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:55:30,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:55:30,141 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:55:30,141 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:55:30,141 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:55:30,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:55:30,142 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:55:30,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:55:30,142 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:55:30,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:55:30,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:55:30,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:30,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:55:30,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:55:30,143 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:55:30,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:55:30,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:55:30,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:55:30,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:55:30,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:55:30,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:55:30,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:55:30,143 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 [2025-03-04 06:55:30,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:55:30,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:55:30,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:55:30,478 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:55:30,478 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:55:30,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-03-04 06:55:31,698 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24bc2d50/0c76c82f10d94e60a375396fa901b382/FLAGe764121f6 [2025-03-04 06:55:31,975 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:55:31,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-03-04 06:55:31,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24bc2d50/0c76c82f10d94e60a375396fa901b382/FLAGe764121f6 [2025-03-04 06:55:32,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d24bc2d50/0c76c82f10d94e60a375396fa901b382 [2025-03-04 06:55:32,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:55:32,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:55:32,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:32,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:55:32,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:55:32,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b59287a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32, skipping insertion in model container [2025-03-04 06:55:32,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:55:32,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:32,459 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:55:32,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:32,514 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:55:32,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32 WrapperNode [2025-03-04 06:55:32,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:32,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:32,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:55:32,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:55:32,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,568 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 556 [2025-03-04 06:55:32,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:32,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:55:32,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:55:32,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:55:32,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,589 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:55:32,600 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:55:32,600 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:55:32,600 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:55:32,601 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32" (1/1) ... [2025-03-04 06:55:32,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:32,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:55:32,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:55:32,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:55:32,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:55:32,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:55:32,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:55:32,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:55:32,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:55:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:55:32,652 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:55:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:55:32,652 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:55:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 06:55:32,652 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 06:55:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:55:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:55:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:55:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:55:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:55:32,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:55:32,654 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:55:32,745 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:55:32,747 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:55:33,450 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:55:33,451 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:55:33,851 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:55:33,852 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:55:33,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:33 BoogieIcfgContainer [2025-03-04 06:55:33,853 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:55:33,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:55:33,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:55:33,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:55:33,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:55:32" (1/3) ... [2025-03-04 06:55:33,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5945b4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:33, skipping insertion in model container [2025-03-04 06:55:33,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:32" (2/3) ... [2025-03-04 06:55:33,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5945b4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:33, skipping insertion in model container [2025-03-04 06:55:33,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:33" (3/3) ... [2025-03-04 06:55:33,861 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2025-03-04 06:55:33,873 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:55:33,875 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult2.wvr.c that has 5 procedures, 369 locations, 1 initial locations, 6 loop locations, and 89 error locations. [2025-03-04 06:55:33,876 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:55:33,971 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 06:55:34,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 381 places, 381 transitions, 790 flow [2025-03-04 06:55:34,102 INFO L124 PetriNetUnfolderBase]: 13/377 cut-off events. [2025-03-04 06:55:34,103 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:55:34,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 377 events. 13/377 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 588 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 329. Up to 2 conditions per place. [2025-03-04 06:55:34,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 381 places, 381 transitions, 790 flow [2025-03-04 06:55:34,114 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 361 places, 360 transitions, 744 flow [2025-03-04 06:55:34,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:55:34,145 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;@7d8a6ccc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:55:34,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 163 error locations. [2025-03-04 06:55:34,152 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:55:34,154 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-04 06:55:34,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:55:34,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:34,154 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-03-04 06:55:34,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:34,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:34,162 INFO L85 PathProgramCache]: Analyzing trace with hash 880683604, now seen corresponding path program 1 times [2025-03-04 06:55:34,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:34,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016949924] [2025-03-04 06:55:34,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:34,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:34,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:55:34,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:55:34,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:34,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:34,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:34,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016949924] [2025-03-04 06:55:34,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016949924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:34,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:34,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:34,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322632223] [2025-03-04 06:55:34,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:34,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:34,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:34,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:34,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:34,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 381 [2025-03-04 06:55:34,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 360 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:34,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:34,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 381 [2025-03-04 06:55:34,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:34,635 INFO L124 PetriNetUnfolderBase]: 451/1148 cut-off events. [2025-03-04 06:55:34,635 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-03-04 06:55:34,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 1148 events. 451/1148 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5118 event pairs, 272 based on Foata normal form. 5/1030 useless extension candidates. Maximal degree in co-relation 1525. Up to 613 conditions per place. [2025-03-04 06:55:34,648 INFO L140 encePairwiseOnDemand]: 303/381 looper letters, 24 selfloop transitions, 2 changer transitions 5/284 dead transitions. [2025-03-04 06:55:34,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 284 transitions, 644 flow [2025-03-04 06:55:34,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2025-03-04 06:55:34,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8136482939632546 [2025-03-04 06:55:34,666 INFO L175 Difference]: Start difference. First operand has 361 places, 360 transitions, 744 flow. Second operand 3 states and 930 transitions. [2025-03-04 06:55:34,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 284 transitions, 644 flow [2025-03-04 06:55:34,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 284 transitions, 628 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 06:55:34,676 INFO L231 Difference]: Finished difference. Result has 284 places, 279 transitions, 570 flow [2025-03-04 06:55:34,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=284, PETRI_TRANSITIONS=279} [2025-03-04 06:55:34,682 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -77 predicate places. [2025-03-04 06:55:34,683 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 279 transitions, 570 flow [2025-03-04 06:55:34,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:34,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:34,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:34,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:55:34,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:34,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:34,685 INFO L85 PathProgramCache]: Analyzing trace with hash -292085796, now seen corresponding path program 1 times [2025-03-04 06:55:34,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:34,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743835994] [2025-03-04 06:55:34,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:34,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:34,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 06:55:34,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 06:55:34,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:34,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:34,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:34,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743835994] [2025-03-04 06:55:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743835994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:34,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:34,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:34,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784516868] [2025-03-04 06:55:34,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:34,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:34,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:34,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:34,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 381 [2025-03-04 06:55:34,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 279 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:34,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:34,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 381 [2025-03-04 06:55:34,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:34,999 INFO L124 PetriNetUnfolderBase]: 451/1142 cut-off events. [2025-03-04 06:55:34,999 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:55:35,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1801 conditions, 1142 events. 451/1142 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5124 event pairs, 272 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1762. Up to 613 conditions per place. [2025-03-04 06:55:35,007 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 24 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2025-03-04 06:55:35,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 278 transitions, 620 flow [2025-03-04 06:55:35,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:35,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-03-04 06:55:35,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7480314960629921 [2025-03-04 06:55:35,010 INFO L175 Difference]: Start difference. First operand has 284 places, 279 transitions, 570 flow. Second operand 3 states and 855 transitions. [2025-03-04 06:55:35,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 278 transitions, 620 flow [2025-03-04 06:55:35,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 278 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:35,015 INFO L231 Difference]: Finished difference. Result has 278 places, 278 transitions, 568 flow [2025-03-04 06:55:35,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=278, PETRI_TRANSITIONS=278} [2025-03-04 06:55:35,016 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -83 predicate places. [2025-03-04 06:55:35,016 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 278 transitions, 568 flow [2025-03-04 06:55:35,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:35,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:35,017 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-03-04 06:55:35,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:55:35,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:35,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1926733303, now seen corresponding path program 1 times [2025-03-04 06:55:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:35,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502353736] [2025-03-04 06:55:35,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:35,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:35,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 06:55:35,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 06:55:35,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:35,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:35,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:35,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502353736] [2025-03-04 06:55:35,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502353736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:35,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:35,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071679657] [2025-03-04 06:55:35,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:35,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:35,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:35,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:35,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:35,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 381 [2025-03-04 06:55:35,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 278 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:35,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:35,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 381 [2025-03-04 06:55:35,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:35,319 INFO L124 PetriNetUnfolderBase]: 451/1141 cut-off events. [2025-03-04 06:55:35,320 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:55:35,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1800 conditions, 1141 events. 451/1141 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5099 event pairs, 272 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1753. Up to 613 conditions per place. [2025-03-04 06:55:35,326 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 24 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2025-03-04 06:55:35,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 277 transitions, 618 flow [2025-03-04 06:55:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-03-04 06:55:35,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7480314960629921 [2025-03-04 06:55:35,330 INFO L175 Difference]: Start difference. First operand has 278 places, 278 transitions, 568 flow. Second operand 3 states and 855 transitions. [2025-03-04 06:55:35,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 277 transitions, 618 flow [2025-03-04 06:55:35,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 277 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:35,334 INFO L231 Difference]: Finished difference. Result has 277 places, 277 transitions, 566 flow [2025-03-04 06:55:35,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=277, PETRI_TRANSITIONS=277} [2025-03-04 06:55:35,335 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -84 predicate places. [2025-03-04 06:55:35,335 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 277 transitions, 566 flow [2025-03-04 06:55:35,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:35,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:35,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:35,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:55:35,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:35,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1487725916, now seen corresponding path program 1 times [2025-03-04 06:55:35,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:35,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356432307] [2025-03-04 06:55:35,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:35,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 06:55:35,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 06:55:35,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:35,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:35,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:35,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:35,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356432307] [2025-03-04 06:55:35,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356432307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:35,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:35,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:35,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841889762] [2025-03-04 06:55:35,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:35,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:35,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:35,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:35,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:35,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 381 [2025-03-04 06:55:35,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 277 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:35,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:35,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 381 [2025-03-04 06:55:35,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:35,533 INFO L124 PetriNetUnfolderBase]: 451/1140 cut-off events. [2025-03-04 06:55:35,533 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:55:35,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 1140 events. 451/1140 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5093 event pairs, 272 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1744. Up to 613 conditions per place. [2025-03-04 06:55:35,541 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 24 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2025-03-04 06:55:35,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 276 transitions, 616 flow [2025-03-04 06:55:35,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-03-04 06:55:35,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7480314960629921 [2025-03-04 06:55:35,543 INFO L175 Difference]: Start difference. First operand has 277 places, 277 transitions, 566 flow. Second operand 3 states and 855 transitions. [2025-03-04 06:55:35,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 276 transitions, 616 flow [2025-03-04 06:55:35,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 276 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:35,547 INFO L231 Difference]: Finished difference. Result has 276 places, 276 transitions, 564 flow [2025-03-04 06:55:35,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=276, PETRI_TRANSITIONS=276} [2025-03-04 06:55:35,549 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -85 predicate places. [2025-03-04 06:55:35,549 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 276 transitions, 564 flow [2025-03-04 06:55:35,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:35,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:35,550 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] [2025-03-04 06:55:35,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:55:35,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:35,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash 790138972, now seen corresponding path program 1 times [2025-03-04 06:55:35,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:35,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835495952] [2025-03-04 06:55:35,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:35,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:35,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:55:35,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:55:35,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:35,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:35,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835495952] [2025-03-04 06:55:35,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835495952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:35,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:35,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:35,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510661493] [2025-03-04 06:55:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:35,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:35,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:35,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:35,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:35,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 381 [2025-03-04 06:55:35,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 276 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:35,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:35,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 381 [2025-03-04 06:55:35,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:35,826 INFO L124 PetriNetUnfolderBase]: 451/1139 cut-off events. [2025-03-04 06:55:35,827 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 06:55:35,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 1139 events. 451/1139 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5070 event pairs, 272 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1735. Up to 613 conditions per place. [2025-03-04 06:55:35,836 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 24 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2025-03-04 06:55:35,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 275 transitions, 614 flow [2025-03-04 06:55:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-03-04 06:55:35,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7480314960629921 [2025-03-04 06:55:35,841 INFO L175 Difference]: Start difference. First operand has 276 places, 276 transitions, 564 flow. Second operand 3 states and 855 transitions. [2025-03-04 06:55:35,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 275 transitions, 614 flow [2025-03-04 06:55:35,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 275 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:35,845 INFO L231 Difference]: Finished difference. Result has 275 places, 275 transitions, 562 flow [2025-03-04 06:55:35,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=275, PETRI_TRANSITIONS=275} [2025-03-04 06:55:35,847 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -86 predicate places. [2025-03-04 06:55:35,848 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 275 transitions, 562 flow [2025-03-04 06:55:35,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:35,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:35,851 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] [2025-03-04 06:55:35,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:55:35,851 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:35,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:35,852 INFO L85 PathProgramCache]: Analyzing trace with hash -666719695, now seen corresponding path program 1 times [2025-03-04 06:55:35,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:35,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458513991] [2025-03-04 06:55:35,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:35,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:55:35,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:55:35,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:35,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:35,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:35,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458513991] [2025-03-04 06:55:35,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458513991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:35,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:35,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:35,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065019055] [2025-03-04 06:55:35,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:35,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:35,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:35,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:35,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:35,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 381 [2025-03-04 06:55:35,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 275 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:35,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:35,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 381 [2025-03-04 06:55:35,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:36,124 INFO L124 PetriNetUnfolderBase]: 595/1525 cut-off events. [2025-03-04 06:55:36,124 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-04 06:55:36,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 1525 events. 595/1525 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8189 event pairs, 228 based on Foata normal form. 0/1369 useless extension candidates. Maximal degree in co-relation 2315. Up to 435 conditions per place. [2025-03-04 06:55:36,132 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 36 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2025-03-04 06:55:36,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 289 transitions, 671 flow [2025-03-04 06:55:36,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 879 transitions. [2025-03-04 06:55:36,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7690288713910761 [2025-03-04 06:55:36,134 INFO L175 Difference]: Start difference. First operand has 275 places, 275 transitions, 562 flow. Second operand 3 states and 879 transitions. [2025-03-04 06:55:36,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 289 transitions, 671 flow [2025-03-04 06:55:36,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 289 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:36,138 INFO L231 Difference]: Finished difference. Result has 275 places, 275 transitions, 566 flow [2025-03-04 06:55:36,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=275, PETRI_TRANSITIONS=275} [2025-03-04 06:55:36,140 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -86 predicate places. [2025-03-04 06:55:36,140 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 275 transitions, 566 flow [2025-03-04 06:55:36,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:36,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:36,140 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] [2025-03-04 06:55:36,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:55:36,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:36,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1213732785, now seen corresponding path program 1 times [2025-03-04 06:55:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:36,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762872751] [2025-03-04 06:55:36,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:36,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:36,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 06:55:36,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 06:55:36,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:36,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:36,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:36,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762872751] [2025-03-04 06:55:36,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762872751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:36,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:36,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:36,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913827107] [2025-03-04 06:55:36,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:36,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:36,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:36,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:36,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:36,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 381 [2025-03-04 06:55:36,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 275 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:36,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:36,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 381 [2025-03-04 06:55:36,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:36,389 INFO L124 PetriNetUnfolderBase]: 595/1527 cut-off events. [2025-03-04 06:55:36,389 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-03-04 06:55:36,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2534 conditions, 1527 events. 595/1527 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8315 event pairs, 375 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 1224. Up to 808 conditions per place. [2025-03-04 06:55:36,396 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 24 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2025-03-04 06:55:36,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 274 transitions, 616 flow [2025-03-04 06:55:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:36,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-04 06:55:36,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7497812773403325 [2025-03-04 06:55:36,398 INFO L175 Difference]: Start difference. First operand has 275 places, 275 transitions, 566 flow. Second operand 3 states and 857 transitions. [2025-03-04 06:55:36,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 274 transitions, 616 flow [2025-03-04 06:55:36,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 274 transitions, 614 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:36,402 INFO L231 Difference]: Finished difference. Result has 275 places, 274 transitions, 566 flow [2025-03-04 06:55:36,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=275, PETRI_TRANSITIONS=274} [2025-03-04 06:55:36,403 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -86 predicate places. [2025-03-04 06:55:36,403 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 274 transitions, 566 flow [2025-03-04 06:55:36,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:36,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:36,404 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] [2025-03-04 06:55:36,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:55:36,404 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:36,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1405578194, now seen corresponding path program 1 times [2025-03-04 06:55:36,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:36,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884005799] [2025-03-04 06:55:36,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:36,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:36,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 06:55:36,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 06:55:36,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:36,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:36,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:36,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884005799] [2025-03-04 06:55:36,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884005799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:36,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:36,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:36,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691466316] [2025-03-04 06:55:36,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:36,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:36,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:36,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:36,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:36,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 381 [2025-03-04 06:55:36,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 274 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:36,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:36,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 381 [2025-03-04 06:55:36,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:36,744 INFO L124 PetriNetUnfolderBase]: 595/1526 cut-off events. [2025-03-04 06:55:36,745 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2025-03-04 06:55:36,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2488 conditions, 1526 events. 595/1526 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8329 event pairs, 375 based on Foata normal form. 0/1366 useless extension candidates. Maximal degree in co-relation 2408. Up to 809 conditions per place. [2025-03-04 06:55:36,755 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 25 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-03-04 06:55:36,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 273 transitions, 618 flow [2025-03-04 06:55:36,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-03-04 06:55:36,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7480314960629921 [2025-03-04 06:55:36,758 INFO L175 Difference]: Start difference. First operand has 275 places, 274 transitions, 566 flow. Second operand 3 states and 855 transitions. [2025-03-04 06:55:36,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 273 transitions, 618 flow [2025-03-04 06:55:36,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 273 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:36,765 INFO L231 Difference]: Finished difference. Result has 274 places, 273 transitions, 564 flow [2025-03-04 06:55:36,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=274, PETRI_TRANSITIONS=273} [2025-03-04 06:55:36,767 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -87 predicate places. [2025-03-04 06:55:36,767 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 273 transitions, 564 flow [2025-03-04 06:55:36,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:36,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:36,768 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] [2025-03-04 06:55:36,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:55:36,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:36,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:36,770 INFO L85 PathProgramCache]: Analyzing trace with hash 172503133, now seen corresponding path program 1 times [2025-03-04 06:55:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:36,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043094610] [2025-03-04 06:55:36,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:36,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:36,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 06:55:36,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 06:55:36,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:36,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:36,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:36,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043094610] [2025-03-04 06:55:36,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043094610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:36,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:36,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:36,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571426460] [2025-03-04 06:55:36,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:36,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:36,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:36,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:36,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:36,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 381 [2025-03-04 06:55:36,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 273 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:36,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:36,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 381 [2025-03-04 06:55:36,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:37,112 INFO L124 PetriNetUnfolderBase]: 749/1831 cut-off events. [2025-03-04 06:55:37,113 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2025-03-04 06:55:37,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 1831 events. 749/1831 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10375 event pairs, 262 based on Foata normal form. 0/1652 useless extension candidates. Maximal degree in co-relation 2938. Up to 544 conditions per place. [2025-03-04 06:55:37,124 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 37 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-03-04 06:55:37,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 287 transitions, 678 flow [2025-03-04 06:55:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 878 transitions. [2025-03-04 06:55:37,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7681539807524059 [2025-03-04 06:55:37,127 INFO L175 Difference]: Start difference. First operand has 274 places, 273 transitions, 564 flow. Second operand 3 states and 878 transitions. [2025-03-04 06:55:37,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 287 transitions, 678 flow [2025-03-04 06:55:37,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 287 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:37,131 INFO L231 Difference]: Finished difference. Result has 274 places, 273 transitions, 568 flow [2025-03-04 06:55:37,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=274, PETRI_TRANSITIONS=273} [2025-03-04 06:55:37,132 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -87 predicate places. [2025-03-04 06:55:37,133 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 273 transitions, 568 flow [2025-03-04 06:55:37,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:37,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:37,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:55:37,134 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:37,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:37,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1383292697, now seen corresponding path program 1 times [2025-03-04 06:55:37,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:37,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757518127] [2025-03-04 06:55:37,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:37,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:37,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 06:55:37,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 06:55:37,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:37,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:37,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:37,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757518127] [2025-03-04 06:55:37,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757518127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:37,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:37,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:37,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289833855] [2025-03-04 06:55:37,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:37,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:37,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:37,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:37,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:37,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 381 [2025-03-04 06:55:37,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 273 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:37,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:37,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 381 [2025-03-04 06:55:37,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:37,407 INFO L124 PetriNetUnfolderBase]: 749/1954 cut-off events. [2025-03-04 06:55:37,407 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2025-03-04 06:55:37,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3313 conditions, 1954 events. 749/1954 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12046 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 1748. Up to 1018 conditions per place. [2025-03-04 06:55:37,419 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 25 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2025-03-04 06:55:37,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 272 transitions, 620 flow [2025-03-04 06:55:37,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:37,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-04 06:55:37,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7497812773403325 [2025-03-04 06:55:37,422 INFO L175 Difference]: Start difference. First operand has 274 places, 273 transitions, 568 flow. Second operand 3 states and 857 transitions. [2025-03-04 06:55:37,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 272 transitions, 620 flow [2025-03-04 06:55:37,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 272 transitions, 618 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:37,426 INFO L231 Difference]: Finished difference. Result has 274 places, 272 transitions, 568 flow [2025-03-04 06:55:37,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=274, PETRI_TRANSITIONS=272} [2025-03-04 06:55:37,427 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -87 predicate places. [2025-03-04 06:55:37,427 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 272 transitions, 568 flow [2025-03-04 06:55:37,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:37,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:37,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:37,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:55:37,428 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:37,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:37,429 INFO L85 PathProgramCache]: Analyzing trace with hash -536970527, now seen corresponding path program 1 times [2025-03-04 06:55:37,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:37,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586603503] [2025-03-04 06:55:37,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:37,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:37,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 06:55:37,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:55:37,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:37,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:37,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:37,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586603503] [2025-03-04 06:55:37,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586603503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:37,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:37,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:37,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166689287] [2025-03-04 06:55:37,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:37,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:37,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:37,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:37,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:37,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 381 [2025-03-04 06:55:37,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 272 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:37,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:37,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 381 [2025-03-04 06:55:37,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:37,700 INFO L124 PetriNetUnfolderBase]: 749/1953 cut-off events. [2025-03-04 06:55:37,700 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-04 06:55:37,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3258 conditions, 1953 events. 749/1953 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12051 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 3161. Up to 1016 conditions per place. [2025-03-04 06:55:37,713 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 24 selfloop transitions, 1 changer transitions 0/271 dead transitions. [2025-03-04 06:55:37,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 271 transitions, 616 flow [2025-03-04 06:55:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2025-03-04 06:55:37,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7559055118110236 [2025-03-04 06:55:37,717 INFO L175 Difference]: Start difference. First operand has 274 places, 272 transitions, 568 flow. Second operand 3 states and 864 transitions. [2025-03-04 06:55:37,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 271 transitions, 616 flow [2025-03-04 06:55:37,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 271 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:37,722 INFO L231 Difference]: Finished difference. Result has 273 places, 271 transitions, 564 flow [2025-03-04 06:55:37,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=273, PETRI_TRANSITIONS=271} [2025-03-04 06:55:37,724 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -88 predicate places. [2025-03-04 06:55:37,724 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 271 transitions, 564 flow [2025-03-04 06:55:37,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:37,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:37,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:37,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:55:37,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:37,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:37,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1435741756, now seen corresponding path program 1 times [2025-03-04 06:55:37,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:37,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219597755] [2025-03-04 06:55:37,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:37,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:37,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 06:55:37,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 06:55:37,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:37,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:37,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:37,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219597755] [2025-03-04 06:55:37,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219597755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:37,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:37,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:37,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393506921] [2025-03-04 06:55:37,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:37,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:37,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:37,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:37,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 381 [2025-03-04 06:55:37,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 271 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:37,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:37,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 381 [2025-03-04 06:55:37,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:38,050 INFO L124 PetriNetUnfolderBase]: 749/1952 cut-off events. [2025-03-04 06:55:38,050 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-04 06:55:38,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3258 conditions, 1952 events. 749/1952 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12052 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 3161. Up to 1018 conditions per place. [2025-03-04 06:55:38,061 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 25 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2025-03-04 06:55:38,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 270 transitions, 616 flow [2025-03-04 06:55:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-04 06:55:38,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7497812773403325 [2025-03-04 06:55:38,063 INFO L175 Difference]: Start difference. First operand has 273 places, 271 transitions, 564 flow. Second operand 3 states and 857 transitions. [2025-03-04 06:55:38,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 270 transitions, 616 flow [2025-03-04 06:55:38,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 270 transitions, 615 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:38,068 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 565 flow [2025-03-04 06:55:38,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2025-03-04 06:55:38,070 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -88 predicate places. [2025-03-04 06:55:38,070 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 565 flow [2025-03-04 06:55:38,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:38,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:38,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:38,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:55:38,071 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:38,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:38,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1105862111, now seen corresponding path program 1 times [2025-03-04 06:55:38,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:38,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435485421] [2025-03-04 06:55:38,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:38,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:38,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 06:55:38,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 06:55:38,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:38,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:38,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:38,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435485421] [2025-03-04 06:55:38,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435485421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:38,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:38,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:55:38,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224045679] [2025-03-04 06:55:38,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:38,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:55:38,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:38,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:55:38,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:55:38,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 381 [2025-03-04 06:55:38,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 565 flow. Second operand has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:38,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:38,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 381 [2025-03-04 06:55:38,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:38,782 INFO L124 PetriNetUnfolderBase]: 749/1950 cut-off events. [2025-03-04 06:55:38,783 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-04 06:55:38,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 1950 events. 749/1950 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12030 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 3183. Up to 1031 conditions per place. [2025-03-04 06:55:38,792 INFO L140 encePairwiseOnDemand]: 369/381 looper letters, 38 selfloop transitions, 10 changer transitions 0/268 dead transitions. [2025-03-04 06:55:38,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 268 transitions, 657 flow [2025-03-04 06:55:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:55:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:55:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1584 transitions. [2025-03-04 06:55:38,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6929133858267716 [2025-03-04 06:55:38,795 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 565 flow. Second operand 6 states and 1584 transitions. [2025-03-04 06:55:38,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 268 transitions, 657 flow [2025-03-04 06:55:38,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 268 transitions, 653 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:38,799 INFO L231 Difference]: Finished difference. Result has 274 places, 268 transitions, 577 flow [2025-03-04 06:55:38,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=577, PETRI_PLACES=274, PETRI_TRANSITIONS=268} [2025-03-04 06:55:38,800 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -87 predicate places. [2025-03-04 06:55:38,800 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 268 transitions, 577 flow [2025-03-04 06:55:38,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:38,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:38,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:38,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:55:38,802 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:38,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash -306595068, now seen corresponding path program 1 times [2025-03-04 06:55:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:38,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385319213] [2025-03-04 06:55:38,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:38,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:55:38,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:55:38,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:38,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:38,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:38,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385319213] [2025-03-04 06:55:38,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385319213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:38,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:38,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:38,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607199946] [2025-03-04 06:55:38,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:38,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:38,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:38,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:38,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:38,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 381 [2025-03-04 06:55:38,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 268 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:38,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:38,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 381 [2025-03-04 06:55:38,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:39,102 INFO L124 PetriNetUnfolderBase]: 749/1949 cut-off events. [2025-03-04 06:55:39,102 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-04 06:55:39,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 1949 events. 749/1949 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12039 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 3228. Up to 1016 conditions per place. [2025-03-04 06:55:39,115 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 24 selfloop transitions, 1 changer transitions 0/267 dead transitions. [2025-03-04 06:55:39,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 267 transitions, 625 flow [2025-03-04 06:55:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2025-03-04 06:55:39,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7559055118110236 [2025-03-04 06:55:39,118 INFO L175 Difference]: Start difference. First operand has 274 places, 268 transitions, 577 flow. Second operand 3 states and 864 transitions. [2025-03-04 06:55:39,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 267 transitions, 625 flow [2025-03-04 06:55:39,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 267 transitions, 605 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:55:39,123 INFO L231 Difference]: Finished difference. Result has 270 places, 267 transitions, 557 flow [2025-03-04 06:55:39,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=557, PETRI_PLACES=270, PETRI_TRANSITIONS=267} [2025-03-04 06:55:39,124 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -91 predicate places. [2025-03-04 06:55:39,124 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 267 transitions, 557 flow [2025-03-04 06:55:39,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:39,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:39,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:39,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:55:39,125 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:39,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:39,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1518379416, now seen corresponding path program 1 times [2025-03-04 06:55:39,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:39,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573676849] [2025-03-04 06:55:39,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:39,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:39,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 06:55:39,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 06:55:39,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:39,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:39,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:39,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573676849] [2025-03-04 06:55:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573676849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:39,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:39,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:39,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533511731] [2025-03-04 06:55:39,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:39,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:39,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:39,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:39,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 381 [2025-03-04 06:55:39,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 267 transitions, 557 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:39,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:39,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 381 [2025-03-04 06:55:39,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:39,407 INFO L124 PetriNetUnfolderBase]: 749/1948 cut-off events. [2025-03-04 06:55:39,408 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-04 06:55:39,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3255 conditions, 1948 events. 749/1948 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12010 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 3158. Up to 1018 conditions per place. [2025-03-04 06:55:39,416 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 25 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2025-03-04 06:55:39,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 266 transitions, 609 flow [2025-03-04 06:55:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-04 06:55:39,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7497812773403325 [2025-03-04 06:55:39,419 INFO L175 Difference]: Start difference. First operand has 270 places, 267 transitions, 557 flow. Second operand 3 states and 857 transitions. [2025-03-04 06:55:39,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 266 transitions, 609 flow [2025-03-04 06:55:39,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 266 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:39,423 INFO L231 Difference]: Finished difference. Result has 270 places, 266 transitions, 558 flow [2025-03-04 06:55:39,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=270, PETRI_TRANSITIONS=266} [2025-03-04 06:55:39,424 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -91 predicate places. [2025-03-04 06:55:39,425 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 266 transitions, 558 flow [2025-03-04 06:55:39,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:39,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:39,426 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:39,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:55:39,426 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:39,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:39,426 INFO L85 PathProgramCache]: Analyzing trace with hash 37236742, now seen corresponding path program 1 times [2025-03-04 06:55:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:39,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883158590] [2025-03-04 06:55:39,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:39,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:39,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 06:55:39,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 06:55:39,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:39,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:39,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:39,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883158590] [2025-03-04 06:55:39,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883158590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:39,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:39,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375386302] [2025-03-04 06:55:39,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:39,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:39,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:39,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:39,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:39,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 381 [2025-03-04 06:55:39,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 266 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:39,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:39,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 381 [2025-03-04 06:55:39,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:39,676 INFO L124 PetriNetUnfolderBase]: 749/1947 cut-off events. [2025-03-04 06:55:39,676 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-03-04 06:55:39,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 1947 events. 749/1947 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12018 event pairs, 488 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 3157. Up to 1016 conditions per place. [2025-03-04 06:55:39,684 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 24 selfloop transitions, 1 changer transitions 0/265 dead transitions. [2025-03-04 06:55:39,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 265 transitions, 606 flow [2025-03-04 06:55:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2025-03-04 06:55:39,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7559055118110236 [2025-03-04 06:55:39,687 INFO L175 Difference]: Start difference. First operand has 270 places, 266 transitions, 558 flow. Second operand 3 states and 864 transitions. [2025-03-04 06:55:39,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 265 transitions, 606 flow [2025-03-04 06:55:39,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 265 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:39,690 INFO L231 Difference]: Finished difference. Result has 269 places, 265 transitions, 554 flow [2025-03-04 06:55:39,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=269, PETRI_TRANSITIONS=265} [2025-03-04 06:55:39,691 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -92 predicate places. [2025-03-04 06:55:39,691 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 265 transitions, 554 flow [2025-03-04 06:55:39,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:39,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:39,691 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] [2025-03-04 06:55:39,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:55:39,692 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:39,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash -846093513, now seen corresponding path program 1 times [2025-03-04 06:55:39,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:39,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081264340] [2025-03-04 06:55:39,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:39,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:39,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:55:39,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:55:39,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:39,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:39,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081264340] [2025-03-04 06:55:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081264340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:39,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:39,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:39,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652766394] [2025-03-04 06:55:39,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:39,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:39,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:39,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:39,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:39,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 381 [2025-03-04 06:55:39,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 265 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:39,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:39,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 381 [2025-03-04 06:55:39,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:39,930 INFO L124 PetriNetUnfolderBase]: 758/1955 cut-off events. [2025-03-04 06:55:39,930 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2025-03-04 06:55:39,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 1955 events. 758/1955 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11597 event pairs, 362 based on Foata normal form. 0/1765 useless extension candidates. Maximal degree in co-relation 3182. Up to 1026 conditions per place. [2025-03-04 06:55:39,939 INFO L140 encePairwiseOnDemand]: 375/381 looper letters, 28 selfloop transitions, 5 changer transitions 0/272 dead transitions. [2025-03-04 06:55:39,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 272 transitions, 638 flow [2025-03-04 06:55:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2025-03-04 06:55:39,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7629046369203849 [2025-03-04 06:55:39,941 INFO L175 Difference]: Start difference. First operand has 269 places, 265 transitions, 554 flow. Second operand 3 states and 872 transitions. [2025-03-04 06:55:39,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 272 transitions, 638 flow [2025-03-04 06:55:39,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 272 transitions, 637 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:39,945 INFO L231 Difference]: Finished difference. Result has 270 places, 268 transitions, 582 flow [2025-03-04 06:55:39,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=270, PETRI_TRANSITIONS=268} [2025-03-04 06:55:39,945 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -91 predicate places. [2025-03-04 06:55:39,945 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 268 transitions, 582 flow [2025-03-04 06:55:39,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:39,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:39,946 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] [2025-03-04 06:55:39,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:55:39,946 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err14ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-04 06:55:39,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:39,947 INFO L85 PathProgramCache]: Analyzing trace with hash -608414551, now seen corresponding path program 1 times [2025-03-04 06:55:39,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:39,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448951942] [2025-03-04 06:55:39,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:39,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 06:55:39,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 06:55:39,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:39,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:55:40,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:40,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448951942] [2025-03-04 06:55:40,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448951942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:40,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:40,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973523313] [2025-03-04 06:55:40,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:40,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:40,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:40,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:40,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:40,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 381 [2025-03-04 06:55:40,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 268 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:40,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:40,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 381 [2025-03-04 06:55:40,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:40,214 INFO L124 PetriNetUnfolderBase]: 758/1951 cut-off events. [2025-03-04 06:55:40,214 INFO L125 PetriNetUnfolderBase]: For 487/487 co-relation queries the response was YES. [2025-03-04 06:55:40,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 1951 events. 758/1951 cut-off events. For 487/487 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11579 event pairs, 407 based on Foata normal form. 4/1762 useless extension candidates. Maximal degree in co-relation 3460. Up to 1029 conditions per place. [2025-03-04 06:55:40,220 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 0 selfloop transitions, 0 changer transitions 267/267 dead transitions. [2025-03-04 06:55:40,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 267 transitions, 634 flow [2025-03-04 06:55:40,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2025-03-04 06:55:40,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7567804024496938 [2025-03-04 06:55:40,222 INFO L175 Difference]: Start difference. First operand has 270 places, 268 transitions, 582 flow. Second operand 3 states and 865 transitions. [2025-03-04 06:55:40,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 267 transitions, 634 flow [2025-03-04 06:55:40,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 267 transitions, 634 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:55:40,224 INFO L231 Difference]: Finished difference. Result has 271 places, 0 transitions, 0 flow [2025-03-04 06:55:40,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=271, PETRI_TRANSITIONS=0} [2025-03-04 06:55:40,225 INFO L279 CegarLoopForPetriNet]: 361 programPoint places, -90 predicate places. [2025-03-04 06:55:40,225 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 0 transitions, 0 flow [2025-03-04 06:55:40,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:55:40,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (162 of 163 remaining) [2025-03-04 06:55:40,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (161 of 163 remaining) [2025-03-04 06:55:40,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (160 of 163 remaining) [2025-03-04 06:55:40,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (159 of 163 remaining) [2025-03-04 06:55:40,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (158 of 163 remaining) [2025-03-04 06:55:40,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (157 of 163 remaining) [2025-03-04 06:55:40,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (156 of 163 remaining) [2025-03-04 06:55:40,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (155 of 163 remaining) [2025-03-04 06:55:40,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (154 of 163 remaining) [2025-03-04 06:55:40,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (153 of 163 remaining) [2025-03-04 06:55:40,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (152 of 163 remaining) [2025-03-04 06:55:40,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (151 of 163 remaining) [2025-03-04 06:55:40,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (150 of 163 remaining) [2025-03-04 06:55:40,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (149 of 163 remaining) [2025-03-04 06:55:40,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (148 of 163 remaining) [2025-03-04 06:55:40,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (147 of 163 remaining) [2025-03-04 06:55:40,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (146 of 163 remaining) [2025-03-04 06:55:40,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (145 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (144 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (143 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (142 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (141 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (140 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (139 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (138 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (137 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (136 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (135 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (134 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (133 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (132 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (131 of 163 remaining) [2025-03-04 06:55:40,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (130 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (129 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (128 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (127 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (126 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (125 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (124 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (123 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (122 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (121 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (120 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (119 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (118 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (117 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (116 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (115 of 163 remaining) [2025-03-04 06:55:40,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (114 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (113 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (112 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (111 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (110 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (109 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (108 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (107 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (106 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (105 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (104 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (103 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (102 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (101 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (100 of 163 remaining) [2025-03-04 06:55:40,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (99 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (98 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (97 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (96 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (95 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (94 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (89 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (88 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (87 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (86 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (85 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (84 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (83 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (82 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (81 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (80 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (79 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (78 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (77 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (76 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (75 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (74 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (73 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (72 of 163 remaining) [2025-03-04 06:55:40,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (71 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (70 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (69 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (68 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (67 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (66 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (65 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (64 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (63 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (61 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (60 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (59 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (58 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (57 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (56 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (55 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (54 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (53 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (52 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (51 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (49 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (48 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (46 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (45 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (44 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 163 remaining) [2025-03-04 06:55:40,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 163 remaining) [2025-03-04 06:55:40,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 163 remaining) [2025-03-04 06:55:40,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 163 remaining) [2025-03-04 06:55:40,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (39 of 163 remaining) [2025-03-04 06:55:40,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (38 of 163 remaining) [2025-03-04 06:55:40,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (37 of 163 remaining) [2025-03-04 06:55:40,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (36 of 163 remaining) [2025-03-04 06:55:40,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (35 of 163 remaining) [2025-03-04 06:55:40,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (34 of 163 remaining) [2025-03-04 06:55:40,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (33 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (32 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (31 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (30 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (29 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (28 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (27 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (26 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (25 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (24 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (23 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (22 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (21 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (20 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (19 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (18 of 163 remaining) [2025-03-04 06:55:40,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (17 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (16 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (15 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (14 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (13 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (12 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (11 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (10 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (9 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (8 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (7 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 163 remaining) [2025-03-04 06:55:40,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 163 remaining) [2025-03-04 06:55:40,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:55:40,238 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:40,243 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:55:40,243 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:55:40,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:55:40 BasicIcfg [2025-03-04 06:55:40,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:55:40,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:55:40,251 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:55:40,251 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:55:40,252 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:33" (3/4) ... [2025-03-04 06:55:40,253 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:55:40,255 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:55:40,255 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:55:40,255 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:55:40,255 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-04 06:55:40,263 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-03-04 06:55:40,264 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:55:40,264 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 06:55:40,264 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:55:40,340 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:55:40,340 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:55:40,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:55:40,341 INFO L158 Benchmark]: Toolchain (without parser) took 8067.75ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 104.9MB in the beginning and 371.1MB in the end (delta: -266.2MB). Peak memory consumption was 199.7MB. Max. memory is 16.1GB. [2025-03-04 06:55:40,341 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:40,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.82ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 90.7MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 06:55:40,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.51ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 86.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:40,342 INFO L158 Benchmark]: Boogie Preprocessor took 25.04ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 84.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:40,343 INFO L158 Benchmark]: IcfgBuilder took 1253.06ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.9MB in the end (delta: 1.9MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2025-03-04 06:55:40,343 INFO L158 Benchmark]: TraceAbstraction took 6395.82ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 82.9MB in the beginning and 375.3MB in the end (delta: -292.4MB). Peak memory consumption was 177.8MB. Max. memory is 16.1GB. [2025-03-04 06:55:40,343 INFO L158 Benchmark]: Witness Printer took 89.50ms. Allocated memory is still 612.4MB. Free memory was 375.3MB in the beginning and 371.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:55:40,344 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.28ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.82ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 90.7MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.51ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 86.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.04ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 84.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1253.06ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.9MB in the end (delta: 1.9MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6395.82ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 82.9MB in the beginning and 375.3MB in the end (delta: -292.4MB). Peak memory consumption was 177.8MB. Max. memory is 16.1GB. * Witness Printer took 89.50ms. Allocated memory is still 612.4MB. Free memory was 375.3MB in the beginning and 371.1MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: 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: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 126]: 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: 129]: 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: 130]: 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: 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: 159]: 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: 159]: 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: 147]: 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: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 475 locations, 163 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.2s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 929 IncrementalHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 63 mSDtfsCounter, 929 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=744occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1756 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1738 ConstructedInterpolants, 0 QuantifiedInterpolants, 1887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 89 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:55:40,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE