./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:36:53,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:36:54,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:36:54,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:36:54,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:36:54,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:36:54,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:36:54,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:36:54,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:36:54,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:36:54,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:36:54,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:36:54,036 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:36:54,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:36:54,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:36:54,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:36:54,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:36:54,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:36:54,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:54,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:36:54,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:36:54,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:36:54,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:36:54,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:36:54,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:36:54,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:36:54,038 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2025-02-08 05:36:54,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:36:54,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:36:54,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:36:54,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:36:54,275 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:36:54,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-02-08 05:36:55,459 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb893a6e8/2ee27d7078434f84ae2fdf3b00453fb0/FLAG6a49cd28a [2025-02-08 05:36:55,674 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:36:55,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-02-08 05:36:55,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb893a6e8/2ee27d7078434f84ae2fdf3b00453fb0/FLAG6a49cd28a [2025-02-08 05:36:55,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb893a6e8/2ee27d7078434f84ae2fdf3b00453fb0 [2025-02-08 05:36:55,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:36:55,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:36:55,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:36:55,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:36:55,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:36:55,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:55" (1/1) ... [2025-02-08 05:36:55,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f6d6a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55, skipping insertion in model container [2025-02-08 05:36:55,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:36:55" (1/1) ... [2025-02-08 05:36:55,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:36:55,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:36:55,892 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:36:55,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:36:55,947 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:36:55,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55 WrapperNode [2025-02-08 05:36:55,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:36:55,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:36:55,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:36:55,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:36:55,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55" (1/1) ... [2025-02-08 05:36:55,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55" (1/1) ... [2025-02-08 05:36:55,994 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 11, calls inlined = 15, statements flattened = 316 [2025-02-08 05:36:55,999 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:36:55,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:36:55,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:36:55,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:36:56,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55" (1/1) ... [2025-02-08 05:36:56,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55" (1/1) ... [2025-02-08 05:36:56,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55" (1/1) ... [2025-02-08 05:36:56,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55" (1/1) ... [2025-02-08 05:36:56,038 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55" (1/1) ... [2025-02-08 05:36:56,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55" (1/1) ... [2025-02-08 05:36:56,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55" (1/1) ... [2025-02-08 05:36:56,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55" (1/1) ... [2025-02-08 05:36:56,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:36:56,054 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:36:56,057 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:36:56,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:36:56,059 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55" (1/1) ... [2025-02-08 05:36:56,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:36:56,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:36:56,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:36:56,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:36:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:36:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:36:56,111 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:36:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:36:56,112 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:36:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:36:56,112 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:36:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:36:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:36:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:36:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:36:56,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:36:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:36:56,114 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:36:56,205 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:36:56,206 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:36:56,790 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:36:56,791 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:36:56,809 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:36:56,809 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:36:56,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:56 BoogieIcfgContainer [2025-02-08 05:36:56,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:36:56,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:36:56,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:36:56,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:36:56,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:36:55" (1/3) ... [2025-02-08 05:36:56,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3039d769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:36:56, skipping insertion in model container [2025-02-08 05:36:56,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:36:55" (2/3) ... [2025-02-08 05:36:56,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3039d769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:36:56, skipping insertion in model container [2025-02-08 05:36:56,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:56" (3/3) ... [2025-02-08 05:36:56,818 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2025-02-08 05:36:56,828 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:36:56,830 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-trans.wvr.c that has 4 procedures, 593 locations, 1 initial locations, 6 loop locations, and 78 error locations. [2025-02-08 05:36:56,830 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:36:56,924 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:36:56,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 602 places, 622 transitions, 1265 flow [2025-02-08 05:36:57,137 INFO L124 PetriNetUnfolderBase]: 30/619 cut-off events. [2025-02-08 05:36:57,138 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:36:57,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 619 events. 30/619 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1470 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 368. Up to 3 conditions per place. [2025-02-08 05:36:57,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 602 places, 622 transitions, 1265 flow [2025-02-08 05:36:57,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 577 places, 594 transitions, 1206 flow [2025-02-08 05:36:57,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:36:57,175 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;@66603dc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:36:57,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 117 error locations. [2025-02-08 05:36:57,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:36:57,180 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:36:57,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:36:57,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:57,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:36:57,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:36:57,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:57,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2139533669, now seen corresponding path program 1 times [2025-02-08 05:36:57,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:57,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684144701] [2025-02-08 05:36:57,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:57,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:36:57,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:36:57,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:57,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:57,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:57,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684144701] [2025-02-08 05:36:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684144701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:57,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313850769] [2025-02-08 05:36:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:57,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:57,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:57,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:57,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:57,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2025-02-08 05:36:57,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 594 transitions, 1206 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:57,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2025-02-08 05:36:57,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:57,536 INFO L124 PetriNetUnfolderBase]: 30/787 cut-off events. [2025-02-08 05:36:57,536 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:36:57,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 787 events. 30/787 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2609 event pairs, 5 based on Foata normal form. 27/667 useless extension candidates. Maximal degree in co-relation 440. Up to 28 conditions per place. [2025-02-08 05:36:57,545 INFO L140 encePairwiseOnDemand]: 608/622 looper letters, 14 selfloop transitions, 2 changer transitions 8/582 dead transitions. [2025-02-08 05:36:57,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 582 transitions, 1214 flow [2025-02-08 05:36:57,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2025-02-08 05:36:57,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9651661307609861 [2025-02-08 05:36:57,559 INFO L175 Difference]: Start difference. First operand has 577 places, 594 transitions, 1206 flow. Second operand 3 states and 1801 transitions. [2025-02-08 05:36:57,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 582 transitions, 1214 flow [2025-02-08 05:36:57,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 582 transitions, 1202 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:36:57,577 INFO L231 Difference]: Finished difference. Result has 572 places, 574 transitions, 1158 flow [2025-02-08 05:36:57,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=572, PETRI_TRANSITIONS=574} [2025-02-08 05:36:57,588 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -5 predicate places. [2025-02-08 05:36:57,588 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 574 transitions, 1158 flow [2025-02-08 05:36:57,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:57,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:36:57,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:36:57,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:36:57,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:57,590 INFO L85 PathProgramCache]: Analyzing trace with hash -544877914, now seen corresponding path program 1 times [2025-02-08 05:36:57,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:57,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888380417] [2025-02-08 05:36:57,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:57,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:36:57,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:36:57,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:57,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:57,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:57,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888380417] [2025-02-08 05:36:57,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888380417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:57,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:57,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:57,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700596845] [2025-02-08 05:36:57,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:57,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:57,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:57,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:57,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:57,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2025-02-08 05:36:57,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 574 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:57,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2025-02-08 05:36:57,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:57,818 INFO L124 PetriNetUnfolderBase]: 38/919 cut-off events. [2025-02-08 05:36:57,819 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:36:57,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 919 events. 38/919 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3703 event pairs, 7 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 929. Up to 31 conditions per place. [2025-02-08 05:36:57,826 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 14 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2025-02-08 05:36:57,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 573 transitions, 1188 flow [2025-02-08 05:36:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1790 transitions. [2025-02-08 05:36:57,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9592711682743837 [2025-02-08 05:36:57,830 INFO L175 Difference]: Start difference. First operand has 572 places, 574 transitions, 1158 flow. Second operand 3 states and 1790 transitions. [2025-02-08 05:36:57,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 573 transitions, 1188 flow [2025-02-08 05:36:57,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 573 transitions, 1184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:36:57,837 INFO L231 Difference]: Finished difference. Result has 563 places, 573 transitions, 1156 flow [2025-02-08 05:36:57,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=563, PETRI_TRANSITIONS=573} [2025-02-08 05:36:57,838 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -14 predicate places. [2025-02-08 05:36:57,838 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 573 transitions, 1156 flow [2025-02-08 05:36:57,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:57,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:36:57,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:36:57,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:36:57,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:57,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1560571995, now seen corresponding path program 1 times [2025-02-08 05:36:57,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:57,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650417599] [2025-02-08 05:36:57,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:57,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:36:57,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:36:57,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:57,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:57,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650417599] [2025-02-08 05:36:57,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650417599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:57,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:57,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:57,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910832282] [2025-02-08 05:36:57,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:57,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:57,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:57,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:57,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:57,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2025-02-08 05:36:57,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 573 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:57,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2025-02-08 05:36:57,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:57,979 INFO L124 PetriNetUnfolderBase]: 26/652 cut-off events. [2025-02-08 05:36:57,979 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:36:57,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 652 events. 26/652 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1768 event pairs, 7 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 648. Up to 28 conditions per place. [2025-02-08 05:36:57,985 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 14 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2025-02-08 05:36:57,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 572 transitions, 1186 flow [2025-02-08 05:36:57,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1790 transitions. [2025-02-08 05:36:57,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9592711682743837 [2025-02-08 05:36:57,988 INFO L175 Difference]: Start difference. First operand has 563 places, 573 transitions, 1156 flow. Second operand 3 states and 1790 transitions. [2025-02-08 05:36:57,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 572 transitions, 1186 flow [2025-02-08 05:36:57,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 572 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:36:57,995 INFO L231 Difference]: Finished difference. Result has 562 places, 572 transitions, 1154 flow [2025-02-08 05:36:57,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=562, PETRI_TRANSITIONS=572} [2025-02-08 05:36:57,997 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -15 predicate places. [2025-02-08 05:36:57,997 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 572 transitions, 1154 flow [2025-02-08 05:36:57,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:57,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:57,998 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] [2025-02-08 05:36:57,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:36:57,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:36:57,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:57,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1751872471, now seen corresponding path program 1 times [2025-02-08 05:36:57,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:57,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180287939] [2025-02-08 05:36:57,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:57,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:58,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:36:58,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:36:58,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:58,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:58,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:58,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180287939] [2025-02-08 05:36:58,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180287939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:58,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:58,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:36:58,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621000401] [2025-02-08 05:36:58,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:58,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:36:58,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:58,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:36:58,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:36:58,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 622 [2025-02-08 05:36:58,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 572 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:58,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:58,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 622 [2025-02-08 05:36:58,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:36:58,216 INFO L124 PetriNetUnfolderBase]: 48/971 cut-off events. [2025-02-08 05:36:58,216 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:36:58,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 971 events. 48/971 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4120 event pairs, 12 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 982. Up to 48 conditions per place. [2025-02-08 05:36:58,228 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/567 dead transitions. [2025-02-08 05:36:58,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 567 transitions, 1178 flow [2025-02-08 05:36:58,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:36:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:36:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2025-02-08 05:36:58,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555198285101822 [2025-02-08 05:36:58,232 INFO L175 Difference]: Start difference. First operand has 562 places, 572 transitions, 1154 flow. Second operand 3 states and 1783 transitions. [2025-02-08 05:36:58,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 567 transitions, 1178 flow [2025-02-08 05:36:58,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 567 transitions, 1174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:36:58,241 INFO L231 Difference]: Finished difference. Result has 557 places, 567 transitions, 1142 flow [2025-02-08 05:36:58,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=557, PETRI_TRANSITIONS=567} [2025-02-08 05:36:58,242 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -20 predicate places. [2025-02-08 05:36:58,242 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 567 transitions, 1142 flow [2025-02-08 05:36:58,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:58,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:36:58,244 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] [2025-02-08 05:36:58,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:36:58,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:36:58,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:36:58,245 INFO L85 PathProgramCache]: Analyzing trace with hash 303978395, now seen corresponding path program 1 times [2025-02-08 05:36:58,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:36:58,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930615353] [2025-02-08 05:36:58,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:36:58,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:36:58,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 05:36:58,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 05:36:58,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:36:58,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:36:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:36:58,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:36:58,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930615353] [2025-02-08 05:36:58,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930615353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:36:58,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:36:58,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:36:58,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400419381] [2025-02-08 05:36:58,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:36:58,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:36:58,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:36:58,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:36:58,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:36:59,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 513 out of 622 [2025-02-08 05:36:59,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 567 transitions, 1142 flow. Second operand has 6 states, 6 states have (on average 514.5) internal successors, (3087), 6 states have internal predecessors, (3087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:36:59,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:36:59,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 513 of 622 [2025-02-08 05:36:59,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:00,643 INFO L124 PetriNetUnfolderBase]: 2257/12449 cut-off events. [2025-02-08 05:37:00,643 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-02-08 05:37:00,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15402 conditions, 12449 events. 2257/12449 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 144576 event pairs, 1520 based on Foata normal form. 0/9811 useless extension candidates. Maximal degree in co-relation 15353. Up to 2844 conditions per place. [2025-02-08 05:37:00,797 INFO L140 encePairwiseOnDemand]: 604/622 looper letters, 78 selfloop transitions, 15 changer transitions 0/564 dead transitions. [2025-02-08 05:37:00,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 564 transitions, 1322 flow [2025-02-08 05:37:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3174 transitions. [2025-02-08 05:37:00,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8504823151125402 [2025-02-08 05:37:00,803 INFO L175 Difference]: Start difference. First operand has 557 places, 567 transitions, 1142 flow. Second operand 6 states and 3174 transitions. [2025-02-08 05:37:00,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 564 transitions, 1322 flow [2025-02-08 05:37:00,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 564 transitions, 1321 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:00,814 INFO L231 Difference]: Finished difference. Result has 558 places, 564 transitions, 1165 flow [2025-02-08 05:37:00,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1165, PETRI_PLACES=558, PETRI_TRANSITIONS=564} [2025-02-08 05:37:00,817 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -19 predicate places. [2025-02-08 05:37:00,817 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 564 transitions, 1165 flow [2025-02-08 05:37:00,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 514.5) internal successors, (3087), 6 states have internal predecessors, (3087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:00,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:00,820 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] [2025-02-08 05:37:00,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:00,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:00,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:00,823 INFO L85 PathProgramCache]: Analyzing trace with hash -387823244, now seen corresponding path program 1 times [2025-02-08 05:37:00,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:00,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772622258] [2025-02-08 05:37:00,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:00,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:00,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 05:37:00,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 05:37:00,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:00,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:00,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:00,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772622258] [2025-02-08 05:37:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772622258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:00,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:00,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:00,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906878547] [2025-02-08 05:37:00,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:00,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:00,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:00,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:00,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:00,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 622 [2025-02-08 05:37:00,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 564 transitions, 1165 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:00,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:00,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 622 [2025-02-08 05:37:00,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:00,947 INFO L124 PetriNetUnfolderBase]: 27/710 cut-off events. [2025-02-08 05:37:00,947 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:00,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 710 events. 27/710 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2172 event pairs, 5 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 711. Up to 24 conditions per place. [2025-02-08 05:37:00,953 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2025-02-08 05:37:00,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 563 transitions, 1193 flow [2025-02-08 05:37:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2025-02-08 05:37:00,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603429796355841 [2025-02-08 05:37:00,956 INFO L175 Difference]: Start difference. First operand has 558 places, 564 transitions, 1165 flow. Second operand 3 states and 1792 transitions. [2025-02-08 05:37:00,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 563 transitions, 1193 flow [2025-02-08 05:37:00,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 563 transitions, 1163 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:00,962 INFO L231 Difference]: Finished difference. Result has 554 places, 563 transitions, 1137 flow [2025-02-08 05:37:00,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1137, PETRI_PLACES=554, PETRI_TRANSITIONS=563} [2025-02-08 05:37:00,965 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -23 predicate places. [2025-02-08 05:37:00,965 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 563 transitions, 1137 flow [2025-02-08 05:37:00,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:00,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:00,967 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] [2025-02-08 05:37:00,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:00,967 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:00,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:00,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1273721333, now seen corresponding path program 1 times [2025-02-08 05:37:00,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:00,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274747544] [2025-02-08 05:37:00,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:00,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:00,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:37:00,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:37:00,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:00,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:01,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:01,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274747544] [2025-02-08 05:37:01,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274747544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:01,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:01,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:01,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714939367] [2025-02-08 05:37:01,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:01,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:01,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:01,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:01,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:01,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 622 [2025-02-08 05:37:01,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 563 transitions, 1137 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:01,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 622 [2025-02-08 05:37:01,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:01,185 INFO L124 PetriNetUnfolderBase]: 74/1297 cut-off events. [2025-02-08 05:37:01,185 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:37:01,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 1297 events. 74/1297 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7166 event pairs, 20 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 1333. Up to 66 conditions per place. [2025-02-08 05:37:01,194 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/558 dead transitions. [2025-02-08 05:37:01,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 558 transitions, 1161 flow [2025-02-08 05:37:01,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2025-02-08 05:37:01,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555198285101822 [2025-02-08 05:37:01,197 INFO L175 Difference]: Start difference. First operand has 554 places, 563 transitions, 1137 flow. Second operand 3 states and 1783 transitions. [2025-02-08 05:37:01,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 558 transitions, 1161 flow [2025-02-08 05:37:01,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 558 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:01,203 INFO L231 Difference]: Finished difference. Result has 549 places, 558 transitions, 1125 flow [2025-02-08 05:37:01,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1125, PETRI_PLACES=549, PETRI_TRANSITIONS=558} [2025-02-08 05:37:01,205 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2025-02-08 05:37:01,205 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 558 transitions, 1125 flow [2025-02-08 05:37:01,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:01,206 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] [2025-02-08 05:37:01,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:01,206 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:01,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1016939635, now seen corresponding path program 1 times [2025-02-08 05:37:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:01,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165887767] [2025-02-08 05:37:01,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:01,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:01,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:37:01,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:37:01,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:01,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:01,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:01,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165887767] [2025-02-08 05:37:01,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165887767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:01,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:01,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177016643] [2025-02-08 05:37:01,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:01,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:01,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:01,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:01,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 622 [2025-02-08 05:37:01,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 558 transitions, 1125 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:01,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 622 [2025-02-08 05:37:01,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:01,349 INFO L124 PetriNetUnfolderBase]: 35/840 cut-off events. [2025-02-08 05:37:01,350 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:01,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 840 events. 35/840 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3075 event pairs, 7 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 830. Up to 27 conditions per place. [2025-02-08 05:37:01,358 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/557 dead transitions. [2025-02-08 05:37:01,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 557 transitions, 1153 flow [2025-02-08 05:37:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2025-02-08 05:37:01,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603429796355841 [2025-02-08 05:37:01,362 INFO L175 Difference]: Start difference. First operand has 549 places, 558 transitions, 1125 flow. Second operand 3 states and 1792 transitions. [2025-02-08 05:37:01,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 557 transitions, 1153 flow [2025-02-08 05:37:01,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 557 transitions, 1152 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:01,368 INFO L231 Difference]: Finished difference. Result has 549 places, 557 transitions, 1126 flow [2025-02-08 05:37:01,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=549, PETRI_TRANSITIONS=557} [2025-02-08 05:37:01,371 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2025-02-08 05:37:01,372 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 557 transitions, 1126 flow [2025-02-08 05:37:01,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:01,373 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] [2025-02-08 05:37:01,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:01,373 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:01,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1762975671, now seen corresponding path program 1 times [2025-02-08 05:37:01,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:01,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628471945] [2025-02-08 05:37:01,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:01,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:01,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:37:01,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:37:01,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:01,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:01,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:01,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628471945] [2025-02-08 05:37:01,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628471945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:01,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:01,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:01,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625561423] [2025-02-08 05:37:01,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:01,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:01,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:01,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:01,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:01,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 622 [2025-02-08 05:37:01,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 557 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:01,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 622 [2025-02-08 05:37:01,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:01,575 INFO L124 PetriNetUnfolderBase]: 70/1155 cut-off events. [2025-02-08 05:37:01,575 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 05:37:01,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 1155 events. 70/1155 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5648 event pairs, 20 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1185. Up to 67 conditions per place. [2025-02-08 05:37:01,585 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/552 dead transitions. [2025-02-08 05:37:01,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 552 transitions, 1150 flow [2025-02-08 05:37:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2025-02-08 05:37:01,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555198285101822 [2025-02-08 05:37:01,589 INFO L175 Difference]: Start difference. First operand has 549 places, 557 transitions, 1126 flow. Second operand 3 states and 1783 transitions. [2025-02-08 05:37:01,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 552 transitions, 1150 flow [2025-02-08 05:37:01,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 552 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:01,597 INFO L231 Difference]: Finished difference. Result has 544 places, 552 transitions, 1114 flow [2025-02-08 05:37:01,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=544, PETRI_TRANSITIONS=552} [2025-02-08 05:37:01,599 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2025-02-08 05:37:01,599 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 552 transitions, 1114 flow [2025-02-08 05:37:01,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:01,600 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-02-08 05:37:01,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:01,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:01,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash 461859251, now seen corresponding path program 1 times [2025-02-08 05:37:01,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:01,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970969083] [2025-02-08 05:37:01,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:01,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:01,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-08 05:37:01,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-08 05:37:01,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:01,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:01,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:01,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970969083] [2025-02-08 05:37:01,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970969083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:01,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:01,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:01,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296916586] [2025-02-08 05:37:01,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:01,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:01,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:01,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:01,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:01,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 622 [2025-02-08 05:37:01,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 552 transitions, 1114 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:01,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 622 [2025-02-08 05:37:01,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:01,765 INFO L124 PetriNetUnfolderBase]: 26/629 cut-off events. [2025-02-08 05:37:01,766 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:01,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 629 events. 26/629 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1683 event pairs, 7 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 617. Up to 27 conditions per place. [2025-02-08 05:37:01,771 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2025-02-08 05:37:01,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 551 transitions, 1142 flow [2025-02-08 05:37:01,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2025-02-08 05:37:01,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9603429796355841 [2025-02-08 05:37:01,776 INFO L175 Difference]: Start difference. First operand has 544 places, 552 transitions, 1114 flow. Second operand 3 states and 1792 transitions. [2025-02-08 05:37:01,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 551 transitions, 1142 flow [2025-02-08 05:37:01,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 551 transitions, 1141 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:01,783 INFO L231 Difference]: Finished difference. Result has 544 places, 551 transitions, 1115 flow [2025-02-08 05:37:01,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1115, PETRI_PLACES=544, PETRI_TRANSITIONS=551} [2025-02-08 05:37:01,785 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2025-02-08 05:37:01,785 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 551 transitions, 1115 flow [2025-02-08 05:37:01,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:01,786 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:01,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:01,787 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:01,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:01,788 INFO L85 PathProgramCache]: Analyzing trace with hash 992887366, now seen corresponding path program 1 times [2025-02-08 05:37:01,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:01,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009328338] [2025-02-08 05:37:01,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:01,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:01,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-08 05:37:01,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 05:37:01,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:01,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:01,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:01,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009328338] [2025-02-08 05:37:01,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009328338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:01,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:01,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:01,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038347151] [2025-02-08 05:37:01,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:01,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:01,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:01,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:01,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:01,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-02-08 05:37:01,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 551 transitions, 1115 flow. Second operand has 3 states, 3 states have (on average 576.0) internal successors, (1728), 3 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:01,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-02-08 05:37:01,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:01,959 INFO L124 PetriNetUnfolderBase]: 44/682 cut-off events. [2025-02-08 05:37:01,960 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:37:01,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 682 events. 44/682 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2095 event pairs, 2 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 737. Up to 63 conditions per place. [2025-02-08 05:37:01,965 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2025-02-08 05:37:01,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 544 transitions, 1157 flow [2025-02-08 05:37:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2025-02-08 05:37:01,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437299035369775 [2025-02-08 05:37:01,968 INFO L175 Difference]: Start difference. First operand has 544 places, 551 transitions, 1115 flow. Second operand 3 states and 1761 transitions. [2025-02-08 05:37:01,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 544 transitions, 1157 flow [2025-02-08 05:37:01,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 544 transitions, 1153 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:01,976 INFO L231 Difference]: Finished difference. Result has 535 places, 542 transitions, 1097 flow [2025-02-08 05:37:01,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1097, PETRI_PLACES=535, PETRI_TRANSITIONS=542} [2025-02-08 05:37:01,977 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -42 predicate places. [2025-02-08 05:37:01,977 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 542 transitions, 1097 flow [2025-02-08 05:37:01,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.0) internal successors, (1728), 3 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:01,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:01,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:01,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:01,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:01,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1876387331, now seen corresponding path program 1 times [2025-02-08 05:37:01,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:01,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335986320] [2025-02-08 05:37:01,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:01,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-08 05:37:01,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-08 05:37:01,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:01,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335986320] [2025-02-08 05:37:02,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335986320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142221496] [2025-02-08 05:37:02,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-02-08 05:37:02,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 542 transitions, 1097 flow. Second operand has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-02-08 05:37:02,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,147 INFO L124 PetriNetUnfolderBase]: 47/735 cut-off events. [2025-02-08 05:37:02,147 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 05:37:02,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 735 events. 47/735 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2569 event pairs, 18 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 779. Up to 62 conditions per place. [2025-02-08 05:37:02,156 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/535 dead transitions. [2025-02-08 05:37:02,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 535 transitions, 1139 flow [2025-02-08 05:37:02,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2025-02-08 05:37:02,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437299035369775 [2025-02-08 05:37:02,159 INFO L175 Difference]: Start difference. First operand has 535 places, 542 transitions, 1097 flow. Second operand 3 states and 1761 transitions. [2025-02-08 05:37:02,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 535 transitions, 1139 flow [2025-02-08 05:37:02,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 535 transitions, 1135 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,167 INFO L231 Difference]: Finished difference. Result has 526 places, 533 transitions, 1079 flow [2025-02-08 05:37:02,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1079, PETRI_PLACES=526, PETRI_TRANSITIONS=533} [2025-02-08 05:37:02,168 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -51 predicate places. [2025-02-08 05:37:02,168 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 533 transitions, 1079 flow [2025-02-08 05:37:02,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:02,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:02,169 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:02,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1547463887, now seen corresponding path program 1 times [2025-02-08 05:37:02,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59444425] [2025-02-08 05:37:02,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 05:37:02,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 05:37:02,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59444425] [2025-02-08 05:37:02,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59444425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:02,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924941990] [2025-02-08 05:37:02,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 622 [2025-02-08 05:37:02,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 533 transitions, 1079 flow. Second operand has 3 states, 3 states have (on average 596.6666666666666) internal successors, (1790), 3 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 622 [2025-02-08 05:37:02,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,319 INFO L124 PetriNetUnfolderBase]: 44/800 cut-off events. [2025-02-08 05:37:02,319 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:37:02,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 800 events. 44/800 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2867 event pairs, 12 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 831. Up to 39 conditions per place. [2025-02-08 05:37:02,326 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/536 dead transitions. [2025-02-08 05:37:02,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 536 transitions, 1121 flow [2025-02-08 05:37:02,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2025-02-08 05:37:02,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9662379421221865 [2025-02-08 05:37:02,329 INFO L175 Difference]: Start difference. First operand has 526 places, 533 transitions, 1079 flow. Second operand 3 states and 1803 transitions. [2025-02-08 05:37:02,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 536 transitions, 1121 flow [2025-02-08 05:37:02,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 536 transitions, 1117 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,339 INFO L231 Difference]: Finished difference. Result has 528 places, 534 transitions, 1093 flow [2025-02-08 05:37:02,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=528, PETRI_TRANSITIONS=534} [2025-02-08 05:37:02,340 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -49 predicate places. [2025-02-08 05:37:02,340 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 534 transitions, 1093 flow [2025-02-08 05:37:02,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 596.6666666666666) internal successors, (1790), 3 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:02,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:02,342 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:02,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,342 INFO L85 PathProgramCache]: Analyzing trace with hash 778974834, now seen corresponding path program 1 times [2025-02-08 05:37:02,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173183796] [2025-02-08 05:37:02,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 05:37:02,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 05:37:02,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173183796] [2025-02-08 05:37:02,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173183796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493404912] [2025-02-08 05:37:02,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-02-08 05:37:02,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 534 transitions, 1093 flow. Second operand has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-02-08 05:37:02,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,504 INFO L124 PetriNetUnfolderBase]: 44/665 cut-off events. [2025-02-08 05:37:02,504 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 05:37:02,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 665 events. 44/665 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2174 event pairs, 2 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 704. Up to 61 conditions per place. [2025-02-08 05:37:02,509 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 25 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2025-02-08 05:37:02,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 527 transitions, 1135 flow [2025-02-08 05:37:02,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2025-02-08 05:37:02,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437299035369775 [2025-02-08 05:37:02,513 INFO L175 Difference]: Start difference. First operand has 528 places, 534 transitions, 1093 flow. Second operand 3 states and 1761 transitions. [2025-02-08 05:37:02,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 527 transitions, 1135 flow [2025-02-08 05:37:02,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 527 transitions, 1129 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,520 INFO L231 Difference]: Finished difference. Result has 519 places, 525 transitions, 1073 flow [2025-02-08 05:37:02,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=519, PETRI_TRANSITIONS=525} [2025-02-08 05:37:02,522 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -58 predicate places. [2025-02-08 05:37:02,522 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 525 transitions, 1073 flow [2025-02-08 05:37:02,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,523 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] [2025-02-08 05:37:02,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:02,524 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:02,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash 531167819, now seen corresponding path program 1 times [2025-02-08 05:37:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752171600] [2025-02-08 05:37:02,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:37:02,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:37:02,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752171600] [2025-02-08 05:37:02,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752171600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561948543] [2025-02-08 05:37:02,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 622 [2025-02-08 05:37:02,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 525 transitions, 1073 flow. Second operand has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 622 [2025-02-08 05:37:02,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,719 INFO L124 PetriNetUnfolderBase]: 62/1077 cut-off events. [2025-02-08 05:37:02,719 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-08 05:37:02,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 1077 events. 62/1077 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4751 event pairs, 2 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1136. Up to 52 conditions per place. [2025-02-08 05:37:02,728 INFO L140 encePairwiseOnDemand]: 614/622 looper letters, 20 selfloop transitions, 4 changer transitions 0/530 dead transitions. [2025-02-08 05:37:02,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 530 transitions, 1136 flow [2025-02-08 05:37:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2025-02-08 05:37:02,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635584137191854 [2025-02-08 05:37:02,731 INFO L175 Difference]: Start difference. First operand has 519 places, 525 transitions, 1073 flow. Second operand 3 states and 1798 transitions. [2025-02-08 05:37:02,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 530 transitions, 1136 flow [2025-02-08 05:37:02,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 530 transitions, 1132 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:02,737 INFO L231 Difference]: Finished difference. Result has 516 places, 525 transitions, 1089 flow [2025-02-08 05:37:02,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1089, PETRI_PLACES=516, PETRI_TRANSITIONS=525} [2025-02-08 05:37:02,738 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -61 predicate places. [2025-02-08 05:37:02,738 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 525 transitions, 1089 flow [2025-02-08 05:37:02,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,739 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] [2025-02-08 05:37:02,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:02,740 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:02,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1869888366, now seen corresponding path program 1 times [2025-02-08 05:37:02,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039363701] [2025-02-08 05:37:02,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 05:37:02,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 05:37:02,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039363701] [2025-02-08 05:37:02,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039363701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:02,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62687255] [2025-02-08 05:37:02,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 622 [2025-02-08 05:37:02,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 525 transitions, 1089 flow. Second operand has 3 states, 3 states have (on average 597.0) internal successors, (1791), 3 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 622 [2025-02-08 05:37:02,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:02,883 INFO L124 PetriNetUnfolderBase]: 63/919 cut-off events. [2025-02-08 05:37:02,883 INFO L125 PetriNetUnfolderBase]: For 21/49 co-relation queries the response was YES. [2025-02-08 05:37:02,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 919 events. 63/919 cut-off events. For 21/49 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3833 event pairs, 18 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 987. Up to 57 conditions per place. [2025-02-08 05:37:02,892 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/528 dead transitions. [2025-02-08 05:37:02,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 528 transitions, 1131 flow [2025-02-08 05:37:02,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2025-02-08 05:37:02,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9662379421221865 [2025-02-08 05:37:02,895 INFO L175 Difference]: Start difference. First operand has 516 places, 525 transitions, 1089 flow. Second operand 3 states and 1803 transitions. [2025-02-08 05:37:02,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 528 transitions, 1131 flow [2025-02-08 05:37:02,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 528 transitions, 1131 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:02,900 INFO L231 Difference]: Finished difference. Result has 520 places, 526 transitions, 1107 flow [2025-02-08 05:37:02,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1107, PETRI_PLACES=520, PETRI_TRANSITIONS=526} [2025-02-08 05:37:02,901 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -57 predicate places. [2025-02-08 05:37:02,901 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 526 transitions, 1107 flow [2025-02-08 05:37:02,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.0) internal successors, (1791), 3 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:02,902 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] [2025-02-08 05:37:02,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:02,902 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:02,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1007194033, now seen corresponding path program 1 times [2025-02-08 05:37:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:02,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866984682] [2025-02-08 05:37:02,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:02,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:02,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 05:37:02,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 05:37:02,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:02,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:02,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:02,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866984682] [2025-02-08 05:37:02,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866984682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:02,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:02,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:02,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420496346] [2025-02-08 05:37:02,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:02,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:02,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:02,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:02,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:02,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 622 [2025-02-08 05:37:02,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 526 transitions, 1107 flow. Second operand has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:02,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:02,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 622 [2025-02-08 05:37:02,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:03,115 INFO L124 PetriNetUnfolderBase]: 107/1690 cut-off events. [2025-02-08 05:37:03,116 INFO L125 PetriNetUnfolderBase]: For 21/29 co-relation queries the response was YES. [2025-02-08 05:37:03,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 1690 events. 107/1690 cut-off events. For 21/29 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9693 event pairs, 8 based on Foata normal form. 1/1548 useless extension candidates. Maximal degree in co-relation 1868. Up to 76 conditions per place. [2025-02-08 05:37:03,133 INFO L140 encePairwiseOnDemand]: 614/622 looper letters, 20 selfloop transitions, 4 changer transitions 0/531 dead transitions. [2025-02-08 05:37:03,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 531 transitions, 1170 flow [2025-02-08 05:37:03,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:03,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2025-02-08 05:37:03,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635584137191854 [2025-02-08 05:37:03,136 INFO L175 Difference]: Start difference. First operand has 520 places, 526 transitions, 1107 flow. Second operand 3 states and 1798 transitions. [2025-02-08 05:37:03,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 531 transitions, 1170 flow [2025-02-08 05:37:03,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 531 transitions, 1164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:03,142 INFO L231 Difference]: Finished difference. Result has 517 places, 526 transitions, 1121 flow [2025-02-08 05:37:03,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1121, PETRI_PLACES=517, PETRI_TRANSITIONS=526} [2025-02-08 05:37:03,143 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -60 predicate places. [2025-02-08 05:37:03,143 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 526 transitions, 1121 flow [2025-02-08 05:37:03,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:03,145 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] [2025-02-08 05:37:03,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:03,145 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:03,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:03,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1309071663, now seen corresponding path program 1 times [2025-02-08 05:37:03,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:03,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018802928] [2025-02-08 05:37:03,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:03,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:03,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-08 05:37:03,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-08 05:37:03,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:03,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:03,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:03,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018802928] [2025-02-08 05:37:03,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018802928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:03,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:03,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:03,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889744149] [2025-02-08 05:37:03,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:03,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:03,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:03,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:03,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:03,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 622 [2025-02-08 05:37:03,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 526 transitions, 1121 flow. Second operand has 8 states, 8 states have (on average 568.125) internal successors, (4545), 8 states have internal predecessors, (4545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:03,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:03,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 622 [2025-02-08 05:37:03,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:04,422 INFO L124 PetriNetUnfolderBase]: 177/2658 cut-off events. [2025-02-08 05:37:04,422 INFO L125 PetriNetUnfolderBase]: For 17/48 co-relation queries the response was YES. [2025-02-08 05:37:04,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 2658 events. 177/2658 cut-off events. For 17/48 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 17462 event pairs, 14 based on Foata normal form. 5/2465 useless extension candidates. Maximal degree in co-relation 3150. Up to 115 conditions per place. [2025-02-08 05:37:04,436 INFO L140 encePairwiseOnDemand]: 605/622 looper letters, 79 selfloop transitions, 19 changer transitions 0/578 dead transitions. [2025-02-08 05:37:04,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 578 transitions, 1452 flow [2025-02-08 05:37:04,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:37:04,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:37:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6866 transitions. [2025-02-08 05:37:04,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.919882100750268 [2025-02-08 05:37:04,444 INFO L175 Difference]: Start difference. First operand has 517 places, 526 transitions, 1121 flow. Second operand 12 states and 6866 transitions. [2025-02-08 05:37:04,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 578 transitions, 1452 flow [2025-02-08 05:37:04,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 578 transitions, 1452 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:04,453 INFO L231 Difference]: Finished difference. Result has 533 places, 537 transitions, 1228 flow [2025-02-08 05:37:04,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1228, PETRI_PLACES=533, PETRI_TRANSITIONS=537} [2025-02-08 05:37:04,453 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -44 predicate places. [2025-02-08 05:37:04,453 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 537 transitions, 1228 flow [2025-02-08 05:37:04,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.125) internal successors, (4545), 8 states have internal predecessors, (4545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:04,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:04,454 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] [2025-02-08 05:37:04,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:04,455 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:04,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash 26884629, now seen corresponding path program 1 times [2025-02-08 05:37:04,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:04,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53879638] [2025-02-08 05:37:04,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:04,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:04,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-08 05:37:04,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-08 05:37:04,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:04,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:04,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:04,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53879638] [2025-02-08 05:37:04,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53879638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:04,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:04,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:04,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823755686] [2025-02-08 05:37:04,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:04,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:04,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:04,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:04,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:05,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 622 [2025-02-08 05:37:05,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 537 transitions, 1228 flow. Second operand has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:05,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:05,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 622 [2025-02-08 05:37:05,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:05,995 INFO L124 PetriNetUnfolderBase]: 396/5290 cut-off events. [2025-02-08 05:37:05,996 INFO L125 PetriNetUnfolderBase]: For 214/302 co-relation queries the response was YES. [2025-02-08 05:37:06,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6466 conditions, 5290 events. 396/5290 cut-off events. For 214/302 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 47328 event pairs, 62 based on Foata normal form. 14/4853 useless extension candidates. Maximal degree in co-relation 6400. Up to 201 conditions per place. [2025-02-08 05:37:06,028 INFO L140 encePairwiseOnDemand]: 605/622 looper letters, 74 selfloop transitions, 19 changer transitions 0/579 dead transitions. [2025-02-08 05:37:06,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 579 transitions, 1528 flow [2025-02-08 05:37:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:37:06,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:37:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6856 transitions. [2025-02-08 05:37:06,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9185423365487674 [2025-02-08 05:37:06,035 INFO L175 Difference]: Start difference. First operand has 533 places, 537 transitions, 1228 flow. Second operand 12 states and 6856 transitions. [2025-02-08 05:37:06,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 579 transitions, 1528 flow [2025-02-08 05:37:06,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 579 transitions, 1528 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:06,047 INFO L231 Difference]: Finished difference. Result has 549 places, 548 transitions, 1335 flow [2025-02-08 05:37:06,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1335, PETRI_PLACES=549, PETRI_TRANSITIONS=548} [2025-02-08 05:37:06,047 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2025-02-08 05:37:06,047 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 548 transitions, 1335 flow [2025-02-08 05:37:06,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:06,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:06,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:06,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:06,049 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:06,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:06,049 INFO L85 PathProgramCache]: Analyzing trace with hash -452030911, now seen corresponding path program 1 times [2025-02-08 05:37:06,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:06,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430357561] [2025-02-08 05:37:06,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:06,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:06,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-08 05:37:06,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-08 05:37:06,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:06,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:06,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:06,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430357561] [2025-02-08 05:37:06,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430357561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:06,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:06,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:06,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031054329] [2025-02-08 05:37:06,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:06,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:06,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:06,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:06,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:06,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 622 [2025-02-08 05:37:06,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 548 transitions, 1335 flow. Second operand has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:06,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:06,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 622 [2025-02-08 05:37:06,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:06,732 INFO L124 PetriNetUnfolderBase]: 618/5400 cut-off events. [2025-02-08 05:37:06,733 INFO L125 PetriNetUnfolderBase]: For 453/585 co-relation queries the response was YES. [2025-02-08 05:37:06,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6776 conditions, 5400 events. 618/5400 cut-off events. For 453/585 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 48622 event pairs, 209 based on Foata normal form. 0/4816 useless extension candidates. Maximal degree in co-relation 6702. Up to 631 conditions per place. [2025-02-08 05:37:06,758 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/551 dead transitions. [2025-02-08 05:37:06,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 551 transitions, 1377 flow [2025-02-08 05:37:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2025-02-08 05:37:06,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9662379421221865 [2025-02-08 05:37:06,761 INFO L175 Difference]: Start difference. First operand has 549 places, 548 transitions, 1335 flow. Second operand 3 states and 1803 transitions. [2025-02-08 05:37:06,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 551 transitions, 1377 flow [2025-02-08 05:37:06,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 551 transitions, 1377 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:06,767 INFO L231 Difference]: Finished difference. Result has 553 places, 549 transitions, 1353 flow [2025-02-08 05:37:06,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1353, PETRI_PLACES=553, PETRI_TRANSITIONS=549} [2025-02-08 05:37:06,768 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -24 predicate places. [2025-02-08 05:37:06,768 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 549 transitions, 1353 flow [2025-02-08 05:37:06,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:06,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:06,768 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:06,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:06,769 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:06,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:06,769 INFO L85 PathProgramCache]: Analyzing trace with hash -205573751, now seen corresponding path program 1 times [2025-02-08 05:37:06,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:06,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796408377] [2025-02-08 05:37:06,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:06,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-08 05:37:06,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-08 05:37:06,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:06,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:06,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:06,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796408377] [2025-02-08 05:37:06,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796408377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:06,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:06,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:06,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539522189] [2025-02-08 05:37:06,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:06,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:06,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:06,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:06,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:07,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 622 [2025-02-08 05:37:07,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 549 transitions, 1353 flow. Second operand has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:07,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:07,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 622 [2025-02-08 05:37:07,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:08,408 INFO L124 PetriNetUnfolderBase]: 663/7300 cut-off events. [2025-02-08 05:37:08,408 INFO L125 PetriNetUnfolderBase]: For 637/745 co-relation queries the response was YES. [2025-02-08 05:37:08,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9268 conditions, 7300 events. 663/7300 cut-off events. For 637/745 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 72595 event pairs, 135 based on Foata normal form. 9/6617 useless extension candidates. Maximal degree in co-relation 9189. Up to 372 conditions per place. [2025-02-08 05:37:08,471 INFO L140 encePairwiseOnDemand]: 605/622 looper letters, 86 selfloop transitions, 22 changer transitions 0/601 dead transitions. [2025-02-08 05:37:08,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 601 transitions, 1748 flow [2025-02-08 05:37:08,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 05:37:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 05:37:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7431 transitions. [2025-02-08 05:37:08,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918995795201583 [2025-02-08 05:37:08,482 INFO L175 Difference]: Start difference. First operand has 553 places, 549 transitions, 1353 flow. Second operand 13 states and 7431 transitions. [2025-02-08 05:37:08,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 601 transitions, 1748 flow [2025-02-08 05:37:08,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 601 transitions, 1732 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:08,493 INFO L231 Difference]: Finished difference. Result has 566 places, 556 transitions, 1439 flow [2025-02-08 05:37:08,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1439, PETRI_PLACES=566, PETRI_TRANSITIONS=556} [2025-02-08 05:37:08,494 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -11 predicate places. [2025-02-08 05:37:08,494 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 556 transitions, 1439 flow [2025-02-08 05:37:08,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:08,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:08,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:08,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:08,495 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:08,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2071831685, now seen corresponding path program 1 times [2025-02-08 05:37:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:08,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213349865] [2025-02-08 05:37:08,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:08,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:08,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 05:37:08,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 05:37:08,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:08,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:08,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:08,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213349865] [2025-02-08 05:37:08,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213349865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:08,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:08,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:08,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080733559] [2025-02-08 05:37:08,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:08,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:08,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:08,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:08,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:09,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 622 [2025-02-08 05:37:09,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 556 transitions, 1439 flow. Second operand has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:09,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:09,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 622 [2025-02-08 05:37:09,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:09,860 INFO L124 PetriNetUnfolderBase]: 288/5457 cut-off events. [2025-02-08 05:37:09,861 INFO L125 PetriNetUnfolderBase]: For 262/387 co-relation queries the response was YES. [2025-02-08 05:37:09,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6809 conditions, 5457 events. 288/5457 cut-off events. For 262/387 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 43864 event pairs, 37 based on Foata normal form. 13/5095 useless extension candidates. Maximal degree in co-relation 6722. Up to 193 conditions per place. [2025-02-08 05:37:09,897 INFO L140 encePairwiseOnDemand]: 605/622 looper letters, 79 selfloop transitions, 24 changer transitions 0/597 dead transitions. [2025-02-08 05:37:09,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 597 transitions, 1789 flow [2025-02-08 05:37:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:37:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:37:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6859 transitions. [2025-02-08 05:37:09,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9189442658092176 [2025-02-08 05:37:09,906 INFO L175 Difference]: Start difference. First operand has 566 places, 556 transitions, 1439 flow. Second operand 12 states and 6859 transitions. [2025-02-08 05:37:09,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 597 transitions, 1789 flow [2025-02-08 05:37:09,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 597 transitions, 1772 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:09,916 INFO L231 Difference]: Finished difference. Result has 574 places, 563 transitions, 1545 flow [2025-02-08 05:37:09,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1545, PETRI_PLACES=574, PETRI_TRANSITIONS=563} [2025-02-08 05:37:09,917 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -3 predicate places. [2025-02-08 05:37:09,917 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 563 transitions, 1545 flow [2025-02-08 05:37:09,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:09,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:09,918 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] [2025-02-08 05:37:09,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:37:09,918 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:09,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1640876465, now seen corresponding path program 1 times [2025-02-08 05:37:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:09,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767450194] [2025-02-08 05:37:09,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:09,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:09,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-08 05:37:09,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 05:37:09,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:09,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:10,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:10,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767450194] [2025-02-08 05:37:10,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767450194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:10,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:10,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032868649] [2025-02-08 05:37:10,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:10,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:10,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:10,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:10,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 622 [2025-02-08 05:37:10,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 563 transitions, 1545 flow. Second operand has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:10,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:10,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 622 [2025-02-08 05:37:10,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:11,807 INFO L124 PetriNetUnfolderBase]: 611/8988 cut-off events. [2025-02-08 05:37:11,808 INFO L125 PetriNetUnfolderBase]: For 811/985 co-relation queries the response was YES. [2025-02-08 05:37:11,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11486 conditions, 8988 events. 611/8988 cut-off events. For 811/985 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 89542 event pairs, 119 based on Foata normal form. 22/8299 useless extension candidates. Maximal degree in co-relation 11390. Up to 264 conditions per place. [2025-02-08 05:37:11,880 INFO L140 encePairwiseOnDemand]: 605/622 looper letters, 73 selfloop transitions, 27 changer transitions 0/601 dead transitions. [2025-02-08 05:37:11,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 601 transitions, 1884 flow [2025-02-08 05:37:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 05:37:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 05:37:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7416 transitions. [2025-02-08 05:37:11,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9171407370764284 [2025-02-08 05:37:11,884 INFO L175 Difference]: Start difference. First operand has 574 places, 563 transitions, 1545 flow. Second operand 13 states and 7416 transitions. [2025-02-08 05:37:11,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 601 transitions, 1884 flow [2025-02-08 05:37:11,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 601 transitions, 1867 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:11,894 INFO L231 Difference]: Finished difference. Result has 585 places, 575 transitions, 1676 flow [2025-02-08 05:37:11,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1676, PETRI_PLACES=585, PETRI_TRANSITIONS=575} [2025-02-08 05:37:11,895 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 8 predicate places. [2025-02-08 05:37:11,895 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 575 transitions, 1676 flow [2025-02-08 05:37:11,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:11,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:11,896 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] [2025-02-08 05:37:11,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:37:11,896 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:11,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1503548449, now seen corresponding path program 1 times [2025-02-08 05:37:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:11,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168394352] [2025-02-08 05:37:11,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:11,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-08 05:37:11,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-08 05:37:11,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:11,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:12,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168394352] [2025-02-08 05:37:12,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168394352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:12,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958758384] [2025-02-08 05:37:12,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:12,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:12,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:12,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 622 [2025-02-08 05:37:12,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 575 transitions, 1676 flow. Second operand has 8 states, 8 states have (on average 568.5) internal successors, (4548), 8 states have internal predecessors, (4548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:12,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:12,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 622 [2025-02-08 05:37:12,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:13,552 INFO L124 PetriNetUnfolderBase]: 659/8213 cut-off events. [2025-02-08 05:37:13,552 INFO L125 PetriNetUnfolderBase]: For 1123/1229 co-relation queries the response was YES. [2025-02-08 05:37:13,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10829 conditions, 8213 events. 659/8213 cut-off events. For 1123/1229 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 82201 event pairs, 147 based on Foata normal form. 11/7526 useless extension candidates. Maximal degree in co-relation 10722. Up to 389 conditions per place. [2025-02-08 05:37:13,628 INFO L140 encePairwiseOnDemand]: 605/622 looper letters, 73 selfloop transitions, 24 changer transitions 0/604 dead transitions. [2025-02-08 05:37:13,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 604 transitions, 1984 flow [2025-02-08 05:37:13,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:37:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:37:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6848 transitions. [2025-02-08 05:37:13,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.917470525187567 [2025-02-08 05:37:13,631 INFO L175 Difference]: Start difference. First operand has 585 places, 575 transitions, 1676 flow. Second operand 12 states and 6848 transitions. [2025-02-08 05:37:13,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 604 transitions, 1984 flow [2025-02-08 05:37:13,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 604 transitions, 1980 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:13,641 INFO L231 Difference]: Finished difference. Result has 598 places, 581 transitions, 1787 flow [2025-02-08 05:37:13,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1787, PETRI_PLACES=598, PETRI_TRANSITIONS=581} [2025-02-08 05:37:13,642 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 21 predicate places. [2025-02-08 05:37:13,642 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 581 transitions, 1787 flow [2025-02-08 05:37:13,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.5) internal successors, (4548), 8 states have internal predecessors, (4548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:13,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:13,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] [2025-02-08 05:37:13,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:37:13,644 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:13,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:13,645 INFO L85 PathProgramCache]: Analyzing trace with hash 875652819, now seen corresponding path program 1 times [2025-02-08 05:37:13,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:13,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986903102] [2025-02-08 05:37:13,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:13,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:13,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-08 05:37:13,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-08 05:37:13,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:13,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:14,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:14,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986903102] [2025-02-08 05:37:14,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986903102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:14,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:14,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:14,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861701812] [2025-02-08 05:37:14,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:14,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:14,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:14,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:14,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:14,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-02-08 05:37:14,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 581 transitions, 1787 flow. Second operand has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:14,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:14,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-02-08 05:37:14,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,863 INFO L124 PetriNetUnfolderBase]: 307/8437 cut-off events. [2025-02-08 05:37:15,864 INFO L125 PetriNetUnfolderBase]: For 654/727 co-relation queries the response was YES. [2025-02-08 05:37:15,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10321 conditions, 8437 events. 307/8437 cut-off events. For 654/727 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 76543 event pairs, 16 based on Foata normal form. 20/7889 useless extension candidates. Maximal degree in co-relation 10207. Up to 177 conditions per place. [2025-02-08 05:37:15,903 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 38 selfloop transitions, 10 changer transitions 0/594 dead transitions. [2025-02-08 05:37:15,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 594 transitions, 1920 flow [2025-02-08 05:37:15,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2025-02-08 05:37:15,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937566988210075 [2025-02-08 05:37:15,905 INFO L175 Difference]: Start difference. First operand has 598 places, 581 transitions, 1787 flow. Second operand 6 states and 3499 transitions. [2025-02-08 05:37:15,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 594 transitions, 1920 flow [2025-02-08 05:37:15,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 594 transitions, 1901 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:37:15,915 INFO L231 Difference]: Finished difference. Result has 598 places, 583 transitions, 1816 flow [2025-02-08 05:37:15,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1816, PETRI_PLACES=598, PETRI_TRANSITIONS=583} [2025-02-08 05:37:15,916 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 21 predicate places. [2025-02-08 05:37:15,916 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 583 transitions, 1816 flow [2025-02-08 05:37:15,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:15,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:15,917 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] [2025-02-08 05:37:15,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:37:15,917 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:15,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1569714864, now seen corresponding path program 1 times [2025-02-08 05:37:15,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276524594] [2025-02-08 05:37:15,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-08 05:37:15,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-08 05:37:15,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:16,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276524594] [2025-02-08 05:37:16,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276524594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:16,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:16,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735562263] [2025-02-08 05:37:16,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:16,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:16,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:16,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:16,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-02-08 05:37:16,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 583 transitions, 1816 flow. Second operand has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:16,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:16,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-02-08 05:37:16,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:18,247 INFO L124 PetriNetUnfolderBase]: 407/10840 cut-off events. [2025-02-08 05:37:18,247 INFO L125 PetriNetUnfolderBase]: For 723/958 co-relation queries the response was YES. [2025-02-08 05:37:18,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13244 conditions, 10840 events. 407/10840 cut-off events. For 723/958 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 106944 event pairs, 18 based on Foata normal form. 35/10181 useless extension candidates. Maximal degree in co-relation 13127. Up to 294 conditions per place. [2025-02-08 05:37:18,360 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 37 selfloop transitions, 10 changer transitions 0/595 dead transitions. [2025-02-08 05:37:18,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 595 transitions, 1944 flow [2025-02-08 05:37:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3498 transitions. [2025-02-08 05:37:18,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9372990353697749 [2025-02-08 05:37:18,362 INFO L175 Difference]: Start difference. First operand has 598 places, 583 transitions, 1816 flow. Second operand 6 states and 3498 transitions. [2025-02-08 05:37:18,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 595 transitions, 1944 flow [2025-02-08 05:37:18,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 595 transitions, 1940 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:18,373 INFO L231 Difference]: Finished difference. Result has 604 places, 585 transitions, 1860 flow [2025-02-08 05:37:18,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1860, PETRI_PLACES=604, PETRI_TRANSITIONS=585} [2025-02-08 05:37:18,373 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 27 predicate places. [2025-02-08 05:37:18,374 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 585 transitions, 1860 flow [2025-02-08 05:37:18,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:18,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:18,375 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-02-08 05:37:18,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:37:18,375 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:18,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:18,376 INFO L85 PathProgramCache]: Analyzing trace with hash -962421423, now seen corresponding path program 1 times [2025-02-08 05:37:18,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:18,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291229569] [2025-02-08 05:37:18,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 05:37:18,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 05:37:18,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:18,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291229569] [2025-02-08 05:37:18,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291229569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:18,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:18,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:18,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708747287] [2025-02-08 05:37:18,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:18,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:18,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:18,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 622 [2025-02-08 05:37:18,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 585 transitions, 1860 flow. Second operand has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:18,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:18,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 622 [2025-02-08 05:37:18,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:20,933 INFO L124 PetriNetUnfolderBase]: 863/16330 cut-off events. [2025-02-08 05:37:20,933 INFO L125 PetriNetUnfolderBase]: For 1342/1363 co-relation queries the response was YES. [2025-02-08 05:37:21,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20836 conditions, 16330 events. 863/16330 cut-off events. For 1342/1363 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 183138 event pairs, 169 based on Foata normal form. 0/15345 useless extension candidates. Maximal degree in co-relation 20717. Up to 946 conditions per place. [2025-02-08 05:37:21,052 INFO L140 encePairwiseOnDemand]: 614/622 looper letters, 19 selfloop transitions, 4 changer transitions 0/589 dead transitions. [2025-02-08 05:37:21,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 589 transitions, 1918 flow [2025-02-08 05:37:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1797 transitions. [2025-02-08 05:37:21,053 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9630225080385852 [2025-02-08 05:37:21,053 INFO L175 Difference]: Start difference. First operand has 604 places, 585 transitions, 1860 flow. Second operand 3 states and 1797 transitions. [2025-02-08 05:37:21,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 589 transitions, 1918 flow [2025-02-08 05:37:21,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 589 transitions, 1914 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:21,071 INFO L231 Difference]: Finished difference. Result has 602 places, 585 transitions, 1876 flow [2025-02-08 05:37:21,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1876, PETRI_PLACES=602, PETRI_TRANSITIONS=585} [2025-02-08 05:37:21,073 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 25 predicate places. [2025-02-08 05:37:21,073 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 585 transitions, 1876 flow [2025-02-08 05:37:21,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:21,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,074 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] [2025-02-08 05:37:21,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:37:21,074 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:21,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,076 INFO L85 PathProgramCache]: Analyzing trace with hash 266376728, now seen corresponding path program 1 times [2025-02-08 05:37:21,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767478743] [2025-02-08 05:37:21,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-08 05:37:21,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-08 05:37:21,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:21,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767478743] [2025-02-08 05:37:21,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767478743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:21,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127678332] [2025-02-08 05:37:21,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:21,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:21,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:21,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-02-08 05:37:21,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 585 transitions, 1876 flow. Second operand has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:21,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-02-08 05:37:21,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:24,217 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1445] thread3EXIT-->L99-41: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][554], [Black: 646#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork1_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 781#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 787#(and (not |thread2Thread1of1ForFork1_#t~short6|) (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 770#(= ~i_BC~0 0), Black: 661#true, Black: 774#(and (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 768#true, 654#(= |#race~A~0| 0), Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 667#(= ~i_AB~0 0), Black: 801#(and (= ~i_AC~0 0) (<= ~Cn~0 0)), Black: 684#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), Black: 814#(and (= ~i_AC~0 0) (<= ~Cn~0 0) (not |thread3Thread1of1ForFork0_#t~short11|)), 227#L99-41true, Black: 818#true, 616#(= |#race~An~0| 0), Black: 822#(and (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0)), Black: 820#(= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0), Black: 821#(and (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0)), Black: 830#(= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0), Black: 832#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset 1)) 0)), Black: 831#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset 1)) 0)), Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 722#(= ~i_AC~0 0), Black: 709#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork1_#t~short6|) (= ~i_BC~0 0)), Black: 692#(= ~i_BC~0 0), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), 628#(= |#race~Bn~0| 0), Black: 838#true, Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 665#true, Black: 717#(not |thread3Thread1of1ForFork0_#t~short11|), 797#(= ~i_AC~0 0), 847#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) 3 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 1)) 0)), Black: 739#(and (= ~i_AC~0 0) (<= ~An~0 0) (not |thread3Thread1of1ForFork0_#t~short11|)), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 745#true, 828#true, Black: 764#(and (<= ~Bn~0 0) (not |thread1Thread1of1ForFork2_#t~short1|) (= ~i_AB~0 0)), 663#(= |#race~B~0| 0), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0)), Black: 747#(= ~i_AB~0 0)]) [2025-02-08 05:37:24,218 INFO L294 olderBase$Statistics]: this new event has 436 ancestors and is cut-off event [2025-02-08 05:37:24,218 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-02-08 05:37:24,218 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-02-08 05:37:24,218 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2025-02-08 05:37:24,323 INFO L124 PetriNetUnfolderBase]: 446/11911 cut-off events. [2025-02-08 05:37:24,323 INFO L125 PetriNetUnfolderBase]: For 859/1036 co-relation queries the response was YES. [2025-02-08 05:37:24,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15286 conditions, 11911 events. 446/11911 cut-off events. For 859/1036 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 120134 event pairs, 25 based on Foata normal form. 64/11418 useless extension candidates. Maximal degree in co-relation 15164. Up to 273 conditions per place. [2025-02-08 05:37:24,483 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 38 selfloop transitions, 10 changer transitions 0/598 dead transitions. [2025-02-08 05:37:24,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 598 transitions, 2009 flow [2025-02-08 05:37:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2025-02-08 05:37:24,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937566988210075 [2025-02-08 05:37:24,485 INFO L175 Difference]: Start difference. First operand has 602 places, 585 transitions, 1876 flow. Second operand 6 states and 3499 transitions. [2025-02-08 05:37:24,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 598 transitions, 2009 flow [2025-02-08 05:37:24,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 598 transitions, 2009 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:24,499 INFO L231 Difference]: Finished difference. Result has 609 places, 587 transitions, 1924 flow [2025-02-08 05:37:24,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1872, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1924, PETRI_PLACES=609, PETRI_TRANSITIONS=587} [2025-02-08 05:37:24,500 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 32 predicate places. [2025-02-08 05:37:24,500 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 587 transitions, 1924 flow [2025-02-08 05:37:24,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:24,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:24,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:24,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:37:24,501 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:24,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2127261544, now seen corresponding path program 1 times [2025-02-08 05:37:24,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:24,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143157459] [2025-02-08 05:37:24,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:24,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:24,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:37:24,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:37:24,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:24,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:24,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:24,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143157459] [2025-02-08 05:37:24,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143157459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:24,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:24,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:24,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248913850] [2025-02-08 05:37:24,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:24,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:24,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:24,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:24,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:25,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-02-08 05:37:25,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 587 transitions, 1924 flow. Second operand has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:25,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:25,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-02-08 05:37:25,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,080 INFO L124 PetriNetUnfolderBase]: 936/17156 cut-off events. [2025-02-08 05:37:28,080 INFO L125 PetriNetUnfolderBase]: For 1488/1543 co-relation queries the response was YES. [2025-02-08 05:37:28,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22790 conditions, 17156 events. 936/17156 cut-off events. For 1488/1543 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 197898 event pairs, 75 based on Foata normal form. 4/16363 useless extension candidates. Maximal degree in co-relation 22664. Up to 660 conditions per place. [2025-02-08 05:37:28,258 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 36 selfloop transitions, 10 changer transitions 0/598 dead transitions. [2025-02-08 05:37:28,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 598 transitions, 2047 flow [2025-02-08 05:37:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3497 transitions. [2025-02-08 05:37:28,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9370310825294748 [2025-02-08 05:37:28,260 INFO L175 Difference]: Start difference. First operand has 609 places, 587 transitions, 1924 flow. Second operand 6 states and 3497 transitions. [2025-02-08 05:37:28,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 598 transitions, 2047 flow [2025-02-08 05:37:28,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 598 transitions, 2043 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:28,277 INFO L231 Difference]: Finished difference. Result has 615 places, 589 transitions, 1968 flow [2025-02-08 05:37:28,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1968, PETRI_PLACES=615, PETRI_TRANSITIONS=589} [2025-02-08 05:37:28,277 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 38 predicate places. [2025-02-08 05:37:28,278 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 589 transitions, 1968 flow [2025-02-08 05:37:28,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,278 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] [2025-02-08 05:37:28,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:37:28,279 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:28,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2086060491, now seen corresponding path program 1 times [2025-02-08 05:37:28,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032185581] [2025-02-08 05:37:28,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-08 05:37:28,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-08 05:37:28,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:28,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032185581] [2025-02-08 05:37:28,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032185581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:28,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323349695] [2025-02-08 05:37:28,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:28,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:28,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:29,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-02-08 05:37:29,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 589 transitions, 1968 flow. Second operand has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:29,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:29,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-02-08 05:37:29,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:31,908 INFO L124 PetriNetUnfolderBase]: 613/15272 cut-off events. [2025-02-08 05:37:31,908 INFO L125 PetriNetUnfolderBase]: For 1263/1644 co-relation queries the response was YES. [2025-02-08 05:37:32,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20836 conditions, 15272 events. 613/15272 cut-off events. For 1263/1644 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 163856 event pairs, 40 based on Foata normal form. 52/14784 useless extension candidates. Maximal degree in co-relation 20706. Up to 416 conditions per place. [2025-02-08 05:37:32,043 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 37 selfloop transitions, 10 changer transitions 0/601 dead transitions. [2025-02-08 05:37:32,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 601 transitions, 2096 flow [2025-02-08 05:37:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3498 transitions. [2025-02-08 05:37:32,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9372990353697749 [2025-02-08 05:37:32,045 INFO L175 Difference]: Start difference. First operand has 615 places, 589 transitions, 1968 flow. Second operand 6 states and 3498 transitions. [2025-02-08 05:37:32,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 601 transitions, 2096 flow [2025-02-08 05:37:32,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 601 transitions, 2092 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:32,065 INFO L231 Difference]: Finished difference. Result has 621 places, 591 transitions, 2012 flow [2025-02-08 05:37:32,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1960, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2012, PETRI_PLACES=621, PETRI_TRANSITIONS=591} [2025-02-08 05:37:32,066 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 44 predicate places. [2025-02-08 05:37:32,066 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 591 transitions, 2012 flow [2025-02-08 05:37:32,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:32,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:32,067 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] [2025-02-08 05:37:32,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:37:32,067 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:32,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash -548784704, now seen corresponding path program 1 times [2025-02-08 05:37:32,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:32,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545525017] [2025-02-08 05:37:32,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:32,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:32,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-08 05:37:32,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-08 05:37:32,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:32,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:32,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:32,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545525017] [2025-02-08 05:37:32,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545525017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:32,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:32,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119864450] [2025-02-08 05:37:32,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:32,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:32,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:32,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:32,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2025-02-08 05:37:32,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 591 transitions, 2012 flow. Second operand has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:32,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:32,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2025-02-08 05:37:32,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:35,256 INFO L124 PetriNetUnfolderBase]: 570/15087 cut-off events. [2025-02-08 05:37:35,257 INFO L125 PetriNetUnfolderBase]: For 1320/1733 co-relation queries the response was YES. [2025-02-08 05:37:35,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21315 conditions, 15087 events. 570/15087 cut-off events. For 1320/1733 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 158900 event pairs, 101 based on Foata normal form. 7/14601 useless extension candidates. Maximal degree in co-relation 21183. Up to 712 conditions per place. [2025-02-08 05:37:35,469 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 19 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2025-02-08 05:37:35,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 592 transitions, 2058 flow [2025-02-08 05:37:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1789 transitions. [2025-02-08 05:37:35,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587352625937835 [2025-02-08 05:37:35,471 INFO L175 Difference]: Start difference. First operand has 621 places, 591 transitions, 2012 flow. Second operand 3 states and 1789 transitions. [2025-02-08 05:37:35,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 592 transitions, 2058 flow [2025-02-08 05:37:35,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 592 transitions, 2054 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:35,496 INFO L231 Difference]: Finished difference. Result has 621 places, 590 transitions, 2010 flow [2025-02-08 05:37:35,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=2006, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2010, PETRI_PLACES=621, PETRI_TRANSITIONS=590} [2025-02-08 05:37:35,497 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 44 predicate places. [2025-02-08 05:37:35,497 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 590 transitions, 2010 flow [2025-02-08 05:37:35,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:35,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,497 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] [2025-02-08 05:37:35,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:37:35,497 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:35,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1483138003, now seen corresponding path program 1 times [2025-02-08 05:37:35,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005507227] [2025-02-08 05:37:35,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-08 05:37:35,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-08 05:37:35,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:35,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:35,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005507227] [2025-02-08 05:37:35,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005507227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:35,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351116499] [2025-02-08 05:37:35,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:35,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:35,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:36,251 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 622 [2025-02-08 05:37:36,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 590 transitions, 2010 flow. Second operand has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:36,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 622 [2025-02-08 05:37:36,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:39,167 INFO L124 PetriNetUnfolderBase]: 939/17051 cut-off events. [2025-02-08 05:37:39,167 INFO L125 PetriNetUnfolderBase]: For 1874/1932 co-relation queries the response was YES. [2025-02-08 05:37:39,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24197 conditions, 17051 events. 939/17051 cut-off events. For 1874/1932 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 195686 event pairs, 61 based on Foata normal form. 76/16474 useless extension candidates. Maximal degree in co-relation 24062. Up to 606 conditions per place. [2025-02-08 05:37:39,371 INFO L140 encePairwiseOnDemand]: 611/622 looper letters, 29 selfloop transitions, 6 changer transitions 173/601 dead transitions. [2025-02-08 05:37:39,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 601 transitions, 2131 flow [2025-02-08 05:37:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3496 transitions. [2025-02-08 05:37:39,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9367631296891747 [2025-02-08 05:37:39,374 INFO L175 Difference]: Start difference. First operand has 621 places, 590 transitions, 2010 flow. Second operand 6 states and 3496 transitions. [2025-02-08 05:37:39,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 601 transitions, 2131 flow [2025-02-08 05:37:39,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 601 transitions, 2127 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:39,407 INFO L231 Difference]: Finished difference. Result has 622 places, 420 transitions, 1411 flow [2025-02-08 05:37:39,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=2002, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1411, PETRI_PLACES=622, PETRI_TRANSITIONS=420} [2025-02-08 05:37:39,407 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, 45 predicate places. [2025-02-08 05:37:39,408 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 420 transitions, 1411 flow [2025-02-08 05:37:39,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:39,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:39,408 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] [2025-02-08 05:37:39,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:37:39,408 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:39,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:39,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1740593021, now seen corresponding path program 1 times [2025-02-08 05:37:39,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:39,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454871364] [2025-02-08 05:37:39,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:39,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:39,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-08 05:37:39,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-08 05:37:39,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:39,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:39,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:39,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454871364] [2025-02-08 05:37:39,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454871364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:39,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:39,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:39,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123276090] [2025-02-08 05:37:39,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:39,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:39,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:39,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:39,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:39,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2025-02-08 05:37:39,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 420 transitions, 1411 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:39,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:39,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2025-02-08 05:37:39,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:40,396 INFO L124 PetriNetUnfolderBase]: 407/4947 cut-off events. [2025-02-08 05:37:40,396 INFO L125 PetriNetUnfolderBase]: For 1417/1429 co-relation queries the response was YES. [2025-02-08 05:37:40,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8375 conditions, 4947 events. 407/4947 cut-off events. For 1417/1429 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 38451 event pairs, 208 based on Foata normal form. 0/4694 useless extension candidates. Maximal degree in co-relation 8242. Up to 520 conditions per place. [2025-02-08 05:37:40,509 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 14 selfloop transitions, 2 changer transitions 10/421 dead transitions. [2025-02-08 05:37:40,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 421 transitions, 1447 flow [2025-02-08 05:37:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2025-02-08 05:37:40,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560557341907824 [2025-02-08 05:37:40,510 INFO L175 Difference]: Start difference. First operand has 622 places, 420 transitions, 1411 flow. Second operand 3 states and 1784 transitions. [2025-02-08 05:37:40,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 421 transitions, 1447 flow [2025-02-08 05:37:40,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 421 transitions, 1297 flow, removed 5 selfloop flow, removed 56 redundant places. [2025-02-08 05:37:40,526 INFO L231 Difference]: Finished difference. Result has 442 places, 409 transitions, 1191 flow [2025-02-08 05:37:40,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=442, PETRI_TRANSITIONS=409} [2025-02-08 05:37:40,526 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -135 predicate places. [2025-02-08 05:37:40,527 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 409 transitions, 1191 flow [2025-02-08 05:37:40,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:40,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:40,528 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] [2025-02-08 05:37:40,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:37:40,529 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2025-02-08 05:37:40,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:40,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1807591083, now seen corresponding path program 1 times [2025-02-08 05:37:40,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:40,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131429675] [2025-02-08 05:37:40,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:40,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:40,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-08 05:37:40,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-08 05:37:40,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:40,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:40,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131429675] [2025-02-08 05:37:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131429675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:40,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:40,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:40,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120741258] [2025-02-08 05:37:40,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:40,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:40,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:40,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:40,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2025-02-08 05:37:40,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 409 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:40,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:40,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2025-02-08 05:37:40,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:41,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1446] thread2EXIT-->L97: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork1_#t~short6|) (= ~i_BC~0 0)), Black: 692#(= ~i_BC~0 0), Black: 646#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 838#true, 628#(= |#race~Bn~0| 0), Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 275#L71-21true, Black: 717#(not |thread3Thread1of1ForFork0_#t~short11|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork1_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 661#true, Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 720#true, 768#true, 654#(= |#race~A~0| 0), 884#true, Black: 739#(and (= ~i_AC~0 0) (<= ~An~0 0) (not |thread3Thread1of1ForFork0_#t~short11|)), Black: 722#(= ~i_AC~0 0), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 522#L97true, 747#(= ~i_AB~0 0), Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 684#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), 667#(= ~i_AB~0 0), 881#true, 616#(= |#race~An~0| 0), Black: 764#(and (<= ~Bn~0 0) (not |thread1Thread1of1ForFork2_#t~short1|) (= ~i_AB~0 0)), 663#(= |#race~B~0| 0), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0))]) [2025-02-08 05:37:41,119 INFO L294 olderBase$Statistics]: this new event has 441 ancestors and is cut-off event [2025-02-08 05:37:41,119 INFO L297 olderBase$Statistics]: existing Event has 368 ancestors and is cut-off event [2025-02-08 05:37:41,119 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-02-08 05:37:41,119 INFO L297 olderBase$Statistics]: existing Event has 396 ancestors and is cut-off event [2025-02-08 05:37:41,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1409] L71-15-->L71-12: Formula: (= |v_#race~C~0_6| 0) InVars {} OutVars{#race~C~0=|v_#race~C~0_6|} AuxVars[] AssignedVars[#race~C~0][360], [361#L71-12true, Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork1_#t~short6|) (= ~i_BC~0 0)), Black: 692#(= ~i_BC~0 0), Black: 646#(not |thread1Thread1of1ForFork2_#t~short1|), 243#L96true, Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 838#true, 628#(= |#race~Bn~0| 0), Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 717#(not |thread3Thread1of1ForFork0_#t~short11|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork1_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 661#true, Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 720#true, 768#true, 884#true, 654#(= |#race~A~0| 0), Black: 739#(and (= ~i_AC~0 0) (<= ~An~0 0) (not |thread3Thread1of1ForFork0_#t~short11|)), Black: 722#(= ~i_AC~0 0), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 747#(= ~i_AB~0 0), 542#L60-12true, Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 684#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), 667#(= ~i_AB~0 0), 881#true, 616#(= |#race~An~0| 0), Black: 764#(and (<= ~Bn~0 0) (not |thread1Thread1of1ForFork2_#t~short1|) (= ~i_AB~0 0)), 663#(= |#race~B~0| 0), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0))]) [2025-02-08 05:37:41,127 INFO L294 olderBase$Statistics]: this new event has 434 ancestors and is cut-off event [2025-02-08 05:37:41,127 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-02-08 05:37:41,127 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2025-02-08 05:37:41,127 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-02-08 05:37:41,140 INFO L124 PetriNetUnfolderBase]: 489/4087 cut-off events. [2025-02-08 05:37:41,140 INFO L125 PetriNetUnfolderBase]: For 712/740 co-relation queries the response was YES. [2025-02-08 05:37:41,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5913 conditions, 4087 events. 489/4087 cut-off events. For 712/740 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 32398 event pairs, 216 based on Foata normal form. 0/3853 useless extension candidates. Maximal degree in co-relation 5813. Up to 517 conditions per place. [2025-02-08 05:37:41,190 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 0 selfloop transitions, 0 changer transitions 410/410 dead transitions. [2025-02-08 05:37:41,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 410 transitions, 1227 flow [2025-02-08 05:37:41,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2025-02-08 05:37:41,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560557341907824 [2025-02-08 05:37:41,192 INFO L175 Difference]: Start difference. First operand has 442 places, 409 transitions, 1191 flow. Second operand 3 states and 1784 transitions. [2025-02-08 05:37:41,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 410 transitions, 1227 flow [2025-02-08 05:37:41,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 410 transitions, 1194 flow, removed 5 selfloop flow, removed 12 redundant places. [2025-02-08 05:37:41,198 INFO L231 Difference]: Finished difference. Result has 426 places, 0 transitions, 0 flow [2025-02-08 05:37:41,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=426, PETRI_TRANSITIONS=0} [2025-02-08 05:37:41,199 INFO L279 CegarLoopForPetriNet]: 577 programPoint places, -151 predicate places. [2025-02-08 05:37:41,199 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 0 transitions, 0 flow [2025-02-08 05:37:41,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:41,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (116 of 117 remaining) [2025-02-08 05:37:41,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (115 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (114 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (113 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (112 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (111 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (110 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (109 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (108 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (107 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (106 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (105 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (104 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (103 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (102 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (101 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (100 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (99 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (98 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (97 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (96 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (95 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (94 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (93 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (92 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (91 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (90 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (89 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (88 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (87 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (86 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (85 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (84 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (83 of 117 remaining) [2025-02-08 05:37:41,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (82 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (81 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (80 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (79 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (78 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (77 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (76 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (75 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (74 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (73 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (72 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (71 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (70 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (69 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (68 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (67 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (66 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (65 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (64 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (63 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (62 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (61 of 117 remaining) [2025-02-08 05:37:41,203 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (60 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (59 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (58 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (57 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (56 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (55 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (54 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (53 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (52 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (51 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (50 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (49 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (48 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (47 of 117 remaining) [2025-02-08 05:37:41,204 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (46 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (45 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (43 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (42 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (35 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (34 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (33 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (32 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (31 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (30 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (29 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 117 remaining) [2025-02-08 05:37:41,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (24 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (23 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (21 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (20 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (19 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (15 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (14 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 117 remaining) [2025-02-08 05:37:41,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 117 remaining) [2025-02-08 05:37:41,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 05:37:41,207 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:41,211 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:41,211 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:41,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:41 BasicIcfg [2025-02-08 05:37:41,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:41,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:41,216 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:41,216 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:41,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:36:56" (3/4) ... [2025-02-08 05:37:41,218 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:41,220 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:41,220 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:41,220 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:41,231 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-02-08 05:37:41,231 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:41,232 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:41,232 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:41,304 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:41,305 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:41,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:41,305 INFO L158 Benchmark]: Toolchain (without parser) took 45605.51ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 121.9MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 842.5MB. Max. memory is 16.1GB. [2025-02-08 05:37:41,306 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:41,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.47ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 108.1MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:37:41,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.42ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 105.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:41,307 INFO L158 Benchmark]: Boogie Preprocessor took 53.84ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 102.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:41,308 INFO L158 Benchmark]: IcfgBuilder took 756.39ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 57.4MB in the end (delta: 45.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 05:37:41,308 INFO L158 Benchmark]: TraceAbstraction took 44403.83ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 56.5MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2025-02-08 05:37:41,308 INFO L158 Benchmark]: Witness Printer took 88.73ms. Allocated memory is still 3.0GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:41,309 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.47ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 108.1MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.42ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 105.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.84ms. Allocated memory is still 167.8MB. Free memory was 105.5MB in the beginning and 102.5MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 756.39ms. Allocated memory is still 167.8MB. Free memory was 102.5MB in the beginning and 57.4MB in the end (delta: 45.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 44403.83ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 56.5MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 88.73ms. Allocated memory is still 3.0GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 788 locations, 117 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 44.3s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 39.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7105 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4471 mSDsluCounter, 4508 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3576 mSDsCounter, 1378 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12231 IncrementalHoareTripleChecker+Invalid, 13609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1378 mSolverCounterUnsat, 932 mSDtfsCounter, 12231 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2012occurred in iteration=30, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 5389 NumberOfCodeBlocks, 5389 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5355 ConstructedInterpolants, 0 QuantifiedInterpolants, 10193 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 78 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:41,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE