./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-min.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 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:46:08,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:46:08,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:46:08,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:46:08,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:46:08,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:46:08,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:46:08,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:46:08,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:46:08,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:46:08,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:46:08,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:46:08,363 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:46:08,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:46:08,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:46:08,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:46:08,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:46:08,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:46:08,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:46:08,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:46:08,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:46:08,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:46:08,365 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:46:08,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:46:08,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:46:08,365 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 -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2025-03-14 01:46:08,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:46:08,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:46:08,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:46:08,578 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:46:08,578 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:46:08,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-14 01:46:09,684 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07f37380/3b40d170b4f74566845bf18013f4c4ee/FLAG8c82c6cf5 [2025-03-14 01:46:09,974 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:46:09,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-14 01:46:09,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07f37380/3b40d170b4f74566845bf18013f4c4ee/FLAG8c82c6cf5 [2025-03-14 01:46:10,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07f37380/3b40d170b4f74566845bf18013f4c4ee [2025-03-14 01:46:10,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:46:10,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:46:10,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:46:10,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:46:10,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:46:10,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:46:10" (1/1) ... [2025-03-14 01:46:10,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1906a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10, skipping insertion in model container [2025-03-14 01:46:10,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:46:10" (1/1) ... [2025-03-14 01:46:10,292 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:46:10,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:46:10,464 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:46:10,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:46:10,514 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:46:10,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10 WrapperNode [2025-03-14 01:46:10,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:46:10,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:46:10,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:46:10,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:46:10,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10" (1/1) ... [2025-03-14 01:46:10,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10" (1/1) ... [2025-03-14 01:46:10,560 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 338 [2025-03-14 01:46:10,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:46:10,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:46:10,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:46:10,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:46:10,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10" (1/1) ... [2025-03-14 01:46:10,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10" (1/1) ... [2025-03-14 01:46:10,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10" (1/1) ... [2025-03-14 01:46:10,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10" (1/1) ... [2025-03-14 01:46:10,590 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10" (1/1) ... [2025-03-14 01:46:10,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10" (1/1) ... [2025-03-14 01:46:10,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10" (1/1) ... [2025-03-14 01:46:10,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10" (1/1) ... [2025-03-14 01:46:10,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:46:10,599 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:46:10,599 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:46:10,599 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:46:10,600 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10" (1/1) ... [2025-03-14 01:46:10,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:46:10,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:46:10,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:46:10,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:46:10,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:46:10,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:46:10,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:46:10,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:46:10,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:46:10,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:46:10,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:46:10,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:46:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:46:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-14 01:46:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-14 01:46:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:46:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:46:10,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:46:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:46:10,660 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:46:10,750 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:46:10,752 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:46:11,367 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:46:11,367 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:46:11,368 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:46:11,521 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:46:11,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:46:11 BoogieIcfgContainer [2025-03-14 01:46:11,521 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:46:11,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:46:11,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:46:11,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:46:11,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:46:10" (1/3) ... [2025-03-14 01:46:11,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687eae71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:46:11, skipping insertion in model container [2025-03-14 01:46:11,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:46:10" (2/3) ... [2025-03-14 01:46:11,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687eae71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:46:11, skipping insertion in model container [2025-03-14 01:46:11,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:46:11" (3/3) ... [2025-03-14 01:46:11,531 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-03-14 01:46:11,544 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:46:11,545 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 484 locations, 1 initial locations, 6 loop locations, and 55 error locations. [2025-03-14 01:46:11,545 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:46:11,633 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:46:11,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 507 transitions, 1035 flow [2025-03-14 01:46:11,766 INFO L124 PetriNetUnfolderBase]: 24/504 cut-off events. [2025-03-14 01:46:11,769 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:46:11,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 504 events. 24/504 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 656 event pairs, 0 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 425. Up to 2 conditions per place. [2025-03-14 01:46:11,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 507 transitions, 1035 flow [2025-03-14 01:46:11,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 460 transitions, 938 flow [2025-03-14 01:46:11,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:46:11,801 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;@5d265751, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:46:11,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2025-03-14 01:46:11,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:46:11,811 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-14 01:46:11,812 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:46:11,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:11,812 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] [2025-03-14 01:46:11,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:11,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1878019136, now seen corresponding path program 1 times [2025-03-14 01:46:11,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:11,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745181280] [2025-03-14 01:46:11,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:11,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:11,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-14 01:46:11,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-14 01:46:11,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:11,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:11,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:11,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745181280] [2025-03-14 01:46:11,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745181280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:11,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:11,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008145483] [2025-03-14 01:46:11,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:11,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:11,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:11,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:11,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:12,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 507 [2025-03-14 01:46:12,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 460 transitions, 938 flow. Second operand has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:12,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:12,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 507 [2025-03-14 01:46:12,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:12,305 INFO L124 PetriNetUnfolderBase]: 101/1214 cut-off events. [2025-03-14 01:46:12,305 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-14 01:46:12,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1214 events. 101/1214 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6566 event pairs, 51 based on Foata normal form. 9/1015 useless extension candidates. Maximal degree in co-relation 955. Up to 135 conditions per place. [2025-03-14 01:46:12,318 INFO L140 encePairwiseOnDemand]: 478/507 looper letters, 19 selfloop transitions, 2 changer transitions 9/433 dead transitions. [2025-03-14 01:46:12,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 926 flow [2025-03-14 01:46:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1410 transitions. [2025-03-14 01:46:12,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9270216962524654 [2025-03-14 01:46:12,337 INFO L175 Difference]: Start difference. First operand has 449 places, 460 transitions, 938 flow. Second operand 3 states and 1410 transitions. [2025-03-14 01:46:12,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 926 flow [2025-03-14 01:46:12,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 433 transitions, 914 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:46:12,354 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 858 flow [2025-03-14 01:46:12,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2025-03-14 01:46:12,359 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -19 predicate places. [2025-03-14 01:46:12,359 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 858 flow [2025-03-14 01:46:12,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:12,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:12,360 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] [2025-03-14 01:46:12,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:46:12,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:12,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:12,361 INFO L85 PathProgramCache]: Analyzing trace with hash 735876682, now seen corresponding path program 1 times [2025-03-14 01:46:12,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:12,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028002369] [2025-03-14 01:46:12,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:12,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:12,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 01:46:12,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 01:46:12,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:12,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:12,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:12,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028002369] [2025-03-14 01:46:12,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028002369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:12,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:12,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:12,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672686035] [2025-03-14 01:46:12,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:12,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:12,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:12,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:12,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:12,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 507 [2025-03-14 01:46:12,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:12,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:12,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 507 [2025-03-14 01:46:12,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:12,663 INFO L124 PetriNetUnfolderBase]: 223/1237 cut-off events. [2025-03-14 01:46:12,663 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-14 01:46:12,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1237 events. 223/1237 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6566 event pairs, 128 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1525. Up to 299 conditions per place. [2025-03-14 01:46:12,674 INFO L140 encePairwiseOnDemand]: 499/507 looper letters, 23 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2025-03-14 01:46:12,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 417 transitions, 892 flow [2025-03-14 01:46:12,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1369 transitions. [2025-03-14 01:46:12,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9000657462195923 [2025-03-14 01:46:12,682 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 858 flow. Second operand 3 states and 1369 transitions. [2025-03-14 01:46:12,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 417 transitions, 892 flow [2025-03-14 01:46:12,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 417 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:12,689 INFO L231 Difference]: Finished difference. Result has 414 places, 417 transitions, 842 flow [2025-03-14 01:46:12,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=414, PETRI_TRANSITIONS=417} [2025-03-14 01:46:12,691 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -35 predicate places. [2025-03-14 01:46:12,691 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 417 transitions, 842 flow [2025-03-14 01:46:12,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:12,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:12,692 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-14 01:46:12,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:46:12,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:12,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1836123647, now seen corresponding path program 1 times [2025-03-14 01:46:12,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:12,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443990918] [2025-03-14 01:46:12,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:12,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:12,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-14 01:46:12,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-14 01:46:12,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:12,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:13,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:13,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443990918] [2025-03-14 01:46:13,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443990918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:13,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:13,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:13,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410957425] [2025-03-14 01:46:13,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:13,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:13,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:13,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:13,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:13,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 507 [2025-03-14 01:46:13,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 417 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:13,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:13,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 507 [2025-03-14 01:46:13,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:13,822 INFO L124 PetriNetUnfolderBase]: 287/1440 cut-off events. [2025-03-14 01:46:13,823 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-14 01:46:13,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1973 conditions, 1440 events. 287/1440 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8470 event pairs, 188 based on Foata normal form. 0/1252 useless extension candidates. Maximal degree in co-relation 1941. Up to 463 conditions per place. [2025-03-14 01:46:13,833 INFO L140 encePairwiseOnDemand]: 489/507 looper letters, 65 selfloop transitions, 15 changer transitions 0/414 dead transitions. [2025-03-14 01:46:13,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 414 transitions, 996 flow [2025-03-14 01:46:13,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:46:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:46:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2447 transitions. [2025-03-14 01:46:13,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8044049967126891 [2025-03-14 01:46:13,840 INFO L175 Difference]: Start difference. First operand has 414 places, 417 transitions, 842 flow. Second operand 6 states and 2447 transitions. [2025-03-14 01:46:13,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 414 transitions, 996 flow [2025-03-14 01:46:13,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 414 transitions, 995 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:13,847 INFO L231 Difference]: Finished difference. Result has 415 places, 414 transitions, 865 flow [2025-03-14 01:46:13,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=865, PETRI_PLACES=415, PETRI_TRANSITIONS=414} [2025-03-14 01:46:13,848 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -34 predicate places. [2025-03-14 01:46:13,848 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 414 transitions, 865 flow [2025-03-14 01:46:13,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:13,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:13,850 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-14 01:46:13,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:46:13,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:13,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash 426125964, now seen corresponding path program 1 times [2025-03-14 01:46:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:13,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023389795] [2025-03-14 01:46:13,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:13,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-14 01:46:13,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-14 01:46:13,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:13,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:13,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:13,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023389795] [2025-03-14 01:46:13,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023389795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:13,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:13,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:13,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292897520] [2025-03-14 01:46:13,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:13,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:13,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:13,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:13,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:13,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 507 [2025-03-14 01:46:13,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 414 transitions, 865 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:13,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:13,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 507 [2025-03-14 01:46:13,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:14,028 INFO L124 PetriNetUnfolderBase]: 64/654 cut-off events. [2025-03-14 01:46:14,028 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:46:14,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 654 events. 64/654 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2155 event pairs, 34 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 743. Up to 92 conditions per place. [2025-03-14 01:46:14,032 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-03-14 01:46:14,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 413 transitions, 899 flow [2025-03-14 01:46:14,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2025-03-14 01:46:14,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9138724523339908 [2025-03-14 01:46:14,035 INFO L175 Difference]: Start difference. First operand has 415 places, 414 transitions, 865 flow. Second operand 3 states and 1390 transitions. [2025-03-14 01:46:14,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 413 transitions, 899 flow [2025-03-14 01:46:14,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 413 transitions, 869 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:46:14,043 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 837 flow [2025-03-14 01:46:14,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2025-03-14 01:46:14,045 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -38 predicate places. [2025-03-14 01:46:14,045 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 837 flow [2025-03-14 01:46:14,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:14,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:14,046 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] [2025-03-14 01:46:14,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:46:14,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:14,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:14,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2012488136, now seen corresponding path program 1 times [2025-03-14 01:46:14,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:14,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777540774] [2025-03-14 01:46:14,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:14,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:14,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-14 01:46:14,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-14 01:46:14,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:14,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:14,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:14,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:14,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777540774] [2025-03-14 01:46:14,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777540774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:14,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:14,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:14,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575400665] [2025-03-14 01:46:14,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:14,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:14,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:14,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:14,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:14,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 507 [2025-03-14 01:46:14,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:14,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:14,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 507 [2025-03-14 01:46:14,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:14,230 INFO L124 PetriNetUnfolderBase]: 64/653 cut-off events. [2025-03-14 01:46:14,230 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:46:14,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 653 events. 64/653 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2008 event pairs, 34 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 729. Up to 92 conditions per place. [2025-03-14 01:46:14,233 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2025-03-14 01:46:14,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 412 transitions, 871 flow [2025-03-14 01:46:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2025-03-14 01:46:14,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9138724523339908 [2025-03-14 01:46:14,236 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 837 flow. Second operand 3 states and 1390 transitions. [2025-03-14 01:46:14,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 412 transitions, 871 flow [2025-03-14 01:46:14,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 412 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:14,241 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 835 flow [2025-03-14 01:46:14,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=835, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2025-03-14 01:46:14,242 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -39 predicate places. [2025-03-14 01:46:14,242 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 835 flow [2025-03-14 01:46:14,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:14,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:14,242 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] [2025-03-14 01:46:14,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:46:14,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:14,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:14,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1954385204, now seen corresponding path program 1 times [2025-03-14 01:46:14,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:14,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117985891] [2025-03-14 01:46:14,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:14,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-14 01:46:14,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-14 01:46:14,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:14,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:14,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:14,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:14,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117985891] [2025-03-14 01:46:14,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117985891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:14,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:14,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:14,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830675983] [2025-03-14 01:46:14,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:14,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:14,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:14,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:14,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:14,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 507 [2025-03-14 01:46:14,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 835 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:14,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:14,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 507 [2025-03-14 01:46:14,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:14,401 INFO L124 PetriNetUnfolderBase]: 30/482 cut-off events. [2025-03-14 01:46:14,401 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:46:14,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 482 events. 30/482 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 932 event pairs, 12 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 504. Up to 44 conditions per place. [2025-03-14 01:46:14,404 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 12 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2025-03-14 01:46:14,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 411 transitions, 861 flow [2025-03-14 01:46:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:14,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-14 01:46:14,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-14 01:46:14,407 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 835 flow. Second operand 3 states and 1398 transitions. [2025-03-14 01:46:14,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 411 transitions, 861 flow [2025-03-14 01:46:14,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 411 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:14,413 INFO L231 Difference]: Finished difference. Result has 409 places, 411 transitions, 833 flow [2025-03-14 01:46:14,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=833, PETRI_PLACES=409, PETRI_TRANSITIONS=411} [2025-03-14 01:46:14,415 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2025-03-14 01:46:14,415 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 411 transitions, 833 flow [2025-03-14 01:46:14,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:14,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:14,416 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] [2025-03-14 01:46:14,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:46:14,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:14,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:14,417 INFO L85 PathProgramCache]: Analyzing trace with hash 760126360, now seen corresponding path program 1 times [2025-03-14 01:46:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:14,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385012976] [2025-03-14 01:46:14,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:14,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-14 01:46:14,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-14 01:46:14,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:14,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:14,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:14,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385012976] [2025-03-14 01:46:14,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385012976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:14,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:14,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:14,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848313019] [2025-03-14 01:46:14,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:14,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:14,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:14,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:14,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:14,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 507 [2025-03-14 01:46:14,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 411 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:14,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:14,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 507 [2025-03-14 01:46:14,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:14,537 INFO L124 PetriNetUnfolderBase]: 30/481 cut-off events. [2025-03-14 01:46:14,537 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:46:14,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 481 events. 30/481 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 932 event pairs, 12 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 503. Up to 44 conditions per place. [2025-03-14 01:46:14,540 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 12 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-14 01:46:14,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 410 transitions, 859 flow [2025-03-14 01:46:14,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-14 01:46:14,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-14 01:46:14,542 INFO L175 Difference]: Start difference. First operand has 409 places, 411 transitions, 833 flow. Second operand 3 states and 1398 transitions. [2025-03-14 01:46:14,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 410 transitions, 859 flow [2025-03-14 01:46:14,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 410 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:14,546 INFO L231 Difference]: Finished difference. Result has 408 places, 410 transitions, 831 flow [2025-03-14 01:46:14,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=408, PETRI_TRANSITIONS=410} [2025-03-14 01:46:14,547 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2025-03-14 01:46:14,547 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 410 transitions, 831 flow [2025-03-14 01:46:14,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:14,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:14,548 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] [2025-03-14 01:46:14,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:46:14,548 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:14,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1857544941, now seen corresponding path program 1 times [2025-03-14 01:46:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:14,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331124032] [2025-03-14 01:46:14,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:14,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:14,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-14 01:46:14,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-14 01:46:14,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:14,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:14,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:14,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:14,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331124032] [2025-03-14 01:46:14,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331124032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:14,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:14,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:14,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78030629] [2025-03-14 01:46:14,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:14,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:14,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:14,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:14,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:14,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 507 [2025-03-14 01:46:14,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 410 transitions, 831 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:14,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:14,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 507 [2025-03-14 01:46:14,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:14,764 INFO L124 PetriNetUnfolderBase]: 122/1251 cut-off events. [2025-03-14 01:46:14,764 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 01:46:14,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 1251 events. 122/1251 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6409 event pairs, 56 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 1398. Up to 156 conditions per place. [2025-03-14 01:46:14,773 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 17 selfloop transitions, 1 changer transitions 0/406 dead transitions. [2025-03-14 01:46:14,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 406 transitions, 859 flow [2025-03-14 01:46:14,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2025-03-14 01:46:14,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9119000657462196 [2025-03-14 01:46:14,776 INFO L175 Difference]: Start difference. First operand has 408 places, 410 transitions, 831 flow. Second operand 3 states and 1387 transitions. [2025-03-14 01:46:14,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 406 transitions, 859 flow [2025-03-14 01:46:14,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 406 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:14,781 INFO L231 Difference]: Finished difference. Result has 404 places, 406 transitions, 821 flow [2025-03-14 01:46:14,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=404, PETRI_TRANSITIONS=406} [2025-03-14 01:46:14,782 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2025-03-14 01:46:14,783 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 406 transitions, 821 flow [2025-03-14 01:46:14,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:14,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:14,784 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] [2025-03-14 01:46:14,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:46:14,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:14,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:14,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1706998911, now seen corresponding path program 1 times [2025-03-14 01:46:14,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:14,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662332565] [2025-03-14 01:46:14,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:14,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:14,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-14 01:46:14,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-14 01:46:14,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:14,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:15,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:15,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662332565] [2025-03-14 01:46:15,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662332565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:15,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:15,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:15,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258297447] [2025-03-14 01:46:15,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:15,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:15,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:15,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:15,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:15,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 507 [2025-03-14 01:46:15,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 406 transitions, 821 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:15,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:15,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 507 [2025-03-14 01:46:15,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:15,747 INFO L124 PetriNetUnfolderBase]: 29/514 cut-off events. [2025-03-14 01:46:15,748 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-14 01:46:15,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 514 events. 29/514 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1135 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 558. Up to 43 conditions per place. [2025-03-14 01:46:15,750 INFO L140 encePairwiseOnDemand]: 500/507 looper letters, 35 selfloop transitions, 5 changer transitions 0/411 dead transitions. [2025-03-14 01:46:15,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 411 transitions, 915 flow [2025-03-14 01:46:15,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:46:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:46:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2025-03-14 01:46:15,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856015779092702 [2025-03-14 01:46:15,755 INFO L175 Difference]: Start difference. First operand has 404 places, 406 transitions, 821 flow. Second operand 6 states and 2694 transitions. [2025-03-14 01:46:15,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 411 transitions, 915 flow [2025-03-14 01:46:15,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 411 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:15,764 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 832 flow [2025-03-14 01:46:15,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=832, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2025-03-14 01:46:15,765 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -42 predicate places. [2025-03-14 01:46:15,765 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 832 flow [2025-03-14 01:46:15,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:15,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:15,767 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] [2025-03-14 01:46:15,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:46:15,767 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:15,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:15,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1261272741, now seen corresponding path program 1 times [2025-03-14 01:46:15,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:15,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417889340] [2025-03-14 01:46:15,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:15,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:15,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-14 01:46:15,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-14 01:46:15,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:15,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:15,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:15,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417889340] [2025-03-14 01:46:15,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417889340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:15,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:15,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:15,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401216910] [2025-03-14 01:46:15,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:15,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:15,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:15,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:15,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:15,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 507 [2025-03-14 01:46:15,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:15,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:15,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 507 [2025-03-14 01:46:15,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:15,938 INFO L124 PetriNetUnfolderBase]: 63/679 cut-off events. [2025-03-14 01:46:15,938 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-14 01:46:15,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 679 events. 63/679 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2307 event pairs, 36 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 809. Up to 98 conditions per place. [2025-03-14 01:46:15,941 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2025-03-14 01:46:15,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 404 transitions, 866 flow [2025-03-14 01:46:15,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2025-03-14 01:46:15,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9151873767258383 [2025-03-14 01:46:15,944 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 832 flow. Second operand 3 states and 1392 transitions. [2025-03-14 01:46:15,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 404 transitions, 866 flow [2025-03-14 01:46:15,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 404 transitions, 858 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 01:46:15,948 INFO L231 Difference]: Finished difference. Result has 404 places, 404 transitions, 826 flow [2025-03-14 01:46:15,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=404, PETRI_TRANSITIONS=404} [2025-03-14 01:46:15,949 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2025-03-14 01:46:15,949 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 404 transitions, 826 flow [2025-03-14 01:46:15,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:15,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:15,950 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] [2025-03-14 01:46:15,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:46:15,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:15,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:15,950 INFO L85 PathProgramCache]: Analyzing trace with hash -416385513, now seen corresponding path program 1 times [2025-03-14 01:46:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:15,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328558936] [2025-03-14 01:46:15,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:15,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:15,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-14 01:46:15,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-14 01:46:15,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:15,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:46:15,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:15,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328558936] [2025-03-14 01:46:15,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328558936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:15,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:15,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:15,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364358621] [2025-03-14 01:46:15,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:15,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:15,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:15,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:15,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:16,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 507 [2025-03-14 01:46:16,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 404 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:16,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:16,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 507 [2025-03-14 01:46:16,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:16,120 INFO L124 PetriNetUnfolderBase]: 121/1225 cut-off events. [2025-03-14 01:46:16,121 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-14 01:46:16,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 1225 events. 121/1225 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6224 event pairs, 58 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 1422. Up to 158 conditions per place. [2025-03-14 01:46:16,127 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 18 selfloop transitions, 1 changer transitions 0/400 dead transitions. [2025-03-14 01:46:16,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 400 transitions, 856 flow [2025-03-14 01:46:16,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2025-03-14 01:46:16,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9119000657462196 [2025-03-14 01:46:16,130 INFO L175 Difference]: Start difference. First operand has 404 places, 404 transitions, 826 flow. Second operand 3 states and 1387 transitions. [2025-03-14 01:46:16,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 400 transitions, 856 flow [2025-03-14 01:46:16,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 400 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:16,135 INFO L231 Difference]: Finished difference. Result has 400 places, 400 transitions, 816 flow [2025-03-14 01:46:16,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=400, PETRI_TRANSITIONS=400} [2025-03-14 01:46:16,136 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -49 predicate places. [2025-03-14 01:46:16,136 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 400 transitions, 816 flow [2025-03-14 01:46:16,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:16,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:16,137 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] [2025-03-14 01:46:16,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:46:16,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:16,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash -904113631, now seen corresponding path program 1 times [2025-03-14 01:46:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:16,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988866984] [2025-03-14 01:46:16,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:16,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-14 01:46:16,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-14 01:46:16,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:16,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:46:16,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:16,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988866984] [2025-03-14 01:46:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988866984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:16,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:16,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340022333] [2025-03-14 01:46:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:16,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:16,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:16,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:16,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:16,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 507 [2025-03-14 01:46:16,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 400 transitions, 816 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:16,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:16,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 507 [2025-03-14 01:46:16,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:17,005 INFO L124 PetriNetUnfolderBase]: 29/507 cut-off events. [2025-03-14 01:46:17,006 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-14 01:46:17,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 507 events. 29/507 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1113 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2025-03-14 01:46:17,008 INFO L140 encePairwiseOnDemand]: 500/507 looper letters, 35 selfloop transitions, 5 changer transitions 0/404 dead transitions. [2025-03-14 01:46:17,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 404 transitions, 908 flow [2025-03-14 01:46:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:46:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:46:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2025-03-14 01:46:17,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856015779092702 [2025-03-14 01:46:17,014 INFO L175 Difference]: Start difference. First operand has 400 places, 400 transitions, 816 flow. Second operand 6 states and 2694 transitions. [2025-03-14 01:46:17,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 404 transitions, 908 flow [2025-03-14 01:46:17,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 404 transitions, 907 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:17,038 INFO L231 Difference]: Finished difference. Result has 402 places, 398 transitions, 821 flow [2025-03-14 01:46:17,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=821, PETRI_PLACES=402, PETRI_TRANSITIONS=398} [2025-03-14 01:46:17,041 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -47 predicate places. [2025-03-14 01:46:17,042 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 398 transitions, 821 flow [2025-03-14 01:46:17,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:17,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:17,043 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] [2025-03-14 01:46:17,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:46:17,043 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:17,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash -490478450, now seen corresponding path program 1 times [2025-03-14 01:46:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:17,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481120949] [2025-03-14 01:46:17,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:17,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:17,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-14 01:46:17,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-14 01:46:17,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:17,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:46:17,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:17,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481120949] [2025-03-14 01:46:17,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481120949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:17,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:17,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378889482] [2025-03-14 01:46:17,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:17,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:17,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:17,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:17,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:17,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 507 [2025-03-14 01:46:17,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 398 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:17,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:17,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 507 [2025-03-14 01:46:17,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:17,199 INFO L124 PetriNetUnfolderBase]: 63/672 cut-off events. [2025-03-14 01:46:17,200 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-14 01:46:17,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 672 events. 63/672 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2204 event pairs, 36 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 804. Up to 98 conditions per place. [2025-03-14 01:46:17,203 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2025-03-14 01:46:17,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 397 transitions, 855 flow [2025-03-14 01:46:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2025-03-14 01:46:17,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9151873767258383 [2025-03-14 01:46:17,205 INFO L175 Difference]: Start difference. First operand has 402 places, 398 transitions, 821 flow. Second operand 3 states and 1392 transitions. [2025-03-14 01:46:17,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 397 transitions, 855 flow [2025-03-14 01:46:17,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 397 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:46:17,211 INFO L231 Difference]: Finished difference. Result has 398 places, 397 transitions, 813 flow [2025-03-14 01:46:17,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=398, PETRI_TRANSITIONS=397} [2025-03-14 01:46:17,212 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -51 predicate places. [2025-03-14 01:46:17,212 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 397 transitions, 813 flow [2025-03-14 01:46:17,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:17,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:17,213 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] [2025-03-14 01:46:17,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:46:17,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:17,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:17,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1708891383, now seen corresponding path program 1 times [2025-03-14 01:46:17,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:17,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959999485] [2025-03-14 01:46:17,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:17,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:17,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-14 01:46:17,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-14 01:46:17,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:17,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:17,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:46:17,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:17,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959999485] [2025-03-14 01:46:17,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959999485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:17,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:17,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:17,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009639639] [2025-03-14 01:46:17,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:17,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:17,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:17,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:17,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:17,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-14 01:46:17,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 397 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:17,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:17,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-14 01:46:17,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:17,359 INFO L124 PetriNetUnfolderBase]: 29/485 cut-off events. [2025-03-14 01:46:17,359 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-14 01:46:17,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 485 events. 29/485 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1012 event pairs, 14 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 530. Up to 50 conditions per place. [2025-03-14 01:46:17,361 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 14 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2025-03-14 01:46:17,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 396 transitions, 843 flow [2025-03-14 01:46:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2025-03-14 01:46:17,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178172255095332 [2025-03-14 01:46:17,364 INFO L175 Difference]: Start difference. First operand has 398 places, 397 transitions, 813 flow. Second operand 3 states and 1396 transitions. [2025-03-14 01:46:17,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 396 transitions, 843 flow [2025-03-14 01:46:17,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 396 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:17,368 INFO L231 Difference]: Finished difference. Result has 397 places, 396 transitions, 811 flow [2025-03-14 01:46:17,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=397, PETRI_TRANSITIONS=396} [2025-03-14 01:46:17,369 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -52 predicate places. [2025-03-14 01:46:17,370 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 396 transitions, 811 flow [2025-03-14 01:46:17,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:17,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:17,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:17,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:46:17,371 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:17,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:17,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1601526621, now seen corresponding path program 1 times [2025-03-14 01:46:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:17,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342014584] [2025-03-14 01:46:17,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:17,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-14 01:46:17,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-14 01:46:17,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:17,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:46:17,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:17,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342014584] [2025-03-14 01:46:17,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342014584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:17,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:17,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:17,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659428937] [2025-03-14 01:46:17,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:17,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:17,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:17,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:17,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:17,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-14 01:46:17,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 396 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:17,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:17,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-14 01:46:17,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:17,623 INFO L124 PetriNetUnfolderBase]: 109/1236 cut-off events. [2025-03-14 01:46:17,624 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-14 01:46:17,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 1236 events. 109/1236 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6973 event pairs, 25 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 1430. Up to 91 conditions per place. [2025-03-14 01:46:17,633 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 24 selfloop transitions, 3 changer transitions 0/405 dead transitions. [2025-03-14 01:46:17,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 405 transitions, 892 flow [2025-03-14 01:46:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1407 transitions. [2025-03-14 01:46:17,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9250493096646942 [2025-03-14 01:46:17,637 INFO L175 Difference]: Start difference. First operand has 397 places, 396 transitions, 811 flow. Second operand 3 states and 1407 transitions. [2025-03-14 01:46:17,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 405 transitions, 892 flow [2025-03-14 01:46:17,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 405 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:17,641 INFO L231 Difference]: Finished difference. Result has 396 places, 396 transitions, 820 flow [2025-03-14 01:46:17,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=396, PETRI_TRANSITIONS=396} [2025-03-14 01:46:17,643 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -53 predicate places. [2025-03-14 01:46:17,643 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 396 transitions, 820 flow [2025-03-14 01:46:17,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:17,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:17,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:17,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:46:17,644 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:17,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:17,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1878384007, now seen corresponding path program 1 times [2025-03-14 01:46:17,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:17,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960922923] [2025-03-14 01:46:17,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:17,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:17,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-14 01:46:17,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-14 01:46:17,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:17,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:46:17,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:17,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960922923] [2025-03-14 01:46:17,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960922923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:17,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:17,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:46:17,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511249264] [2025-03-14 01:46:17,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:17,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:46:17,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:17,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:46:17,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:46:18,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 507 [2025-03-14 01:46:18,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 396 transitions, 820 flow. Second operand has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:18,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:18,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 507 [2025-03-14 01:46:18,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:18,717 INFO L124 PetriNetUnfolderBase]: 234/2125 cut-off events. [2025-03-14 01:46:18,718 INFO L125 PetriNetUnfolderBase]: For 139/141 co-relation queries the response was YES. [2025-03-14 01:46:18,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 2125 events. 234/2125 cut-off events. For 139/141 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 11757 event pairs, 122 based on Foata normal form. 9/1969 useless extension candidates. Maximal degree in co-relation 2670. Up to 245 conditions per place. [2025-03-14 01:46:18,729 INFO L140 encePairwiseOnDemand]: 478/507 looper letters, 52 selfloop transitions, 42 changer transitions 0/447 dead transitions. [2025-03-14 01:46:18,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 447 transitions, 1126 flow [2025-03-14 01:46:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:46:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:46:18,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4442 transitions. [2025-03-14 01:46:18,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761341222879684 [2025-03-14 01:46:18,736 INFO L175 Difference]: Start difference. First operand has 396 places, 396 transitions, 820 flow. Second operand 10 states and 4442 transitions. [2025-03-14 01:46:18,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 447 transitions, 1126 flow [2025-03-14 01:46:18,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 447 transitions, 1123 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:18,742 INFO L231 Difference]: Finished difference. Result has 408 places, 421 transitions, 1009 flow [2025-03-14 01:46:18,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1009, PETRI_PLACES=408, PETRI_TRANSITIONS=421} [2025-03-14 01:46:18,743 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2025-03-14 01:46:18,743 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 421 transitions, 1009 flow [2025-03-14 01:46:18,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:18,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:18,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:18,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:46:18,744 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:18,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:18,745 INFO L85 PathProgramCache]: Analyzing trace with hash -33863719, now seen corresponding path program 1 times [2025-03-14 01:46:18,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:18,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48830020] [2025-03-14 01:46:18,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:18,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:18,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-14 01:46:18,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-14 01:46:18,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:18,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:46:18,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:18,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48830020] [2025-03-14 01:46:18,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48830020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:18,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:18,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:18,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399898829] [2025-03-14 01:46:18,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:18,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:18,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:18,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:18,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 507 [2025-03-14 01:46:18,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 421 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:18,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:18,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 507 [2025-03-14 01:46:18,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:18,994 INFO L124 PetriNetUnfolderBase]: 84/1026 cut-off events. [2025-03-14 01:46:18,995 INFO L125 PetriNetUnfolderBase]: For 72/75 co-relation queries the response was YES. [2025-03-14 01:46:18,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1026 events. 84/1026 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3144 event pairs, 39 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1272. Up to 125 conditions per place. [2025-03-14 01:46:18,999 INFO L140 encePairwiseOnDemand]: 505/507 looper letters, 12 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2025-03-14 01:46:18,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 420 transitions, 1033 flow [2025-03-14 01:46:18,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1405 transitions. [2025-03-14 01:46:19,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9237343852728468 [2025-03-14 01:46:19,002 INFO L175 Difference]: Start difference. First operand has 408 places, 421 transitions, 1009 flow. Second operand 3 states and 1405 transitions. [2025-03-14 01:46:19,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 420 transitions, 1033 flow [2025-03-14 01:46:19,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 420 transitions, 1033 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:46:19,008 INFO L231 Difference]: Finished difference. Result has 409 places, 420 transitions, 1009 flow [2025-03-14 01:46:19,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1009, PETRI_PLACES=409, PETRI_TRANSITIONS=420} [2025-03-14 01:46:19,009 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2025-03-14 01:46:19,009 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 420 transitions, 1009 flow [2025-03-14 01:46:19,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:19,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:19,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:19,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:46:19,010 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:19,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:19,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1381431851, now seen corresponding path program 1 times [2025-03-14 01:46:19,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:19,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776300459] [2025-03-14 01:46:19,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:19,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:19,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-14 01:46:19,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-14 01:46:19,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:19,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:46:19,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:19,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776300459] [2025-03-14 01:46:19,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776300459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:19,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:19,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:19,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089325811] [2025-03-14 01:46:19,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:19,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:19,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:19,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:19,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:19,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-14 01:46:19,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 420 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:19,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:19,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-14 01:46:19,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:19,352 INFO L124 PetriNetUnfolderBase]: 235/2240 cut-off events. [2025-03-14 01:46:19,352 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-03-14 01:46:19,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2895 conditions, 2240 events. 235/2240 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13803 event pairs, 61 based on Foata normal form. 4/2098 useless extension candidates. Maximal degree in co-relation 2853. Up to 176 conditions per place. [2025-03-14 01:46:19,360 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 20 selfloop transitions, 2 changer transitions 31/429 dead transitions. [2025-03-14 01:46:19,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 429 transitions, 1088 flow [2025-03-14 01:46:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1406 transitions. [2025-03-14 01:46:19,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9243918474687706 [2025-03-14 01:46:19,363 INFO L175 Difference]: Start difference. First operand has 409 places, 420 transitions, 1009 flow. Second operand 3 states and 1406 transitions. [2025-03-14 01:46:19,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 429 transitions, 1088 flow [2025-03-14 01:46:19,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 429 transitions, 1087 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:46:19,369 INFO L231 Difference]: Finished difference. Result has 409 places, 390 transitions, 884 flow [2025-03-14 01:46:19,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=409, PETRI_TRANSITIONS=390} [2025-03-14 01:46:19,370 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2025-03-14 01:46:19,370 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 390 transitions, 884 flow [2025-03-14 01:46:19,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:19,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:19,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:19,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:46:19,370 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:19,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:19,372 INFO L85 PathProgramCache]: Analyzing trace with hash 995942707, now seen corresponding path program 1 times [2025-03-14 01:46:19,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:19,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542454887] [2025-03-14 01:46:19,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:19,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:19,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-14 01:46:19,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-14 01:46:19,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:19,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:46:19,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:19,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542454887] [2025-03-14 01:46:19,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542454887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:46:19,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145670371] [2025-03-14 01:46:19,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:19,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:46:19,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:46:19,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:46:19,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:46:19,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-14 01:46:19,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-14 01:46:19,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:19,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:19,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:46:19,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:46:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:46:20,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:46:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:46:20,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145670371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:46:20,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:46:20,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-14 01:46:20,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817490097] [2025-03-14 01:46:20,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:46:20,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 01:46:20,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:20,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 01:46:20,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-14 01:46:21,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 507 [2025-03-14 01:46:21,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 390 transitions, 884 flow. Second operand has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:21,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:21,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 507 [2025-03-14 01:46:21,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:22,232 INFO L124 PetriNetUnfolderBase]: 447/3267 cut-off events. [2025-03-14 01:46:22,232 INFO L125 PetriNetUnfolderBase]: For 399/409 co-relation queries the response was YES. [2025-03-14 01:46:22,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 3267 events. 447/3267 cut-off events. For 399/409 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 21613 event pairs, 201 based on Foata normal form. 9/3024 useless extension candidates. Maximal degree in co-relation 4522. Up to 437 conditions per place. [2025-03-14 01:46:22,248 INFO L140 encePairwiseOnDemand]: 468/507 looper letters, 34 selfloop transitions, 36 changer transitions 77/480 dead transitions. [2025-03-14 01:46:22,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 480 transitions, 1461 flow [2025-03-14 01:46:22,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:46:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:46:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 8217 transitions. [2025-03-14 01:46:22,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530052943008408 [2025-03-14 01:46:22,258 INFO L175 Difference]: Start difference. First operand has 409 places, 390 transitions, 884 flow. Second operand 19 states and 8217 transitions. [2025-03-14 01:46:22,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 480 transitions, 1461 flow [2025-03-14 01:46:22,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 480 transitions, 1357 flow, removed 21 selfloop flow, removed 8 redundant places. [2025-03-14 01:46:22,265 INFO L231 Difference]: Finished difference. Result has 418 places, 397 transitions, 1004 flow [2025-03-14 01:46:22,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1004, PETRI_PLACES=418, PETRI_TRANSITIONS=397} [2025-03-14 01:46:22,265 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -31 predicate places. [2025-03-14 01:46:22,265 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 397 transitions, 1004 flow [2025-03-14 01:46:22,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:22,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:22,272 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:22,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 01:46:22,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:46:22,473 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:22,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:22,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1018016889, now seen corresponding path program 2 times [2025-03-14 01:46:22,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:22,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957913837] [2025-03-14 01:46:22,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:46:22,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:22,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 325 statements into 2 equivalence classes. [2025-03-14 01:46:22,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 233 of 325 statements. [2025-03-14 01:46:22,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:46:22,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-14 01:46:22,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:22,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957913837] [2025-03-14 01:46:22,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957913837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:22,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:22,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:22,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045430224] [2025-03-14 01:46:22,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:22,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:22,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:22,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:22,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:23,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 507 [2025-03-14 01:46:23,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 397 transitions, 1004 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:23,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:23,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 507 [2025-03-14 01:46:23,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:23,899 INFO L124 PetriNetUnfolderBase]: 641/3387 cut-off events. [2025-03-14 01:46:23,899 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-03-14 01:46:23,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5090 conditions, 3387 events. 641/3387 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 26132 event pairs, 130 based on Foata normal form. 0/3134 useless extension candidates. Maximal degree in co-relation 5040. Up to 607 conditions per place. [2025-03-14 01:46:23,914 INFO L140 encePairwiseOnDemand]: 493/507 looper letters, 53 selfloop transitions, 19 changer transitions 0/434 dead transitions. [2025-03-14 01:46:23,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 434 transitions, 1246 flow [2025-03-14 01:46:23,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:46:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:46:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2025-03-14 01:46:23,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888560157790927 [2025-03-14 01:46:23,917 INFO L175 Difference]: Start difference. First operand has 418 places, 397 transitions, 1004 flow. Second operand 6 states and 2703 transitions. [2025-03-14 01:46:23,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 434 transitions, 1246 flow [2025-03-14 01:46:23,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 434 transitions, 1181 flow, removed 17 selfloop flow, removed 10 redundant places. [2025-03-14 01:46:23,922 INFO L231 Difference]: Finished difference. Result has 405 places, 415 transitions, 1095 flow [2025-03-14 01:46:23,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1095, PETRI_PLACES=405, PETRI_TRANSITIONS=415} [2025-03-14 01:46:23,923 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -44 predicate places. [2025-03-14 01:46:23,923 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 415 transitions, 1095 flow [2025-03-14 01:46:23,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:23,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:23,924 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:23,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 01:46:23,924 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:23,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash -41450919, now seen corresponding path program 1 times [2025-03-14 01:46:23,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:23,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476884571] [2025-03-14 01:46:23,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:23,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:23,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-14 01:46:23,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-14 01:46:23,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:23,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-14 01:46:25,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:25,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476884571] [2025-03-14 01:46:25,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476884571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:25,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:25,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 01:46:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169154403] [2025-03-14 01:46:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:25,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 01:46:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:25,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 01:46:25,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-14 01:46:28,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 507 [2025-03-14 01:46:28,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 415 transitions, 1095 flow. Second operand has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:28,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:28,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 507 [2025-03-14 01:46:28,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:30,574 INFO L124 PetriNetUnfolderBase]: 1387/7804 cut-off events. [2025-03-14 01:46:30,574 INFO L125 PetriNetUnfolderBase]: For 2746/3050 co-relation queries the response was YES. [2025-03-14 01:46:30,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12886 conditions, 7804 events. 1387/7804 cut-off events. For 2746/3050 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 82534 event pairs, 262 based on Foata normal form. 180/7316 useless extension candidates. Maximal degree in co-relation 12838. Up to 717 conditions per place. [2025-03-14 01:46:30,615 INFO L140 encePairwiseOnDemand]: 472/507 looper letters, 75 selfloop transitions, 53 changer transitions 0/470 dead transitions. [2025-03-14 01:46:30,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 470 transitions, 1579 flow [2025-03-14 01:46:30,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-14 01:46:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-14 01:46:30,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 13670 transitions. [2025-03-14 01:46:30,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8170462016615863 [2025-03-14 01:46:30,628 INFO L175 Difference]: Start difference. First operand has 405 places, 415 transitions, 1095 flow. Second operand 33 states and 13670 transitions. [2025-03-14 01:46:30,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 470 transitions, 1579 flow [2025-03-14 01:46:30,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 470 transitions, 1579 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:46:30,640 INFO L231 Difference]: Finished difference. Result has 441 places, 441 transitions, 1387 flow [2025-03-14 01:46:30,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1387, PETRI_PLACES=441, PETRI_TRANSITIONS=441} [2025-03-14 01:46:30,642 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -8 predicate places. [2025-03-14 01:46:30,642 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 441 transitions, 1387 flow [2025-03-14 01:46:30,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:30,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:30,645 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:30,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 01:46:30,646 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:30,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:30,647 INFO L85 PathProgramCache]: Analyzing trace with hash 53419841, now seen corresponding path program 2 times [2025-03-14 01:46:30,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:30,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203748491] [2025-03-14 01:46:30,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:46:30,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:30,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 337 statements into 2 equivalence classes. [2025-03-14 01:46:30,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 245 of 337 statements. [2025-03-14 01:46:30,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:46:30,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-14 01:46:32,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:32,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203748491] [2025-03-14 01:46:32,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203748491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:32,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:32,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 01:46:32,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93104574] [2025-03-14 01:46:32,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:32,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-14 01:46:32,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:32,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-14 01:46:32,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2025-03-14 01:46:35,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 507 [2025-03-14 01:46:35,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 441 transitions, 1387 flow. Second operand has 21 states, 21 states have (on average 411.5238095238095) internal successors, (8642), 21 states have internal predecessors, (8642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:35,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:35,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 507 [2025-03-14 01:46:35,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:38,887 INFO L124 PetriNetUnfolderBase]: 2446/12475 cut-off events. [2025-03-14 01:46:38,888 INFO L125 PetriNetUnfolderBase]: For 10128/11247 co-relation queries the response was YES. [2025-03-14 01:46:38,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23504 conditions, 12475 events. 2446/12475 cut-off events. For 10128/11247 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 138175 event pairs, 426 based on Foata normal form. 112/11468 useless extension candidates. Maximal degree in co-relation 23450. Up to 1178 conditions per place. [2025-03-14 01:46:38,962 INFO L140 encePairwiseOnDemand]: 472/507 looper letters, 135 selfloop transitions, 64 changer transitions 0/538 dead transitions. [2025-03-14 01:46:38,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 538 transitions, 2326 flow [2025-03-14 01:46:38,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 01:46:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 01:46:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 14442 transitions. [2025-03-14 01:46:38,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8138630600169062 [2025-03-14 01:46:38,971 INFO L175 Difference]: Start difference. First operand has 441 places, 441 transitions, 1387 flow. Second operand 35 states and 14442 transitions. [2025-03-14 01:46:38,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 538 transitions, 2326 flow [2025-03-14 01:46:38,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 538 transitions, 2275 flow, removed 0 selfloop flow, removed 26 redundant places. [2025-03-14 01:46:38,992 INFO L231 Difference]: Finished difference. Result has 455 places, 467 transitions, 1760 flow [2025-03-14 01:46:38,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1760, PETRI_PLACES=455, PETRI_TRANSITIONS=467} [2025-03-14 01:46:38,994 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 6 predicate places. [2025-03-14 01:46:38,994 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 467 transitions, 1760 flow [2025-03-14 01:46:38,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 411.5238095238095) internal successors, (8642), 21 states have internal predecessors, (8642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:38,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:38,998 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:38,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 01:46:38,998 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:38,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash 907005653, now seen corresponding path program 1 times [2025-03-14 01:46:39,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:39,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153957129] [2025-03-14 01:46:39,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:39,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:39,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-14 01:46:39,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-14 01:46:39,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:39,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-14 01:46:39,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:39,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153957129] [2025-03-14 01:46:39,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153957129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:39,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:39,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:46:39,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964067511] [2025-03-14 01:46:39,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:39,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:46:39,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:39,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:46:39,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:46:39,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 507 [2025-03-14 01:46:39,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 467 transitions, 1760 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:39,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:39,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 507 [2025-03-14 01:46:39,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:42,969 INFO L124 PetriNetUnfolderBase]: 4295/17196 cut-off events. [2025-03-14 01:46:42,970 INFO L125 PetriNetUnfolderBase]: For 22382/22670 co-relation queries the response was YES. [2025-03-14 01:46:43,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36046 conditions, 17196 events. 4295/17196 cut-off events. For 22382/22670 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 198820 event pairs, 701 based on Foata normal form. 144/16175 useless extension candidates. Maximal degree in co-relation 35989. Up to 2818 conditions per place. [2025-03-14 01:46:43,118 INFO L140 encePairwiseOnDemand]: 493/507 looper letters, 76 selfloop transitions, 32 changer transitions 0/512 dead transitions. [2025-03-14 01:46:43,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 512 transitions, 2200 flow [2025-03-14 01:46:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:46:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:46:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2025-03-14 01:46:43,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888560157790927 [2025-03-14 01:46:43,121 INFO L175 Difference]: Start difference. First operand has 455 places, 467 transitions, 1760 flow. Second operand 6 states and 2703 transitions. [2025-03-14 01:46:43,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 512 transitions, 2200 flow [2025-03-14 01:46:43,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 512 transitions, 2133 flow, removed 8 selfloop flow, removed 26 redundant places. [2025-03-14 01:46:43,174 INFO L231 Difference]: Finished difference. Result has 439 places, 493 transitions, 2037 flow [2025-03-14 01:46:43,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2037, PETRI_PLACES=439, PETRI_TRANSITIONS=493} [2025-03-14 01:46:43,175 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -10 predicate places. [2025-03-14 01:46:43,175 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 493 transitions, 2037 flow [2025-03-14 01:46:43,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:43,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:43,176 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:43,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 01:46:43,176 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:43,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:43,177 INFO L85 PathProgramCache]: Analyzing trace with hash -933927338, now seen corresponding path program 1 times [2025-03-14 01:46:43,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:43,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623131427] [2025-03-14 01:46:43,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:43,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:43,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-14 01:46:43,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-14 01:46:43,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:43,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-14 01:46:43,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:43,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623131427] [2025-03-14 01:46:43,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623131427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:46:43,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:46:43,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:46:43,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740541364] [2025-03-14 01:46:43,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:46:43,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:46:43,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:43,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:46:43,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:46:43,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-14 01:46:43,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 493 transitions, 2037 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:43,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:43,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-14 01:46:43,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:45,640 INFO L124 PetriNetUnfolderBase]: 3102/14972 cut-off events. [2025-03-14 01:46:45,640 INFO L125 PetriNetUnfolderBase]: For 30768/31208 co-relation queries the response was YES. [2025-03-14 01:46:45,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33841 conditions, 14972 events. 3102/14972 cut-off events. For 30768/31208 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 174155 event pairs, 859 based on Foata normal form. 81/13843 useless extension candidates. Maximal degree in co-relation 33781. Up to 2419 conditions per place. [2025-03-14 01:46:45,894 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 49 selfloop transitions, 2 changer transitions 0/499 dead transitions. [2025-03-14 01:46:45,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 499 transitions, 2179 flow [2025-03-14 01:46:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:46:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:46:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-14 01:46:45,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-14 01:46:45,896 INFO L175 Difference]: Start difference. First operand has 439 places, 493 transitions, 2037 flow. Second operand 3 states and 1398 transitions. [2025-03-14 01:46:45,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 499 transitions, 2179 flow [2025-03-14 01:46:45,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 499 transitions, 2163 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-03-14 01:46:45,982 INFO L231 Difference]: Finished difference. Result has 440 places, 492 transitions, 2023 flow [2025-03-14 01:46:45,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=2019, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2023, PETRI_PLACES=440, PETRI_TRANSITIONS=492} [2025-03-14 01:46:45,983 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -9 predicate places. [2025-03-14 01:46:45,983 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 492 transitions, 2023 flow [2025-03-14 01:46:45,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:45,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:45,984 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:45,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 01:46:45,984 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:45,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:45,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1783545730, now seen corresponding path program 1 times [2025-03-14 01:46:45,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:45,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006425223] [2025-03-14 01:46:45,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:45,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:46,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-14 01:46:46,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-14 01:46:46,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:46,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-14 01:46:46,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:46,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006425223] [2025-03-14 01:46:46,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006425223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:46:46,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334395323] [2025-03-14 01:46:46,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:46,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:46:46,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:46:46,447 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:46:46,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:46:46,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-14 01:46:46,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-14 01:46:46,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:46,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:46,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-14 01:46:46,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:46:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-14 01:46:47,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:46:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 18 proven. 17 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-14 01:46:47,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334395323] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:46:47,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:46:47,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2025-03-14 01:46:47,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761033506] [2025-03-14 01:46:47,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:46:47,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-14 01:46:47,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:47,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-14 01:46:47,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2025-03-14 01:46:48,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 507 [2025-03-14 01:46:48,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 492 transitions, 2023 flow. Second operand has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:48,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:46:48,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 507 [2025-03-14 01:46:48,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:46:54,895 INFO L124 PetriNetUnfolderBase]: 6325/27577 cut-off events. [2025-03-14 01:46:54,895 INFO L125 PetriNetUnfolderBase]: For 64453/68053 co-relation queries the response was YES. [2025-03-14 01:46:55,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62611 conditions, 27577 events. 6325/27577 cut-off events. For 64453/68053 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 333457 event pairs, 1869 based on Foata normal form. 847/26801 useless extension candidates. Maximal degree in co-relation 62548. Up to 5136 conditions per place. [2025-03-14 01:46:55,140 INFO L140 encePairwiseOnDemand]: 465/507 looper letters, 134 selfloop transitions, 123 changer transitions 0/633 dead transitions. [2025-03-14 01:46:55,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 633 transitions, 3296 flow [2025-03-14 01:46:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 01:46:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 01:46:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 14556 transitions. [2025-03-14 01:46:55,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8444135050469892 [2025-03-14 01:46:55,149 INFO L175 Difference]: Start difference. First operand has 440 places, 492 transitions, 2023 flow. Second operand 34 states and 14556 transitions. [2025-03-14 01:46:55,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 633 transitions, 3296 flow [2025-03-14 01:46:55,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 633 transitions, 3292 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:46:55,270 INFO L231 Difference]: Finished difference. Result has 481 places, 576 transitions, 2843 flow [2025-03-14 01:46:55,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=2019, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2843, PETRI_PLACES=481, PETRI_TRANSITIONS=576} [2025-03-14 01:46:55,271 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 32 predicate places. [2025-03-14 01:46:55,272 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 576 transitions, 2843 flow [2025-03-14 01:46:55,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:46:55,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:46:55,274 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:46:55,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:46:55,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-14 01:46:55,475 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:46:55,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:46:55,477 INFO L85 PathProgramCache]: Analyzing trace with hash 547826461, now seen corresponding path program 1 times [2025-03-14 01:46:55,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:46:55,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839097232] [2025-03-14 01:46:55,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:55,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:46:55,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-14 01:46:55,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-14 01:46:55,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:55,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-14 01:46:56,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:46:56,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839097232] [2025-03-14 01:46:56,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839097232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:46:56,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422152418] [2025-03-14 01:46:56,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:46:56,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:46:56,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:46:56,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:46:56,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 01:46:56,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-14 01:46:56,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-14 01:46:56,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:46:56,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:46:56,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-14 01:46:56,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:46:56,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 01:46:56,649 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:46:56,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-14 01:46:57,006 INFO L349 Elim1Store]: treesize reduction 432, result has 7.9 percent of original size [2025-03-14 01:46:57,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 81 [2025-03-14 01:46:57,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 62 [2025-03-14 01:46:57,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2025-03-14 01:46:57,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2025-03-14 01:46:57,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 71 [2025-03-14 01:46:57,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2025-03-14 01:46:57,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2025-03-14 01:46:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-14 01:46:57,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:46:57,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:46:57,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 114 [2025-03-14 01:46:57,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:46:57,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 98 [2025-03-14 01:46:57,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2025-03-14 01:46:57,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:46:57,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2025-03-14 01:46:57,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-14 01:46:57,233 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:46:57,237 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-14 01:46:57,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-14 01:46:57,239 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:46:57,243 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-14 01:46:57,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 1 [2025-03-14 01:46:57,246 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:46:57,251 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-14 01:46:57,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-14 01:46:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-14 01:46:57,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422152418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:46:57,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:46:57,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-03-14 01:46:57,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481677778] [2025-03-14 01:46:57,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:46:57,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-14 01:46:57,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:46:57,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-14 01:46:57,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-14 01:47:00,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 507 [2025-03-14 01:47:00,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 576 transitions, 2843 flow. Second operand has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:00,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:00,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 507 [2025-03-14 01:47:00,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:07,754 INFO L124 PetriNetUnfolderBase]: 7135/31384 cut-off events. [2025-03-14 01:47:07,754 INFO L125 PetriNetUnfolderBase]: For 74721/76670 co-relation queries the response was YES. [2025-03-14 01:47:07,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74758 conditions, 31384 events. 7135/31384 cut-off events. For 74721/76670 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 385263 event pairs, 1059 based on Foata normal form. 887/29863 useless extension candidates. Maximal degree in co-relation 74681. Up to 3495 conditions per place. [2025-03-14 01:47:08,074 INFO L140 encePairwiseOnDemand]: 475/507 looper letters, 172 selfloop transitions, 78 changer transitions 0/679 dead transitions. [2025-03-14 01:47:08,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 679 transitions, 4152 flow [2025-03-14 01:47:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-14 01:47:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-14 01:47:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 10480 transitions. [2025-03-14 01:47:08,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8268244575936884 [2025-03-14 01:47:08,080 INFO L175 Difference]: Start difference. First operand has 481 places, 576 transitions, 2843 flow. Second operand 25 states and 10480 transitions. [2025-03-14 01:47:08,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 679 transitions, 4152 flow [2025-03-14 01:47:08,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 679 transitions, 4068 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-03-14 01:47:08,293 INFO L231 Difference]: Finished difference. Result has 505 places, 590 transitions, 3167 flow [2025-03-14 01:47:08,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=2755, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3167, PETRI_PLACES=505, PETRI_TRANSITIONS=590} [2025-03-14 01:47:08,294 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 56 predicate places. [2025-03-14 01:47:08,294 INFO L471 AbstractCegarLoop]: Abstraction has has 505 places, 590 transitions, 3167 flow [2025-03-14 01:47:08,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:08,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:08,297 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:08,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 01:47:08,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:47:08,497 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:47:08,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:08,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2139568541, now seen corresponding path program 2 times [2025-03-14 01:47:08,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:08,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134185818] [2025-03-14 01:47:08,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:47:08,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:08,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 349 statements into 2 equivalence classes. [2025-03-14 01:47:08,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 349 of 349 statements. [2025-03-14 01:47:08,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:47:08,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-14 01:47:09,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:09,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134185818] [2025-03-14 01:47:09,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134185818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:47:09,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831034578] [2025-03-14 01:47:09,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:47:09,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:47:09,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:47:09,576 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:47:09,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 01:47:09,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 349 statements into 2 equivalence classes. [2025-03-14 01:47:10,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 349 of 349 statements. [2025-03-14 01:47:10,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:47:10,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:10,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-14 01:47:10,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:47:10,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 01:47:10,538 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:47:10,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-14 01:47:10,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 71 [2025-03-14 01:47:10,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2025-03-14 01:47:10,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2025-03-14 01:47:10,825 INFO L349 Elim1Store]: treesize reduction 468, result has 0.2 percent of original size [2025-03-14 01:47:10,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 45 [2025-03-14 01:47:10,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-14 01:47:10,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2025-03-14 01:47:10,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2025-03-14 01:47:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-14 01:47:10,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:47:10,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:47:10,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 114 [2025-03-14 01:47:10,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-03-14 01:47:10,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:47:10,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 98 [2025-03-14 01:47:10,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-14 01:47:10,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:47:10,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2025-03-14 01:47:10,923 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:47:10,928 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-14 01:47:10,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-14 01:47:10,929 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:47:10,934 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-14 01:47:10,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2025-03-14 01:47:10,939 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:47:10,943 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-03-14 01:47:10,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 1 [2025-03-14 01:47:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-14 01:47:11,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831034578] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:47:11,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:47:11,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-03-14 01:47:11,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165519956] [2025-03-14 01:47:11,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:47:11,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-14 01:47:11,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:11,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-14 01:47:11,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-14 01:47:14,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 507 [2025-03-14 01:47:14,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 590 transitions, 3167 flow. Second operand has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:14,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:14,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 507 [2025-03-14 01:47:14,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:22,465 INFO L124 PetriNetUnfolderBase]: 7982/36084 cut-off events. [2025-03-14 01:47:22,465 INFO L125 PetriNetUnfolderBase]: For 124104/126866 co-relation queries the response was YES. [2025-03-14 01:47:22,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92436 conditions, 36084 events. 7982/36084 cut-off events. For 124104/126866 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 460712 event pairs, 941 based on Foata normal form. 1360/35097 useless extension candidates. Maximal degree in co-relation 92353. Up to 4262 conditions per place. [2025-03-14 01:47:22,853 INFO L140 encePairwiseOnDemand]: 476/507 looper letters, 123 selfloop transitions, 119 changer transitions 0/671 dead transitions. [2025-03-14 01:47:22,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 671 transitions, 4316 flow [2025-03-14 01:47:22,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-14 01:47:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-14 01:47:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 10898 transitions. [2025-03-14 01:47:22,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8267334243665605 [2025-03-14 01:47:22,860 INFO L175 Difference]: Start difference. First operand has 505 places, 590 transitions, 3167 flow. Second operand 26 states and 10898 transitions. [2025-03-14 01:47:22,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 671 transitions, 4316 flow [2025-03-14 01:47:23,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 671 transitions, 4253 flow, removed 1 selfloop flow, removed 19 redundant places. [2025-03-14 01:47:23,131 INFO L231 Difference]: Finished difference. Result has 515 places, 616 transitions, 3769 flow [2025-03-14 01:47:23,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=3104, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3769, PETRI_PLACES=515, PETRI_TRANSITIONS=616} [2025-03-14 01:47:23,131 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 66 predicate places. [2025-03-14 01:47:23,132 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 616 transitions, 3769 flow [2025-03-14 01:47:23,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:23,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:23,133 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:23,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-14 01:47:23,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-14 01:47:23,333 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:47:23,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1976407106, now seen corresponding path program 1 times [2025-03-14 01:47:23,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:23,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756257627] [2025-03-14 01:47:23,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:23,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:23,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-14 01:47:23,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-14 01:47:23,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:23,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:23,397 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-14 01:47:23,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:23,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756257627] [2025-03-14 01:47:23,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756257627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:47:23,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:47:23,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:47:23,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452200721] [2025-03-14 01:47:23,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:47:23,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:47:23,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:23,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:47:23,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:47:23,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-14 01:47:23,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 616 transitions, 3769 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:23,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:47:23,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-14 01:47:23,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:47:30,335 INFO L124 PetriNetUnfolderBase]: 6674/30865 cut-off events. [2025-03-14 01:47:30,335 INFO L125 PetriNetUnfolderBase]: For 113821/114579 co-relation queries the response was YES. [2025-03-14 01:47:30,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80018 conditions, 30865 events. 6674/30865 cut-off events. For 113821/114579 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 390427 event pairs, 2035 based on Foata normal form. 164/28795 useless extension candidates. Maximal degree in co-relation 79934. Up to 5603 conditions per place. [2025-03-14 01:47:30,801 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 60 selfloop transitions, 2 changer transitions 0/623 dead transitions. [2025-03-14 01:47:30,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 623 transitions, 3947 flow [2025-03-14 01:47:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:47:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:47:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-14 01:47:30,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-14 01:47:30,802 INFO L175 Difference]: Start difference. First operand has 515 places, 616 transitions, 3769 flow. Second operand 3 states and 1398 transitions. [2025-03-14 01:47:30,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 623 transitions, 3947 flow [2025-03-14 01:47:31,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 623 transitions, 3882 flow, removed 7 selfloop flow, removed 18 redundant places. [2025-03-14 01:47:31,009 INFO L231 Difference]: Finished difference. Result has 498 places, 615 transitions, 3706 flow [2025-03-14 01:47:31,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=3702, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3706, PETRI_PLACES=498, PETRI_TRANSITIONS=615} [2025-03-14 01:47:31,009 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 49 predicate places. [2025-03-14 01:47:31,010 INFO L471 AbstractCegarLoop]: Abstraction has has 498 places, 615 transitions, 3706 flow [2025-03-14 01:47:31,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:47:31,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:47:31,010 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:47:31,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-14 01:47:31,010 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-14 01:47:31,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:47:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1441002114, now seen corresponding path program 1 times [2025-03-14 01:47:31,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:47:31,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602476477] [2025-03-14 01:47:31,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:31,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:47:31,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-14 01:47:31,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-14 01:47:31,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:31,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-14 01:47:31,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:47:31,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602476477] [2025-03-14 01:47:31,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602476477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:47:31,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865945899] [2025-03-14 01:47:31,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:47:31,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:47:31,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:47:31,291 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:47:31,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:47:31,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-14 01:47:31,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-14 01:47:31,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:47:31,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:47:31,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-14 01:47:31,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:47:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 13 proven. 37 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-14 01:47:31,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:47:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 33 proven. 17 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-14 01:47:32,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865945899] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:47:32,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:47:32,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2025-03-14 01:47:32,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43732596] [2025-03-14 01:47:32,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:47:32,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-14 01:47:32,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:47:32,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-14 01:47:32,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870