./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:08:05,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:08:05,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:08:05,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:08:05,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:08:05,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:08:05,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:08:05,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:08:05,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:08:05,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:08:05,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:08:05,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:08:05,082 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:08:05,082 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:08:05,082 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:08:05,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:08:05,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:08:05,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:08:05,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:08:05,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:08:05,082 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:08:05,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:08:05,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:08:05,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:08:05,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:08:05,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:08:05,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:08:05,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:08:05,084 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2025-03-08 22:08:05,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:08:05,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:08:05,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:08:05,350 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:08:05,350 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:08:05,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-08 22:08:06,551 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7914119d0/319f9e176697488aabe9bcc635413af2/FLAGb41bffc49 [2025-03-08 22:08:06,753 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:08:06,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-min.wvr.c [2025-03-08 22:08:06,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7914119d0/319f9e176697488aabe9bcc635413af2/FLAGb41bffc49 [2025-03-08 22:08:06,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7914119d0/319f9e176697488aabe9bcc635413af2 [2025-03-08 22:08:06,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:08:06,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:08:06,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:08:06,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:08:06,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:08:06,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:08:06" (1/1) ... [2025-03-08 22:08:06,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213a613e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:06, skipping insertion in model container [2025-03-08 22:08:06,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:08:06" (1/1) ... [2025-03-08 22:08:06,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:08:06,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:08:06,971 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:08:06,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:08:07,005 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:08:07,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:07 WrapperNode [2025-03-08 22:08:07,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:08:07,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:08:07,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:08:07,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:08:07,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:07" (1/1) ... [2025-03-08 22:08:07,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:07" (1/1) ... [2025-03-08 22:08:07,048 INFO L138 Inliner]: procedures = 25, calls = 43, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 338 [2025-03-08 22:08:07,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:08:07,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:08:07,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:08:07,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:08:07,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:07" (1/1) ... [2025-03-08 22:08:07,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:07" (1/1) ... [2025-03-08 22:08:07,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:07" (1/1) ... [2025-03-08 22:08:07,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:07" (1/1) ... [2025-03-08 22:08:07,072 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:07" (1/1) ... [2025-03-08 22:08:07,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:07" (1/1) ... [2025-03-08 22:08:07,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:07" (1/1) ... [2025-03-08 22:08:07,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:07" (1/1) ... [2025-03-08 22:08:07,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:08:07,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:08:07,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:08:07,079 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:08:07,080 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:07" (1/1) ... [2025-03-08 22:08:07,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:08:07,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:08:07,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:08:07,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:08:07,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:08:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:08:07,134 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:08:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:08:07,134 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:08:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:08:07,134 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:08:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:08:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:08:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-08 22:08:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-08 22:08:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:08:07,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:08:07,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:08:07,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:08:07,136 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:08:07,236 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:08:07,238 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:08:07,862 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:08:07,862 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:08:08,014 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:08:08,014 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:08:08,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:08:08 BoogieIcfgContainer [2025-03-08 22:08:08,015 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:08:08,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:08:08,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:08:08,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:08:08,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:08:06" (1/3) ... [2025-03-08 22:08:08,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c736d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:08:08, skipping insertion in model container [2025-03-08 22:08:08,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:08:07" (2/3) ... [2025-03-08 22:08:08,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c736d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:08:08, skipping insertion in model container [2025-03-08 22:08:08,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:08:08" (3/3) ... [2025-03-08 22:08:08,024 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-03-08 22:08:08,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:08:08,036 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 484 locations, 1 initial locations, 6 loop locations, and 55 error locations. [2025-03-08 22:08:08,038 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:08:08,130 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:08:08,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 507 transitions, 1035 flow [2025-03-08 22:08:08,296 INFO L124 PetriNetUnfolderBase]: 24/504 cut-off events. [2025-03-08 22:08:08,299 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:08:08,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 504 events. 24/504 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 656 event pairs, 0 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 425. Up to 2 conditions per place. [2025-03-08 22:08:08,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 507 transitions, 1035 flow [2025-03-08 22:08:08,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 460 transitions, 938 flow [2025-03-08 22:08:08,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:08:08,332 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;@3d51e6e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:08:08,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2025-03-08 22:08:08,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:08:08,336 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-08 22:08:08,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:08:08,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:08,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:08,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:08,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1706290245, now seen corresponding path program 1 times [2025-03-08 22:08:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:08,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300512775] [2025-03-08 22:08:08,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:08,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:08,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 22:08:08,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 22:08:08,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:08,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:08,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:08,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300512775] [2025-03-08 22:08:08,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300512775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:08,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:08,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:08,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504116684] [2025-03-08 22:08:08,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:08,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:08,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:08,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:08,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:08,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 454 out of 507 [2025-03-08 22:08:08,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 460 transitions, 938 flow. Second operand has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:08,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:08,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 454 of 507 [2025-03-08 22:08:08,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:08,818 INFO L124 PetriNetUnfolderBase]: 101/1214 cut-off events. [2025-03-08 22:08:08,819 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-08 22:08:08,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1214 events. 101/1214 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6579 event pairs, 51 based on Foata normal form. 9/1015 useless extension candidates. Maximal degree in co-relation 955. Up to 135 conditions per place. [2025-03-08 22:08:08,831 INFO L140 encePairwiseOnDemand]: 478/507 looper letters, 19 selfloop transitions, 2 changer transitions 9/433 dead transitions. [2025-03-08 22:08:08,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 433 transitions, 926 flow [2025-03-08 22:08:08,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1410 transitions. [2025-03-08 22:08:08,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9270216962524654 [2025-03-08 22:08:08,850 INFO L175 Difference]: Start difference. First operand has 449 places, 460 transitions, 938 flow. Second operand 3 states and 1410 transitions. [2025-03-08 22:08:08,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 433 transitions, 926 flow [2025-03-08 22:08:08,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 433 transitions, 914 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:08:08,866 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 858 flow [2025-03-08 22:08:08,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=858, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2025-03-08 22:08:08,871 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -19 predicate places. [2025-03-08 22:08:08,872 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 858 flow [2025-03-08 22:08:08,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:08,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:08,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:08,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:08:08,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:08,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:08,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1413492987, now seen corresponding path program 1 times [2025-03-08 22:08:08,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:08,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170965449] [2025-03-08 22:08:08,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:08,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:08,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 22:08:08,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 22:08:08,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:08,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:08,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:08,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170965449] [2025-03-08 22:08:08,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170965449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:08,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:08,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:08,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571653723] [2025-03-08 22:08:08,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:08,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:08,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:08,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:08,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:08,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 507 [2025-03-08 22:08:08,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:08,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:08,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 507 [2025-03-08 22:08:08,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:09,213 INFO L124 PetriNetUnfolderBase]: 223/1237 cut-off events. [2025-03-08 22:08:09,214 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-08 22:08:09,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1237 events. 223/1237 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6566 event pairs, 128 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1525. Up to 299 conditions per place. [2025-03-08 22:08:09,222 INFO L140 encePairwiseOnDemand]: 499/507 looper letters, 23 selfloop transitions, 1 changer transitions 0/417 dead transitions. [2025-03-08 22:08:09,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 417 transitions, 892 flow [2025-03-08 22:08:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1369 transitions. [2025-03-08 22:08:09,228 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9000657462195923 [2025-03-08 22:08:09,229 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 858 flow. Second operand 3 states and 1369 transitions. [2025-03-08 22:08:09,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 417 transitions, 892 flow [2025-03-08 22:08:09,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 417 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:09,237 INFO L231 Difference]: Finished difference. Result has 414 places, 417 transitions, 842 flow [2025-03-08 22:08:09,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=414, PETRI_TRANSITIONS=417} [2025-03-08 22:08:09,238 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -35 predicate places. [2025-03-08 22:08:09,238 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 417 transitions, 842 flow [2025-03-08 22:08:09,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:09,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:09,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:09,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:08:09,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:09,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:09,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1305606812, now seen corresponding path program 1 times [2025-03-08 22:08:09,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:09,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846607790] [2025-03-08 22:08:09,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:09,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:09,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 22:08:09,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:08:09,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:09,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:09,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:09,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846607790] [2025-03-08 22:08:09,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846607790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:09,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:09,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:09,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502735874] [2025-03-08 22:08:09,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:09,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:09,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:09,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:09,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:10,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 507 [2025-03-08 22:08:10,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 417 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:10,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:10,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 507 [2025-03-08 22:08:10,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:10,392 INFO L124 PetriNetUnfolderBase]: 287/1440 cut-off events. [2025-03-08 22:08:10,393 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-08 22:08:10,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1973 conditions, 1440 events. 287/1440 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8470 event pairs, 188 based on Foata normal form. 0/1252 useless extension candidates. Maximal degree in co-relation 1941. Up to 463 conditions per place. [2025-03-08 22:08:10,401 INFO L140 encePairwiseOnDemand]: 489/507 looper letters, 65 selfloop transitions, 15 changer transitions 0/414 dead transitions. [2025-03-08 22:08:10,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 414 transitions, 996 flow [2025-03-08 22:08:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2447 transitions. [2025-03-08 22:08:10,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8044049967126891 [2025-03-08 22:08:10,408 INFO L175 Difference]: Start difference. First operand has 414 places, 417 transitions, 842 flow. Second operand 6 states and 2447 transitions. [2025-03-08 22:08:10,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 414 transitions, 996 flow [2025-03-08 22:08:10,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 414 transitions, 995 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:08:10,414 INFO L231 Difference]: Finished difference. Result has 415 places, 414 transitions, 865 flow [2025-03-08 22:08:10,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=865, PETRI_PLACES=415, PETRI_TRANSITIONS=414} [2025-03-08 22:08:10,415 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -34 predicate places. [2025-03-08 22:08:10,416 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 414 transitions, 865 flow [2025-03-08 22:08:10,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.5) internal successors, (2373), 6 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:10,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:10,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:10,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:08:10,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:10,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash -727110873, now seen corresponding path program 1 times [2025-03-08 22:08:10,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:10,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734796358] [2025-03-08 22:08:10,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:10,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:10,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 22:08:10,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:08:10,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:10,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:10,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:10,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734796358] [2025-03-08 22:08:10,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734796358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:10,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:10,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:10,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784717311] [2025-03-08 22:08:10,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:10,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:10,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:10,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:10,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:10,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 507 [2025-03-08 22:08:10,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 414 transitions, 865 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:10,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:10,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 507 [2025-03-08 22:08:10,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:10,569 INFO L124 PetriNetUnfolderBase]: 64/654 cut-off events. [2025-03-08 22:08:10,569 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 22:08:10,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 654 events. 64/654 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2155 event pairs, 34 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 743. Up to 92 conditions per place. [2025-03-08 22:08:10,573 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2025-03-08 22:08:10,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 413 transitions, 899 flow [2025-03-08 22:08:10,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2025-03-08 22:08:10,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9138724523339908 [2025-03-08 22:08:10,576 INFO L175 Difference]: Start difference. First operand has 415 places, 414 transitions, 865 flow. Second operand 3 states and 1390 transitions. [2025-03-08 22:08:10,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 413 transitions, 899 flow [2025-03-08 22:08:10,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 413 transitions, 869 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:08:10,581 INFO L231 Difference]: Finished difference. Result has 411 places, 413 transitions, 837 flow [2025-03-08 22:08:10,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=411, PETRI_TRANSITIONS=413} [2025-03-08 22:08:10,583 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -38 predicate places. [2025-03-08 22:08:10,583 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 413 transitions, 837 flow [2025-03-08 22:08:10,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:10,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:10,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:10,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:08:10,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:10,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:10,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1411092221, now seen corresponding path program 1 times [2025-03-08 22:08:10,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:10,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314926227] [2025-03-08 22:08:10,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:10,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:10,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 22:08:10,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 22:08:10,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:10,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:10,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314926227] [2025-03-08 22:08:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314926227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:10,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:10,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:10,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472293118] [2025-03-08 22:08:10,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:10,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:10,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:10,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:10,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 507 [2025-03-08 22:08:10,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 413 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:10,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:10,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 507 [2025-03-08 22:08:10,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:10,739 INFO L124 PetriNetUnfolderBase]: 64/653 cut-off events. [2025-03-08 22:08:10,739 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 22:08:10,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 653 events. 64/653 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2008 event pairs, 34 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 729. Up to 92 conditions per place. [2025-03-08 22:08:10,742 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2025-03-08 22:08:10,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 412 transitions, 871 flow [2025-03-08 22:08:10,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1390 transitions. [2025-03-08 22:08:10,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9138724523339908 [2025-03-08 22:08:10,745 INFO L175 Difference]: Start difference. First operand has 411 places, 413 transitions, 837 flow. Second operand 3 states and 1390 transitions. [2025-03-08 22:08:10,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 412 transitions, 871 flow [2025-03-08 22:08:10,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 412 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:10,750 INFO L231 Difference]: Finished difference. Result has 410 places, 412 transitions, 835 flow [2025-03-08 22:08:10,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=835, PETRI_PLACES=410, PETRI_TRANSITIONS=412} [2025-03-08 22:08:10,751 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -39 predicate places. [2025-03-08 22:08:10,751 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 412 transitions, 835 flow [2025-03-08 22:08:10,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.3333333333333) internal successors, (1375), 3 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:10,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:10,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:10,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:08:10,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:10,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash 129991439, now seen corresponding path program 1 times [2025-03-08 22:08:10,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:10,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796138684] [2025-03-08 22:08:10,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:10,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:10,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 22:08:10,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 22:08:10,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:10,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:10,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:10,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796138684] [2025-03-08 22:08:10,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796138684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:10,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:10,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:10,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863599066] [2025-03-08 22:08:10,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:10,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:10,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:10,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:10,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:10,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 507 [2025-03-08 22:08:10,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 412 transitions, 835 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:10,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:10,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 507 [2025-03-08 22:08:10,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:10,886 INFO L124 PetriNetUnfolderBase]: 30/482 cut-off events. [2025-03-08 22:08:10,887 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 22:08:10,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 482 events. 30/482 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 932 event pairs, 12 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 504. Up to 44 conditions per place. [2025-03-08 22:08:10,889 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 12 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2025-03-08 22:08:10,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 411 transitions, 861 flow [2025-03-08 22:08:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-08 22:08:10,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-08 22:08:10,892 INFO L175 Difference]: Start difference. First operand has 410 places, 412 transitions, 835 flow. Second operand 3 states and 1398 transitions. [2025-03-08 22:08:10,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 411 transitions, 861 flow [2025-03-08 22:08:10,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 411 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:10,897 INFO L231 Difference]: Finished difference. Result has 409 places, 411 transitions, 833 flow [2025-03-08 22:08:10,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=833, PETRI_PLACES=409, PETRI_TRANSITIONS=411} [2025-03-08 22:08:10,898 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2025-03-08 22:08:10,898 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 411 transitions, 833 flow [2025-03-08 22:08:10,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:10,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:10,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:10,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:08:10,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:10,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash 447248211, now seen corresponding path program 1 times [2025-03-08 22:08:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:10,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477429520] [2025-03-08 22:08:10,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:10,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:10,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 22:08:10,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 22:08:10,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:10,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:10,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:10,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477429520] [2025-03-08 22:08:10,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477429520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:10,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:10,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:10,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791207224] [2025-03-08 22:08:10,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:10,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:10,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:10,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:10,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:10,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 507 [2025-03-08 22:08:10,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 411 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:10,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:10,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 507 [2025-03-08 22:08:10,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:11,011 INFO L124 PetriNetUnfolderBase]: 30/481 cut-off events. [2025-03-08 22:08:11,011 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-08 22:08:11,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 481 events. 30/481 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 932 event pairs, 12 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 503. Up to 44 conditions per place. [2025-03-08 22:08:11,014 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 12 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2025-03-08 22:08:11,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 410 transitions, 859 flow [2025-03-08 22:08:11,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-08 22:08:11,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-08 22:08:11,017 INFO L175 Difference]: Start difference. First operand has 409 places, 411 transitions, 833 flow. Second operand 3 states and 1398 transitions. [2025-03-08 22:08:11,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 410 transitions, 859 flow [2025-03-08 22:08:11,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 410 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:11,022 INFO L231 Difference]: Finished difference. Result has 408 places, 410 transitions, 831 flow [2025-03-08 22:08:11,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=831, PETRI_PLACES=408, PETRI_TRANSITIONS=410} [2025-03-08 22:08:11,023 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2025-03-08 22:08:11,023 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 410 transitions, 831 flow [2025-03-08 22:08:11,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.3333333333333) internal successors, (1387), 3 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:11,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:11,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:11,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:08:11,025 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:11,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:11,025 INFO L85 PathProgramCache]: Analyzing trace with hash 983635437, now seen corresponding path program 1 times [2025-03-08 22:08:11,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:11,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708561992] [2025-03-08 22:08:11,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:11,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:11,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 22:08:11,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 22:08:11,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:11,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:11,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:11,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708561992] [2025-03-08 22:08:11,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708561992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:11,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:11,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:11,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672302218] [2025-03-08 22:08:11,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:11,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:11,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:11,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:11,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:11,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 507 [2025-03-08 22:08:11,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 410 transitions, 831 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:11,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:11,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 507 [2025-03-08 22:08:11,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:11,222 INFO L124 PetriNetUnfolderBase]: 122/1251 cut-off events. [2025-03-08 22:08:11,222 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-08 22:08:11,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 1251 events. 122/1251 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6409 event pairs, 56 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 1398. Up to 156 conditions per place. [2025-03-08 22:08:11,232 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 17 selfloop transitions, 1 changer transitions 0/406 dead transitions. [2025-03-08 22:08:11,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 406 transitions, 859 flow [2025-03-08 22:08:11,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2025-03-08 22:08:11,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9119000657462196 [2025-03-08 22:08:11,235 INFO L175 Difference]: Start difference. First operand has 408 places, 410 transitions, 831 flow. Second operand 3 states and 1387 transitions. [2025-03-08 22:08:11,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 406 transitions, 859 flow [2025-03-08 22:08:11,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 406 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:11,239 INFO L231 Difference]: Finished difference. Result has 404 places, 406 transitions, 821 flow [2025-03-08 22:08:11,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=404, PETRI_TRANSITIONS=406} [2025-03-08 22:08:11,241 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2025-03-08 22:08:11,242 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 406 transitions, 821 flow [2025-03-08 22:08:11,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:11,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:11,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:11,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:08:11,243 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:11,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:11,243 INFO L85 PathProgramCache]: Analyzing trace with hash -395891551, now seen corresponding path program 1 times [2025-03-08 22:08:11,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:11,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894923435] [2025-03-08 22:08:11,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:11,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:11,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 22:08:11,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 22:08:11,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:11,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:11,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:11,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894923435] [2025-03-08 22:08:11,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894923435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:11,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:11,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:11,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955930350] [2025-03-08 22:08:11,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:11,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:11,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:11,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:12,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 507 [2025-03-08 22:08:12,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 406 transitions, 821 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:12,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:12,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 507 [2025-03-08 22:08:12,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:12,153 INFO L124 PetriNetUnfolderBase]: 29/514 cut-off events. [2025-03-08 22:08:12,153 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-08 22:08:12,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 514 events. 29/514 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1135 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 558. Up to 43 conditions per place. [2025-03-08 22:08:12,155 INFO L140 encePairwiseOnDemand]: 500/507 looper letters, 35 selfloop transitions, 5 changer transitions 0/411 dead transitions. [2025-03-08 22:08:12,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 411 transitions, 915 flow [2025-03-08 22:08:12,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2025-03-08 22:08:12,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856015779092702 [2025-03-08 22:08:12,159 INFO L175 Difference]: Start difference. First operand has 404 places, 406 transitions, 821 flow. Second operand 6 states and 2694 transitions. [2025-03-08 22:08:12,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 411 transitions, 915 flow [2025-03-08 22:08:12,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 411 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:08:12,166 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 832 flow [2025-03-08 22:08:12,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=832, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2025-03-08 22:08:12,167 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -42 predicate places. [2025-03-08 22:08:12,167 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 832 flow [2025-03-08 22:08:12,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:12,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:12,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] [2025-03-08 22:08:12,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:08:12,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:12,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:12,169 INFO L85 PathProgramCache]: Analyzing trace with hash -738754939, now seen corresponding path program 1 times [2025-03-08 22:08:12,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:12,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013799780] [2025-03-08 22:08:12,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:12,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 22:08:12,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 22:08:12,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:12,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:12,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013799780] [2025-03-08 22:08:12,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013799780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:12,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:12,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:12,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835172503] [2025-03-08 22:08:12,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:12,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:12,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:12,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:12,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:12,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 507 [2025-03-08 22:08:12,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:12,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:12,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 507 [2025-03-08 22:08:12,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:12,300 INFO L124 PetriNetUnfolderBase]: 63/679 cut-off events. [2025-03-08 22:08:12,300 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-08 22:08:12,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 679 events. 63/679 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2307 event pairs, 36 based on Foata normal form. 0/625 useless extension candidates. Maximal degree in co-relation 809. Up to 98 conditions per place. [2025-03-08 22:08:12,304 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/404 dead transitions. [2025-03-08 22:08:12,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 404 transitions, 866 flow [2025-03-08 22:08:12,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2025-03-08 22:08:12,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9151873767258383 [2025-03-08 22:08:12,307 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 832 flow. Second operand 3 states and 1392 transitions. [2025-03-08 22:08:12,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 404 transitions, 866 flow [2025-03-08 22:08:12,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 404 transitions, 858 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 22:08:12,311 INFO L231 Difference]: Finished difference. Result has 404 places, 404 transitions, 826 flow [2025-03-08 22:08:12,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=404, PETRI_TRANSITIONS=404} [2025-03-08 22:08:12,312 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -45 predicate places. [2025-03-08 22:08:12,312 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 404 transitions, 826 flow [2025-03-08 22:08:12,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:12,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:12,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:12,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:08:12,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:12,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash -114086729, now seen corresponding path program 1 times [2025-03-08 22:08:12,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:12,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21806373] [2025-03-08 22:08:12,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:12,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 22:08:12,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 22:08:12,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:12,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:08:12,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:12,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21806373] [2025-03-08 22:08:12,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21806373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:12,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:12,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:12,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981962833] [2025-03-08 22:08:12,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:12,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:12,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:12,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:12,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 507 [2025-03-08 22:08:12,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 404 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:12,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:12,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 507 [2025-03-08 22:08:12,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:12,495 INFO L124 PetriNetUnfolderBase]: 121/1225 cut-off events. [2025-03-08 22:08:12,496 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-08 22:08:12,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 1225 events. 121/1225 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6224 event pairs, 58 based on Foata normal form. 0/1088 useless extension candidates. Maximal degree in co-relation 1422. Up to 158 conditions per place. [2025-03-08 22:08:12,502 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 18 selfloop transitions, 1 changer transitions 0/400 dead transitions. [2025-03-08 22:08:12,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 400 transitions, 856 flow [2025-03-08 22:08:12,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2025-03-08 22:08:12,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9119000657462196 [2025-03-08 22:08:12,505 INFO L175 Difference]: Start difference. First operand has 404 places, 404 transitions, 826 flow. Second operand 3 states and 1387 transitions. [2025-03-08 22:08:12,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 400 transitions, 856 flow [2025-03-08 22:08:12,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 400 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:12,509 INFO L231 Difference]: Finished difference. Result has 400 places, 400 transitions, 816 flow [2025-03-08 22:08:12,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=816, PETRI_PLACES=400, PETRI_TRANSITIONS=400} [2025-03-08 22:08:12,510 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -49 predicate places. [2025-03-08 22:08:12,510 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 400 transitions, 816 flow [2025-03-08 22:08:12,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:12,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:12,511 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:12,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:08:12,511 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:12,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:12,512 INFO L85 PathProgramCache]: Analyzing trace with hash -28014879, now seen corresponding path program 1 times [2025-03-08 22:08:12,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:12,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719127355] [2025-03-08 22:08:12,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:12,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:12,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 22:08:12,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 22:08:12,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:12,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:08:12,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:12,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719127355] [2025-03-08 22:08:12,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719127355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:12,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:12,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:12,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135090475] [2025-03-08 22:08:12,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:12,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:12,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:12,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:12,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:13,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 507 [2025-03-08 22:08:13,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 400 transitions, 816 flow. Second operand has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:13,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:13,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 507 [2025-03-08 22:08:13,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:13,300 INFO L124 PetriNetUnfolderBase]: 29/507 cut-off events. [2025-03-08 22:08:13,300 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-08 22:08:13,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 507 events. 29/507 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1113 event pairs, 4 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2025-03-08 22:08:13,303 INFO L140 encePairwiseOnDemand]: 500/507 looper letters, 35 selfloop transitions, 5 changer transitions 0/404 dead transitions. [2025-03-08 22:08:13,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 404 transitions, 908 flow [2025-03-08 22:08:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2694 transitions. [2025-03-08 22:08:13,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856015779092702 [2025-03-08 22:08:13,307 INFO L175 Difference]: Start difference. First operand has 400 places, 400 transitions, 816 flow. Second operand 6 states and 2694 transitions. [2025-03-08 22:08:13,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 404 transitions, 908 flow [2025-03-08 22:08:13,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 404 transitions, 907 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:08:13,312 INFO L231 Difference]: Finished difference. Result has 402 places, 398 transitions, 821 flow [2025-03-08 22:08:13,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=821, PETRI_PLACES=402, PETRI_TRANSITIONS=398} [2025-03-08 22:08:13,314 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -47 predicate places. [2025-03-08 22:08:13,315 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 398 transitions, 821 flow [2025-03-08 22:08:13,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 443.1666666666667) internal successors, (2659), 6 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:13,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:13,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:13,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:08:13,317 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:13,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:13,319 INFO L85 PathProgramCache]: Analyzing trace with hash 575758350, now seen corresponding path program 1 times [2025-03-08 22:08:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:13,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47118803] [2025-03-08 22:08:13,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:13,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:13,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 22:08:13,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 22:08:13,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:13,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:08:13,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:13,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47118803] [2025-03-08 22:08:13,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47118803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:13,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:13,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:13,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367560927] [2025-03-08 22:08:13,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:13,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:13,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:13,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:13,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:13,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 507 [2025-03-08 22:08:13,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 398 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:13,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:13,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 507 [2025-03-08 22:08:13,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:13,469 INFO L124 PetriNetUnfolderBase]: 63/672 cut-off events. [2025-03-08 22:08:13,469 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-08 22:08:13,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 672 events. 63/672 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2204 event pairs, 36 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 804. Up to 98 conditions per place. [2025-03-08 22:08:13,473 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 16 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2025-03-08 22:08:13,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 397 transitions, 855 flow [2025-03-08 22:08:13,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1392 transitions. [2025-03-08 22:08:13,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9151873767258383 [2025-03-08 22:08:13,476 INFO L175 Difference]: Start difference. First operand has 402 places, 398 transitions, 821 flow. Second operand 3 states and 1392 transitions. [2025-03-08 22:08:13,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 397 transitions, 855 flow [2025-03-08 22:08:13,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 397 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:08:13,481 INFO L231 Difference]: Finished difference. Result has 398 places, 397 transitions, 813 flow [2025-03-08 22:08:13,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=813, PETRI_PLACES=398, PETRI_TRANSITIONS=397} [2025-03-08 22:08:13,483 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -51 predicate places. [2025-03-08 22:08:13,483 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 397 transitions, 813 flow [2025-03-08 22:08:13,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:13,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:13,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:13,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:08:13,484 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:13,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:13,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1849764041, now seen corresponding path program 1 times [2025-03-08 22:08:13,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:13,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937209422] [2025-03-08 22:08:13,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:13,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:13,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 22:08:13,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 22:08:13,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:13,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:08:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:13,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937209422] [2025-03-08 22:08:13,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937209422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:13,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:13,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91544202] [2025-03-08 22:08:13,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:13,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:13,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:13,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:13,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-08 22:08:13,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 397 transitions, 813 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:13,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:13,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-08 22:08:13,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:13,633 INFO L124 PetriNetUnfolderBase]: 29/485 cut-off events. [2025-03-08 22:08:13,634 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-08 22:08:13,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 485 events. 29/485 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1012 event pairs, 14 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 530. Up to 50 conditions per place. [2025-03-08 22:08:13,637 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 14 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2025-03-08 22:08:13,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 396 transitions, 843 flow [2025-03-08 22:08:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2025-03-08 22:08:13,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9178172255095332 [2025-03-08 22:08:13,640 INFO L175 Difference]: Start difference. First operand has 398 places, 397 transitions, 813 flow. Second operand 3 states and 1396 transitions. [2025-03-08 22:08:13,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 396 transitions, 843 flow [2025-03-08 22:08:13,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 396 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:13,645 INFO L231 Difference]: Finished difference. Result has 397 places, 396 transitions, 811 flow [2025-03-08 22:08:13,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=397, PETRI_TRANSITIONS=396} [2025-03-08 22:08:13,646 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -52 predicate places. [2025-03-08 22:08:13,646 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 396 transitions, 811 flow [2025-03-08 22:08:13,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:13,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:13,648 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:13,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:08:13,648 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:13,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:13,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1484347198, now seen corresponding path program 1 times [2025-03-08 22:08:13,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:13,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506479094] [2025-03-08 22:08:13,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:13,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:13,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 22:08:13,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 22:08:13,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:13,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:08:13,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:13,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506479094] [2025-03-08 22:08:13,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506479094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:13,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:13,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:13,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452853689] [2025-03-08 22:08:13,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:13,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:13,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:13,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:13,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:13,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-08 22:08:13,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 396 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:13,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:13,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-08 22:08:13,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:13,873 INFO L124 PetriNetUnfolderBase]: 109/1236 cut-off events. [2025-03-08 22:08:13,873 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-08 22:08:13,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1463 conditions, 1236 events. 109/1236 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6973 event pairs, 25 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 1430. Up to 91 conditions per place. [2025-03-08 22:08:13,882 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 24 selfloop transitions, 3 changer transitions 0/405 dead transitions. [2025-03-08 22:08:13,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 405 transitions, 892 flow [2025-03-08 22:08:13,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1407 transitions. [2025-03-08 22:08:13,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9250493096646942 [2025-03-08 22:08:13,885 INFO L175 Difference]: Start difference. First operand has 397 places, 396 transitions, 811 flow. Second operand 3 states and 1407 transitions. [2025-03-08 22:08:13,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 405 transitions, 892 flow [2025-03-08 22:08:13,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 405 transitions, 888 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:13,890 INFO L231 Difference]: Finished difference. Result has 396 places, 396 transitions, 820 flow [2025-03-08 22:08:13,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=396, PETRI_TRANSITIONS=396} [2025-03-08 22:08:13,891 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -53 predicate places. [2025-03-08 22:08:13,891 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 396 transitions, 820 flow [2025-03-08 22:08:13,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:13,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:13,892 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:13,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:08:13,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:13,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1681149278, now seen corresponding path program 1 times [2025-03-08 22:08:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:13,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522573950] [2025-03-08 22:08:13,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:13,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:13,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-08 22:08:13,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-08 22:08:13,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:13,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:08:14,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:14,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522573950] [2025-03-08 22:08:14,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522573950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:14,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:14,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:08:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760158207] [2025-03-08 22:08:14,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:14,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:08:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:14,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:08:14,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:08:14,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 435 out of 507 [2025-03-08 22:08:14,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 396 transitions, 820 flow. Second operand has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:14,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:14,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 435 of 507 [2025-03-08 22:08:14,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:14,878 INFO L124 PetriNetUnfolderBase]: 234/2125 cut-off events. [2025-03-08 22:08:14,878 INFO L125 PetriNetUnfolderBase]: For 139/141 co-relation queries the response was YES. [2025-03-08 22:08:14,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 2125 events. 234/2125 cut-off events. For 139/141 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 11757 event pairs, 122 based on Foata normal form. 9/1969 useless extension candidates. Maximal degree in co-relation 2670. Up to 245 conditions per place. [2025-03-08 22:08:14,890 INFO L140 encePairwiseOnDemand]: 478/507 looper letters, 52 selfloop transitions, 42 changer transitions 0/447 dead transitions. [2025-03-08 22:08:14,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 447 transitions, 1126 flow [2025-03-08 22:08:14,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:08:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-08 22:08:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4442 transitions. [2025-03-08 22:08:14,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8761341222879684 [2025-03-08 22:08:14,897 INFO L175 Difference]: Start difference. First operand has 396 places, 396 transitions, 820 flow. Second operand 10 states and 4442 transitions. [2025-03-08 22:08:14,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 447 transitions, 1126 flow [2025-03-08 22:08:14,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 447 transitions, 1123 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:08:14,904 INFO L231 Difference]: Finished difference. Result has 408 places, 421 transitions, 1009 flow [2025-03-08 22:08:14,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1009, PETRI_PLACES=408, PETRI_TRANSITIONS=421} [2025-03-08 22:08:14,905 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -41 predicate places. [2025-03-08 22:08:14,905 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 421 transitions, 1009 flow [2025-03-08 22:08:14,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 439.14285714285717) internal successors, (3074), 7 states have internal predecessors, (3074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:14,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:14,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:14,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:08:14,907 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:14,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:14,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1757146617, now seen corresponding path program 1 times [2025-03-08 22:08:14,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:14,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276094586] [2025-03-08 22:08:14,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:14,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:14,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-08 22:08:14,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-08 22:08:14,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:14,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:08:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276094586] [2025-03-08 22:08:14,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276094586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:14,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:14,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:14,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477272867] [2025-03-08 22:08:14,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:14,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:14,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:14,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:14,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:14,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 507 [2025-03-08 22:08:14,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 421 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:14,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:14,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 507 [2025-03-08 22:08:14,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:15,164 INFO L124 PetriNetUnfolderBase]: 84/1026 cut-off events. [2025-03-08 22:08:15,164 INFO L125 PetriNetUnfolderBase]: For 72/75 co-relation queries the response was YES. [2025-03-08 22:08:15,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 1026 events. 84/1026 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3144 event pairs, 39 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1272. Up to 125 conditions per place. [2025-03-08 22:08:15,169 INFO L140 encePairwiseOnDemand]: 505/507 looper letters, 12 selfloop transitions, 1 changer transitions 0/420 dead transitions. [2025-03-08 22:08:15,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 420 transitions, 1033 flow [2025-03-08 22:08:15,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1405 transitions. [2025-03-08 22:08:15,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9237343852728468 [2025-03-08 22:08:15,172 INFO L175 Difference]: Start difference. First operand has 408 places, 421 transitions, 1009 flow. Second operand 3 states and 1405 transitions. [2025-03-08 22:08:15,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 420 transitions, 1033 flow [2025-03-08 22:08:15,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 420 transitions, 1033 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:08:15,177 INFO L231 Difference]: Finished difference. Result has 409 places, 420 transitions, 1009 flow [2025-03-08 22:08:15,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1009, PETRI_PLACES=409, PETRI_TRANSITIONS=420} [2025-03-08 22:08:15,178 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2025-03-08 22:08:15,178 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 420 transitions, 1009 flow [2025-03-08 22:08:15,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:15,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:15,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:15,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:08:15,179 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:15,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2112538869, now seen corresponding path program 1 times [2025-03-08 22:08:15,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:15,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886065100] [2025-03-08 22:08:15,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:15,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:15,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 22:08:15,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 22:08:15,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:15,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:15,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:08:15,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:15,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886065100] [2025-03-08 22:08:15,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886065100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:15,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:15,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:15,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179485890] [2025-03-08 22:08:15,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:15,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:15,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:15,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:15,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:15,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-08 22:08:15,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 420 transitions, 1009 flow. Second operand has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:15,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:15,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-08 22:08:15,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:15,566 INFO L124 PetriNetUnfolderBase]: 235/2240 cut-off events. [2025-03-08 22:08:15,566 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-03-08 22:08:15,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2895 conditions, 2240 events. 235/2240 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13803 event pairs, 61 based on Foata normal form. 4/2098 useless extension candidates. Maximal degree in co-relation 2853. Up to 176 conditions per place. [2025-03-08 22:08:15,576 INFO L140 encePairwiseOnDemand]: 502/507 looper letters, 20 selfloop transitions, 2 changer transitions 31/429 dead transitions. [2025-03-08 22:08:15,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 429 transitions, 1088 flow [2025-03-08 22:08:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1406 transitions. [2025-03-08 22:08:15,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9243918474687706 [2025-03-08 22:08:15,579 INFO L175 Difference]: Start difference. First operand has 409 places, 420 transitions, 1009 flow. Second operand 3 states and 1406 transitions. [2025-03-08 22:08:15,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 429 transitions, 1088 flow [2025-03-08 22:08:15,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 429 transitions, 1087 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:08:15,585 INFO L231 Difference]: Finished difference. Result has 409 places, 390 transitions, 884 flow [2025-03-08 22:08:15,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=409, PETRI_TRANSITIONS=390} [2025-03-08 22:08:15,585 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -40 predicate places. [2025-03-08 22:08:15,586 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 390 transitions, 884 flow [2025-03-08 22:08:15,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.0) internal successors, (1389), 3 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:15,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:15,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:15,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:08:15,586 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:15,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:15,587 INFO L85 PathProgramCache]: Analyzing trace with hash 791665075, now seen corresponding path program 1 times [2025-03-08 22:08:15,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:15,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030648679] [2025-03-08 22:08:15,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:15,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:15,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-08 22:08:15,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-08 22:08:15,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:15,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:08:15,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:15,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030648679] [2025-03-08 22:08:15,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030648679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:08:15,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051142679] [2025-03-08 22:08:15,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:15,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:08:15,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:08:15,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:08:15,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:08:15,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-08 22:08:15,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-08 22:08:15,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:15,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:15,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:08:15,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:08:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:08:16,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:08:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:08:16,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051142679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:08:16,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:08:16,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-08 22:08:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456286027] [2025-03-08 22:08:16,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:08:16,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 22:08:16,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:16,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 22:08:16,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:08:17,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 507 [2025-03-08 22:08:17,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 390 transitions, 884 flow. Second operand has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:17,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:17,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 507 [2025-03-08 22:08:17,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:18,520 INFO L124 PetriNetUnfolderBase]: 447/3267 cut-off events. [2025-03-08 22:08:18,520 INFO L125 PetriNetUnfolderBase]: For 399/409 co-relation queries the response was YES. [2025-03-08 22:08:18,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4566 conditions, 3267 events. 447/3267 cut-off events. For 399/409 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 21613 event pairs, 201 based on Foata normal form. 9/3024 useless extension candidates. Maximal degree in co-relation 4522. Up to 437 conditions per place. [2025-03-08 22:08:18,534 INFO L140 encePairwiseOnDemand]: 468/507 looper letters, 34 selfloop transitions, 36 changer transitions 77/480 dead transitions. [2025-03-08 22:08:18,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 480 transitions, 1461 flow [2025-03-08 22:08:18,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:08:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-08 22:08:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 8217 transitions. [2025-03-08 22:08:18,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8530052943008408 [2025-03-08 22:08:18,544 INFO L175 Difference]: Start difference. First operand has 409 places, 390 transitions, 884 flow. Second operand 19 states and 8217 transitions. [2025-03-08 22:08:18,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 480 transitions, 1461 flow [2025-03-08 22:08:18,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 480 transitions, 1357 flow, removed 21 selfloop flow, removed 8 redundant places. [2025-03-08 22:08:18,550 INFO L231 Difference]: Finished difference. Result has 418 places, 397 transitions, 1004 flow [2025-03-08 22:08:18,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1004, PETRI_PLACES=418, PETRI_TRANSITIONS=397} [2025-03-08 22:08:18,551 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -31 predicate places. [2025-03-08 22:08:18,551 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 397 transitions, 1004 flow [2025-03-08 22:08:18,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 428.1578947368421) internal successors, (8135), 19 states have internal predecessors, (8135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:18,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:18,554 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:18,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:08:18,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:08:18,758 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:18,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash -892346174, now seen corresponding path program 2 times [2025-03-08 22:08:18,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:18,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349028294] [2025-03-08 22:08:18,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:08:18,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:18,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 325 statements into 2 equivalence classes. [2025-03-08 22:08:18,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 233 of 325 statements. [2025-03-08 22:08:18,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:08:18,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 22:08:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349028294] [2025-03-08 22:08:19,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349028294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:19,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:19,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:19,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457096120] [2025-03-08 22:08:19,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:19,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:19,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:19,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:19,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:19,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 507 [2025-03-08 22:08:19,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 397 transitions, 1004 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:19,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:19,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 507 [2025-03-08 22:08:19,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:20,134 INFO L124 PetriNetUnfolderBase]: 641/3387 cut-off events. [2025-03-08 22:08:20,135 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-03-08 22:08:20,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5090 conditions, 3387 events. 641/3387 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 26132 event pairs, 130 based on Foata normal form. 0/3134 useless extension candidates. Maximal degree in co-relation 5040. Up to 607 conditions per place. [2025-03-08 22:08:20,154 INFO L140 encePairwiseOnDemand]: 493/507 looper letters, 53 selfloop transitions, 19 changer transitions 0/434 dead transitions. [2025-03-08 22:08:20,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 434 transitions, 1246 flow [2025-03-08 22:08:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2025-03-08 22:08:20,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888560157790927 [2025-03-08 22:08:20,157 INFO L175 Difference]: Start difference. First operand has 418 places, 397 transitions, 1004 flow. Second operand 6 states and 2703 transitions. [2025-03-08 22:08:20,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 434 transitions, 1246 flow [2025-03-08 22:08:20,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 434 transitions, 1181 flow, removed 17 selfloop flow, removed 10 redundant places. [2025-03-08 22:08:20,162 INFO L231 Difference]: Finished difference. Result has 405 places, 415 transitions, 1095 flow [2025-03-08 22:08:20,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1095, PETRI_PLACES=405, PETRI_TRANSITIONS=415} [2025-03-08 22:08:20,163 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -44 predicate places. [2025-03-08 22:08:20,163 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 415 transitions, 1095 flow [2025-03-08 22:08:20,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:20,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:20,164 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:20,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:08:20,164 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:20,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:20,165 INFO L85 PathProgramCache]: Analyzing trace with hash 437578580, now seen corresponding path program 1 times [2025-03-08 22:08:20,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:20,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130127825] [2025-03-08 22:08:20,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:20,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:20,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-08 22:08:20,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-08 22:08:20,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:20,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 22:08:21,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:21,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130127825] [2025-03-08 22:08:21,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130127825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:21,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:21,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 22:08:21,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130384428] [2025-03-08 22:08:21,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:21,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:08:21,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:21,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:08:21,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:08:24,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 507 [2025-03-08 22:08:24,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 415 transitions, 1095 flow. Second operand has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:24,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:24,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 507 [2025-03-08 22:08:24,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:26,600 INFO L124 PetriNetUnfolderBase]: 1671/7904 cut-off events. [2025-03-08 22:08:26,600 INFO L125 PetriNetUnfolderBase]: For 3474/3978 co-relation queries the response was YES. [2025-03-08 22:08:26,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13758 conditions, 7904 events. 1671/7904 cut-off events. For 3474/3978 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 81536 event pairs, 448 based on Foata normal form. 180/7364 useless extension candidates. Maximal degree in co-relation 13710. Up to 1419 conditions per place. [2025-03-08 22:08:26,651 INFO L140 encePairwiseOnDemand]: 472/507 looper letters, 82 selfloop transitions, 44 changer transitions 0/468 dead transitions. [2025-03-08 22:08:26,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 468 transitions, 1579 flow [2025-03-08 22:08:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 22:08:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-08 22:08:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13254 transitions. [2025-03-08 22:08:26,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8169378698224852 [2025-03-08 22:08:26,661 INFO L175 Difference]: Start difference. First operand has 405 places, 415 transitions, 1095 flow. Second operand 32 states and 13254 transitions. [2025-03-08 22:08:26,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 468 transitions, 1579 flow [2025-03-08 22:08:26,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 468 transitions, 1579 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:08:26,670 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 1330 flow [2025-03-08 22:08:26,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1330, PETRI_PLACES=440, PETRI_TRANSITIONS=434} [2025-03-08 22:08:26,671 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -9 predicate places. [2025-03-08 22:08:26,671 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 1330 flow [2025-03-08 22:08:26,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 413.6) internal successors, (8272), 20 states have internal predecessors, (8272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:26,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:26,673 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:26,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:08:26,674 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:26,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash 532449340, now seen corresponding path program 2 times [2025-03-08 22:08:26,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:26,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192380409] [2025-03-08 22:08:26,675 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:08:26,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:26,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 337 statements into 2 equivalence classes. [2025-03-08 22:08:26,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 245 of 337 statements. [2025-03-08 22:08:26,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:08:26,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 22:08:27,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:27,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192380409] [2025-03-08 22:08:27,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192380409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:27,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:27,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 22:08:27,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794132139] [2025-03-08 22:08:27,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:27,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 22:08:27,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:27,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 22:08:27,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:08:31,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 507 [2025-03-08 22:08:31,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 434 transitions, 1330 flow. Second operand has 21 states, 21 states have (on average 411.5238095238095) internal successors, (8642), 21 states have internal predecessors, (8642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:31,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:31,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 507 [2025-03-08 22:08:31,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:34,563 INFO L124 PetriNetUnfolderBase]: 2923/14241 cut-off events. [2025-03-08 22:08:34,563 INFO L125 PetriNetUnfolderBase]: For 10492/11430 co-relation queries the response was YES. [2025-03-08 22:08:34,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26301 conditions, 14241 events. 2923/14241 cut-off events. For 10492/11430 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 160917 event pairs, 289 based on Foata normal form. 180/13079 useless extension candidates. Maximal degree in co-relation 26248. Up to 1372 conditions per place. [2025-03-08 22:08:34,666 INFO L140 encePairwiseOnDemand]: 471/507 looper letters, 135 selfloop transitions, 58 changer transitions 0/532 dead transitions. [2025-03-08 22:08:34,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 532 transitions, 2237 flow [2025-03-08 22:08:34,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 22:08:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-08 22:08:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 14445 transitions. [2025-03-08 22:08:34,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8140321217244294 [2025-03-08 22:08:34,678 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 1330 flow. Second operand 35 states and 14445 transitions. [2025-03-08 22:08:34,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 532 transitions, 2237 flow [2025-03-08 22:08:34,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 532 transitions, 2186 flow, removed 0 selfloop flow, removed 26 redundant places. [2025-03-08 22:08:34,698 INFO L231 Difference]: Finished difference. Result has 454 places, 459 transitions, 1661 flow [2025-03-08 22:08:34,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1661, PETRI_PLACES=454, PETRI_TRANSITIONS=459} [2025-03-08 22:08:34,699 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 5 predicate places. [2025-03-08 22:08:34,699 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 459 transitions, 1661 flow [2025-03-08 22:08:34,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 411.5238095238095) internal successors, (8642), 21 states have internal predecessors, (8642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:34,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:34,701 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:34,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:08:34,701 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:34,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:34,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1386035152, now seen corresponding path program 1 times [2025-03-08 22:08:34,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:34,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406276190] [2025-03-08 22:08:34,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:34,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:34,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-08 22:08:34,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-08 22:08:34,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:34,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 22:08:35,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:35,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406276190] [2025-03-08 22:08:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406276190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:35,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:35,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:08:35,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791177275] [2025-03-08 22:08:35,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:35,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:08:35,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:35,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:08:35,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:08:35,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 439 out of 507 [2025-03-08 22:08:35,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 459 transitions, 1661 flow. Second operand has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:35,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:35,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 439 of 507 [2025-03-08 22:08:35,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:38,871 INFO L124 PetriNetUnfolderBase]: 4767/18826 cut-off events. [2025-03-08 22:08:38,871 INFO L125 PetriNetUnfolderBase]: For 23560/23918 co-relation queries the response was YES. [2025-03-08 22:08:38,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39845 conditions, 18826 events. 4767/18826 cut-off events. For 23560/23918 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 221075 event pairs, 773 based on Foata normal form. 270/17795 useless extension candidates. Maximal degree in co-relation 39788. Up to 3398 conditions per place. [2025-03-08 22:08:39,066 INFO L140 encePairwiseOnDemand]: 493/507 looper letters, 76 selfloop transitions, 32 changer transitions 0/504 dead transitions. [2025-03-08 22:08:39,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 504 transitions, 2103 flow [2025-03-08 22:08:39,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:08:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:08:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2703 transitions. [2025-03-08 22:08:39,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888560157790927 [2025-03-08 22:08:39,070 INFO L175 Difference]: Start difference. First operand has 454 places, 459 transitions, 1661 flow. Second operand 6 states and 2703 transitions. [2025-03-08 22:08:39,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 504 transitions, 2103 flow [2025-03-08 22:08:39,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 504 transitions, 2012 flow, removed 20 selfloop flow, removed 26 redundant places. [2025-03-08 22:08:39,129 INFO L231 Difference]: Finished difference. Result has 438 places, 485 transitions, 1916 flow [2025-03-08 22:08:39,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1916, PETRI_PLACES=438, PETRI_TRANSITIONS=485} [2025-03-08 22:08:39,132 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -11 predicate places. [2025-03-08 22:08:39,132 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 485 transitions, 1916 flow [2025-03-08 22:08:39,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 442.5) internal successors, (2655), 6 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:39,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:39,133 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:39,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:08:39,133 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:39,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:39,135 INFO L85 PathProgramCache]: Analyzing trace with hash -148079631, now seen corresponding path program 1 times [2025-03-08 22:08:39,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:39,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006987999] [2025-03-08 22:08:39,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:39,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:39,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-08 22:08:39,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-08 22:08:39,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:39,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 22:08:39,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:39,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006987999] [2025-03-08 22:08:39,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006987999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:08:39,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:08:39,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:08:39,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601677872] [2025-03-08 22:08:39,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:08:39,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:08:39,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:39,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:08:39,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:08:39,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 507 [2025-03-08 22:08:39,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 485 transitions, 1916 flow. Second operand has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:39,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:39,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 507 [2025-03-08 22:08:39,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:42,354 INFO L124 PetriNetUnfolderBase]: 3514/16815 cut-off events. [2025-03-08 22:08:42,354 INFO L125 PetriNetUnfolderBase]: For 32547/33231 co-relation queries the response was YES. [2025-03-08 22:08:42,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38156 conditions, 16815 events. 3514/16815 cut-off events. For 32547/33231 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 201597 event pairs, 928 based on Foata normal form. 162/15616 useless extension candidates. Maximal degree in co-relation 38096. Up to 2888 conditions per place. [2025-03-08 22:08:42,480 INFO L140 encePairwiseOnDemand]: 504/507 looper letters, 49 selfloop transitions, 2 changer transitions 0/491 dead transitions. [2025-03-08 22:08:42,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 491 transitions, 2058 flow [2025-03-08 22:08:42,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:08:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:08:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1398 transitions. [2025-03-08 22:08:42,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191321499013807 [2025-03-08 22:08:42,482 INFO L175 Difference]: Start difference. First operand has 438 places, 485 transitions, 1916 flow. Second operand 3 states and 1398 transitions. [2025-03-08 22:08:42,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 491 transitions, 2058 flow [2025-03-08 22:08:42,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 491 transitions, 2042 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-03-08 22:08:42,564 INFO L231 Difference]: Finished difference. Result has 439 places, 484 transitions, 1902 flow [2025-03-08 22:08:42,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1902, PETRI_PLACES=439, PETRI_TRANSITIONS=484} [2025-03-08 22:08:42,565 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -10 predicate places. [2025-03-08 22:08:42,565 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 484 transitions, 1902 flow [2025-03-08 22:08:42,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.0) internal successors, (1386), 3 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:42,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:42,565 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:42,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:08:42,566 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:42,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:42,567 INFO L85 PathProgramCache]: Analyzing trace with hash -942463998, now seen corresponding path program 1 times [2025-03-08 22:08:42,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:42,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287456971] [2025-03-08 22:08:42,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:42,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:42,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-08 22:08:42,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-08 22:08:42,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:42,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 22:08:42,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:42,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287456971] [2025-03-08 22:08:42,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287456971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:08:42,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757740941] [2025-03-08 22:08:42,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:42,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:08:42,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:08:42,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:08:42,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:08:42,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-08 22:08:43,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-08 22:08:43,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:43,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:43,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 22:08:43,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:08:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 22:08:43,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:08:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 22:08:43,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757740941] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:08:43,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:08:43,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2025-03-08 22:08:43,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992495215] [2025-03-08 22:08:43,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:08:43,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 22:08:43,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:43,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 22:08:43,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2025-03-08 22:08:44,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 507 [2025-03-08 22:08:44,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 484 transitions, 1902 flow. Second operand has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:44,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:44,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 507 [2025-03-08 22:08:44,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:08:51,746 INFO L124 PetriNetUnfolderBase]: 7263/31072 cut-off events. [2025-03-08 22:08:51,747 INFO L125 PetriNetUnfolderBase]: For 74248/80426 co-relation queries the response was YES. [2025-03-08 22:08:51,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69606 conditions, 31072 events. 7263/31072 cut-off events. For 74248/80426 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 387320 event pairs, 2256 based on Foata normal form. 1020/29888 useless extension candidates. Maximal degree in co-relation 69543. Up to 6250 conditions per place. [2025-03-08 22:08:52,062 INFO L140 encePairwiseOnDemand]: 465/507 looper letters, 132 selfloop transitions, 121 changer transitions 0/623 dead transitions. [2025-03-08 22:08:52,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 623 transitions, 3143 flow [2025-03-08 22:08:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 22:08:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-08 22:08:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 14556 transitions. [2025-03-08 22:08:52,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8444135050469892 [2025-03-08 22:08:52,069 INFO L175 Difference]: Start difference. First operand has 439 places, 484 transitions, 1902 flow. Second operand 34 states and 14556 transitions. [2025-03-08 22:08:52,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 623 transitions, 3143 flow [2025-03-08 22:08:52,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 623 transitions, 3139 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:08:52,164 INFO L231 Difference]: Finished difference. Result has 480 places, 566 transitions, 2686 flow [2025-03-08 22:08:52,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2686, PETRI_PLACES=480, PETRI_TRANSITIONS=566} [2025-03-08 22:08:52,165 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 31 predicate places. [2025-03-08 22:08:52,165 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 566 transitions, 2686 flow [2025-03-08 22:08:52,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 425.9) internal successors, (12777), 30 states have internal predecessors, (12777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:52,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:08:52,167 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:08:52,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:08:52,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 22:08:52,371 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:08:52,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:08:52,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2010717686, now seen corresponding path program 1 times [2025-03-08 22:08:52,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:08:52,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821533608] [2025-03-08 22:08:52,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:52,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:08:52,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-08 22:08:52,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-08 22:08:52,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:52,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 22:08:53,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:08:53,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821533608] [2025-03-08 22:08:53,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821533608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:08:53,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040185478] [2025-03-08 22:08:53,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:08:53,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:08:53,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:08:53,211 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:08:53,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:08:53,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-08 22:08:53,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-08 22:08:53,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:08:53,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:08:53,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 22:08:53,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:08:53,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:08:53,493 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:08:53,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:08:53,789 INFO L349 Elim1Store]: treesize reduction 90, result has 21.7 percent of original size [2025-03-08 22:08:53,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 123 [2025-03-08 22:08:53,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2025-03-08 22:08:53,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2025-03-08 22:08:53,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 37 [2025-03-08 22:08:53,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2025-03-08 22:08:53,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 22:08:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 22:08:54,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:08:54,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 132 [2025-03-08 22:08:54,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-03-08 22:08:54,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 84 [2025-03-08 22:08:54,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2025-03-08 22:08:54,133 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:08:54,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2025-03-08 22:08:54,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:08:54,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2025-03-08 22:08:54,143 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:08:54,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 92 [2025-03-08 22:08:54,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:08:54,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-08 22:08:54,152 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:08:54,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 92 [2025-03-08 22:08:54,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:08:54,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-08 22:08:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 22:08:54,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040185478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:08:54,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:08:54,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2025-03-08 22:08:54,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038519514] [2025-03-08 22:08:54,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:08:54,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 22:08:54,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:08:54,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 22:08:54,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:08:57,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 507 [2025-03-08 22:08:57,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 566 transitions, 2686 flow. Second operand has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:08:57,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:08:57,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 507 [2025-03-08 22:08:57,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:09:05,803 INFO L124 PetriNetUnfolderBase]: 7269/34436 cut-off events. [2025-03-08 22:09:05,803 INFO L125 PetriNetUnfolderBase]: For 75520/77838 co-relation queries the response was YES. [2025-03-08 22:09:06,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85724 conditions, 34436 events. 7269/34436 cut-off events. For 75520/77838 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 436889 event pairs, 943 based on Foata normal form. 978/33778 useless extension candidates. Maximal degree in co-relation 85647. Up to 3275 conditions per place. [2025-03-08 22:09:06,158 INFO L140 encePairwiseOnDemand]: 475/507 looper letters, 167 selfloop transitions, 76 changer transitions 0/666 dead transitions. [2025-03-08 22:09:06,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 666 transitions, 3963 flow [2025-03-08 22:09:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 22:09:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-08 22:09:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 10480 transitions. [2025-03-08 22:09:06,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8268244575936884 [2025-03-08 22:09:06,163 INFO L175 Difference]: Start difference. First operand has 480 places, 566 transitions, 2686 flow. Second operand 25 states and 10480 transitions. [2025-03-08 22:09:06,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 666 transitions, 3963 flow [2025-03-08 22:09:06,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 666 transitions, 3879 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-03-08 22:09:06,367 INFO L231 Difference]: Finished difference. Result has 504 places, 580 transitions, 3005 flow [2025-03-08 22:09:06,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=507, PETRI_DIFFERENCE_MINUEND_FLOW=2598, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3005, PETRI_PLACES=504, PETRI_TRANSITIONS=580} [2025-03-08 22:09:06,368 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, 55 predicate places. [2025-03-08 22:09:06,368 INFO L471 AbstractCegarLoop]: Abstraction has has 504 places, 580 transitions, 3005 flow [2025-03-08 22:09:06,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 418.0) internal successors, (9196), 22 states have internal predecessors, (9196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:09:06,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:09:06,369 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:09:06,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:09:06,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:09:06,570 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE (and 83 more)] === [2025-03-08 22:09:06,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:09:06,571 INFO L85 PathProgramCache]: Analyzing trace with hash -418975606, now seen corresponding path program 2 times [2025-03-08 22:09:06,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:09:06,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113975482] [2025-03-08 22:09:06,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:09:06,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:09:06,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 349 statements into 2 equivalence classes. [2025-03-08 22:09:06,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 349 of 349 statements. [2025-03-08 22:09:06,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:09:06,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:09:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 22:09:07,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:09:07,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113975482] [2025-03-08 22:09:07,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113975482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:09:07,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487042674] [2025-03-08 22:09:07,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:09:07,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:09:07,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:09:07,487 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:09:07,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:09:07,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 349 statements into 2 equivalence classes. [2025-03-08 22:09:07,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 349 of 349 statements. [2025-03-08 22:09:07,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:09:07,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:09:07,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 22:09:07,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:09:07,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:09:08,091 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:09:08,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:09:08,577 INFO L349 Elim1Store]: treesize reduction 74, result has 25.3 percent of original size [2025-03-08 22:09:08,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 107 [2025-03-08 22:09:08,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2025-03-08 22:09:08,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2025-03-08 22:09:08,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2025-03-08 22:09:08,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 43 [2025-03-08 22:09:08,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 41 [2025-03-08 22:09:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 62 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 22:09:08,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:09:08,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 132 [2025-03-08 22:09:08,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2025-03-08 22:09:08,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2025-03-08 22:09:08,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2025-03-08 22:09:08,858 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:09:08,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 92 [2025-03-08 22:09:08,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:09:08,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-08 22:09:08,866 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:09:08,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2025-03-08 22:09:08,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:09:08,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2025-03-08 22:09:08,872 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:09:08,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 92 [2025-03-08 22:09:08,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:09:08,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-08 22:09:09,169 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 22:09:09,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487042674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:09:09,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:09:09,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 14] total 38 [2025-03-08 22:09:09,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669106790] [2025-03-08 22:09:09,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:09:09,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 22:09:09,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:09:09,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 22:09:09,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 22:09:15,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 507 [2025-03-08 22:09:15,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 580 transitions, 3005 flow. Second operand has 39 states, 39 states have (on average 385.28205128205127) internal successors, (15026), 39 states have internal predecessors, (15026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:09:15,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:09:15,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 507 [2025-03-08 22:09:15,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand