./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i -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 b00ba58edbbf9092a3bbde4865c9e14ef534546a29b4ba514bb7ebaf27fc72c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:36:01,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:36:01,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:36:01,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:36:01,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:36:01,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:36:01,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:36:01,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:36:01,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:36:01,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:36:01,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:36:01,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:36:01,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:36:01,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:36:01,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:36:01,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:36:01,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:36:01,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:36:01,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:36:01,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:36:01,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:36:01,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:36:01,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:36:01,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:36:01,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:36:01,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:36:01,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:36:01,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:36:01,523 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 -> b00ba58edbbf9092a3bbde4865c9e14ef534546a29b4ba514bb7ebaf27fc72c0 [2025-03-14 01:36:01,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:36:01,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:36:01,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:36:01,748 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:36:01,748 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:36:01,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i [2025-03-14 01:36:02,939 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a252978d/26d1a084f5154e2a9ed6c1c073e99462/FLAG95b44a80d [2025-03-14 01:36:03,224 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:36:03,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i [2025-03-14 01:36:03,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a252978d/26d1a084f5154e2a9ed6c1c073e99462/FLAG95b44a80d [2025-03-14 01:36:03,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a252978d/26d1a084f5154e2a9ed6c1c073e99462 [2025-03-14 01:36:03,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:36:03,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:36:03,257 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:36:03,257 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:36:03,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:36:03,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:36:03" (1/1) ... [2025-03-14 01:36:03,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60592373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03, skipping insertion in model container [2025-03-14 01:36:03,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:36:03" (1/1) ... [2025-03-14 01:36:03,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:36:03,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:36:03,610 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:36:03,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:36:03,698 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:36:03,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03 WrapperNode [2025-03-14 01:36:03,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:36:03,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:36:03,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:36:03,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:36:03,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03" (1/1) ... [2025-03-14 01:36:03,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03" (1/1) ... [2025-03-14 01:36:03,745 INFO L138 Inliner]: procedures = 368, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 207 [2025-03-14 01:36:03,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:36:03,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:36:03,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:36:03,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:36:03,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03" (1/1) ... [2025-03-14 01:36:03,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03" (1/1) ... [2025-03-14 01:36:03,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03" (1/1) ... [2025-03-14 01:36:03,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03" (1/1) ... [2025-03-14 01:36:03,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03" (1/1) ... [2025-03-14 01:36:03,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03" (1/1) ... [2025-03-14 01:36:03,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03" (1/1) ... [2025-03-14 01:36:03,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03" (1/1) ... [2025-03-14 01:36:03,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:36:03,779 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:36:03,783 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:36:03,783 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:36:03,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03" (1/1) ... [2025-03-14 01:36:03,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:36:03,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:36:03,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:36:03,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:36:03,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:36:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:36:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:36:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:36:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:36:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:36:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:36:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:36:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:36:03,828 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:36:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:36:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:36:03,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:36:03,829 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:36:03,935 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:36:03,937 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:36:04,331 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:36:04,332 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:36:04,332 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:36:04,356 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:36:04,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:36:04 BoogieIcfgContainer [2025-03-14 01:36:04,358 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:36:04,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:36:04,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:36:04,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:36:04,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:36:03" (1/3) ... [2025-03-14 01:36:04,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb16c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:36:04, skipping insertion in model container [2025-03-14 01:36:04,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:36:03" (2/3) ... [2025-03-14 01:36:04,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb16c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:36:04, skipping insertion in model container [2025-03-14 01:36:04,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:36:04" (3/3) ... [2025-03-14 01:36:04,367 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_05-ptra_rc.i [2025-03-14 01:36:04,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:36:04,379 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_05-ptra_rc.i that has 2 procedures, 241 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-14 01:36:04,381 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:36:04,464 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:36:04,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 240 transitions, 484 flow [2025-03-14 01:36:04,586 INFO L124 PetriNetUnfolderBase]: 0/239 cut-off events. [2025-03-14 01:36:04,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:04,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 239 events. 0/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 115 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-14 01:36:04,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 240 transitions, 484 flow [2025-03-14 01:36:04,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 239 transitions, 481 flow [2025-03-14 01:36:04,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:36:04,622 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;@3dfdc7de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:36:04,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-14 01:36:04,630 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:36:04,631 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-03-14 01:36:04,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:04,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:04,632 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] [2025-03-14 01:36:04,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:04,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:04,636 INFO L85 PathProgramCache]: Analyzing trace with hash 776524979, now seen corresponding path program 1 times [2025-03-14 01:36:04,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:04,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961633316] [2025-03-14 01:36:04,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:04,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-14 01:36:04,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-14 01:36:04,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:04,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:05,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:05,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961633316] [2025-03-14 01:36:05,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961633316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:05,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:05,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:05,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166963192] [2025-03-14 01:36:05,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:05,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:05,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:05,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:05,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:05,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 240 [2025-03-14 01:36:05,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 239 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:05,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:05,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 240 [2025-03-14 01:36:05,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:05,979 INFO L124 PetriNetUnfolderBase]: 220/1071 cut-off events. [2025-03-14 01:36:05,980 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:36:05,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 1071 events. 220/1071 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5552 event pairs, 220 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1410. Up to 493 conditions per place. [2025-03-14 01:36:05,991 INFO L140 encePairwiseOnDemand]: 222/240 looper letters, 52 selfloop transitions, 15 changer transitions 0/236 dead transitions. [2025-03-14 01:36:05,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 236 transitions, 609 flow [2025-03-14 01:36:05,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1090 transitions. [2025-03-14 01:36:06,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2025-03-14 01:36:06,011 INFO L175 Difference]: Start difference. First operand has 243 places, 239 transitions, 481 flow. Second operand 6 states and 1090 transitions. [2025-03-14 01:36:06,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 236 transitions, 609 flow [2025-03-14 01:36:06,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 236 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:36:06,022 INFO L231 Difference]: Finished difference. Result has 244 places, 236 transitions, 504 flow [2025-03-14 01:36:06,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=244, PETRI_TRANSITIONS=236} [2025-03-14 01:36:06,027 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 1 predicate places. [2025-03-14 01:36:06,027 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 236 transitions, 504 flow [2025-03-14 01:36:06,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:06,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:06,028 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] [2025-03-14 01:36:06,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:36:06,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:06,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:06,029 INFO L85 PathProgramCache]: Analyzing trace with hash 861760560, now seen corresponding path program 1 times [2025-03-14 01:36:06,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:06,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467671187] [2025-03-14 01:36:06,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:06,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:06,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-14 01:36:06,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-14 01:36:06,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:06,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:06,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:06,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:06,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467671187] [2025-03-14 01:36:06,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467671187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:06,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:06,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:06,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489113332] [2025-03-14 01:36:06,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:06,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:06,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:06,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:06,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:06,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 240 [2025-03-14 01:36:06,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 236 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:06,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:06,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 240 [2025-03-14 01:36:06,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:06,774 INFO L124 PetriNetUnfolderBase]: 220/1068 cut-off events. [2025-03-14 01:36:06,774 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:06,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1595 conditions, 1068 events. 220/1068 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5525 event pairs, 220 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1435. Up to 493 conditions per place. [2025-03-14 01:36:06,781 INFO L140 encePairwiseOnDemand]: 222/240 looper letters, 52 selfloop transitions, 15 changer transitions 0/233 dead transitions. [2025-03-14 01:36:06,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 233 transitions, 632 flow [2025-03-14 01:36:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1090 transitions. [2025-03-14 01:36:06,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2025-03-14 01:36:06,784 INFO L175 Difference]: Start difference. First operand has 244 places, 236 transitions, 504 flow. Second operand 6 states and 1090 transitions. [2025-03-14 01:36:06,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 233 transitions, 632 flow [2025-03-14 01:36:06,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 233 transitions, 602 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:06,790 INFO L231 Difference]: Finished difference. Result has 241 places, 233 transitions, 498 flow [2025-03-14 01:36:06,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=241, PETRI_TRANSITIONS=233} [2025-03-14 01:36:06,793 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -2 predicate places. [2025-03-14 01:36:06,793 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 233 transitions, 498 flow [2025-03-14 01:36:06,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:06,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:06,794 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] [2025-03-14 01:36:06,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:36:06,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:06,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:06,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1272425895, now seen corresponding path program 1 times [2025-03-14 01:36:06,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:06,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574391278] [2025-03-14 01:36:06,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:06,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:06,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-14 01:36:06,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-14 01:36:06,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:06,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:06,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:06,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574391278] [2025-03-14 01:36:06,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574391278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:06,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:06,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:36:06,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099758884] [2025-03-14 01:36:06,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:06,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:36:06,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:06,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:36:06,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:36:06,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 240 [2025-03-14 01:36:06,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 233 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:06,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:06,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 240 [2025-03-14 01:36:06,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:06,901 INFO L124 PetriNetUnfolderBase]: 16/368 cut-off events. [2025-03-14 01:36:06,901 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:06,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 368 events. 16/368 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 796 event pairs, 16 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 288. Up to 47 conditions per place. [2025-03-14 01:36:06,902 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 14 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2025-03-14 01:36:06,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 232 transitions, 528 flow [2025-03-14 01:36:06,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:36:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:36:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2025-03-14 01:36:06,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527777777777777 [2025-03-14 01:36:06,905 INFO L175 Difference]: Start difference. First operand has 241 places, 233 transitions, 498 flow. Second operand 3 states and 686 transitions. [2025-03-14 01:36:06,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 232 transitions, 528 flow [2025-03-14 01:36:06,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 232 transitions, 498 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:06,909 INFO L231 Difference]: Finished difference. Result has 237 places, 232 transitions, 470 flow [2025-03-14 01:36:06,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=237, PETRI_TRANSITIONS=232} [2025-03-14 01:36:06,910 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -6 predicate places. [2025-03-14 01:36:06,911 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 232 transitions, 470 flow [2025-03-14 01:36:06,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:06,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:06,911 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] [2025-03-14 01:36:06,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:36:06,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:06,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash -380904852, now seen corresponding path program 1 times [2025-03-14 01:36:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:06,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094923532] [2025-03-14 01:36:06,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:06,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:06,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:36:06,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:36:06,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:06,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:06,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:06,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094923532] [2025-03-14 01:36:06,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094923532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:06,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:06,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:36:06,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12149517] [2025-03-14 01:36:06,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:06,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:36:06,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:06,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:36:06,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:36:06,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 240 [2025-03-14 01:36:06,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 232 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:06,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:06,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 240 [2025-03-14 01:36:06,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:07,026 INFO L124 PetriNetUnfolderBase]: 24/445 cut-off events. [2025-03-14 01:36:07,027 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:36:07,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 445 events. 24/445 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1221 event pairs, 24 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 455. Up to 63 conditions per place. [2025-03-14 01:36:07,029 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 15 selfloop transitions, 1 changer transitions 0/227 dead transitions. [2025-03-14 01:36:07,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 227 transitions, 492 flow [2025-03-14 01:36:07,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:36:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:36:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 678 transitions. [2025-03-14 01:36:07,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2025-03-14 01:36:07,032 INFO L175 Difference]: Start difference. First operand has 237 places, 232 transitions, 470 flow. Second operand 3 states and 678 transitions. [2025-03-14 01:36:07,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 227 transitions, 492 flow [2025-03-14 01:36:07,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 227 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:36:07,036 INFO L231 Difference]: Finished difference. Result has 232 places, 227 transitions, 458 flow [2025-03-14 01:36:07,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=232, PETRI_TRANSITIONS=227} [2025-03-14 01:36:07,037 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -11 predicate places. [2025-03-14 01:36:07,037 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 227 transitions, 458 flow [2025-03-14 01:36:07,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:07,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:07,038 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] [2025-03-14 01:36:07,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:36:07,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:07,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:07,039 INFO L85 PathProgramCache]: Analyzing trace with hash -297402018, now seen corresponding path program 1 times [2025-03-14 01:36:07,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:07,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684094111] [2025-03-14 01:36:07,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:07,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:07,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-14 01:36:07,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-14 01:36:07,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:07,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:07,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:07,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684094111] [2025-03-14 01:36:07,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684094111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:07,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:07,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:07,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638321045] [2025-03-14 01:36:07,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:07,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:07,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:07,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:07,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:07,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 240 [2025-03-14 01:36:07,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 227 transitions, 458 flow. Second operand has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:07,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:07,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 240 [2025-03-14 01:36:07,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:07,805 INFO L124 PetriNetUnfolderBase]: 288/1210 cut-off events. [2025-03-14 01:36:07,805 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:07,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1863 conditions, 1210 events. 288/1210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6469 event pairs, 288 based on Foata normal form. 0/1152 useless extension candidates. Maximal degree in co-relation 1792. Up to 643 conditions per place. [2025-03-14 01:36:07,810 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 66 selfloop transitions, 5 changer transitions 0/226 dead transitions. [2025-03-14 01:36:07,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 226 transitions, 598 flow [2025-03-14 01:36:07,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1080 transitions. [2025-03-14 01:36:07,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-14 01:36:07,813 INFO L175 Difference]: Start difference. First operand has 232 places, 227 transitions, 458 flow. Second operand 6 states and 1080 transitions. [2025-03-14 01:36:07,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 226 transitions, 598 flow [2025-03-14 01:36:07,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 226 transitions, 597 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:36:07,818 INFO L231 Difference]: Finished difference. Result has 235 places, 226 transitions, 465 flow [2025-03-14 01:36:07,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=235, PETRI_TRANSITIONS=226} [2025-03-14 01:36:07,820 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -8 predicate places. [2025-03-14 01:36:07,821 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 226 transitions, 465 flow [2025-03-14 01:36:07,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:07,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:07,821 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] [2025-03-14 01:36:07,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:36:07,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:07,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:07,822 INFO L85 PathProgramCache]: Analyzing trace with hash -773890522, now seen corresponding path program 1 times [2025-03-14 01:36:07,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:07,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683061815] [2025-03-14 01:36:07,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:07,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-14 01:36:07,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-14 01:36:07,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:07,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:07,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:07,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683061815] [2025-03-14 01:36:07,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683061815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:07,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:07,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:36:07,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773469475] [2025-03-14 01:36:07,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:07,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:36:07,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:07,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:36:07,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:36:07,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 240 [2025-03-14 01:36:07,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 226 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:07,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:07,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 240 [2025-03-14 01:36:07,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:07,923 INFO L124 PetriNetUnfolderBase]: 6/289 cut-off events. [2025-03-14 01:36:07,923 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:07,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 289 events. 6/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 404 event pairs, 6 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 263. Up to 23 conditions per place. [2025-03-14 01:36:07,924 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 10 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2025-03-14 01:36:07,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 225 transitions, 487 flow [2025-03-14 01:36:07,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:36:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:36:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2025-03-14 01:36:07,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9638888888888889 [2025-03-14 01:36:07,926 INFO L175 Difference]: Start difference. First operand has 235 places, 226 transitions, 465 flow. Second operand 3 states and 694 transitions. [2025-03-14 01:36:07,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 225 transitions, 487 flow [2025-03-14 01:36:07,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 225 transitions, 477 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:07,929 INFO L231 Difference]: Finished difference. Result has 231 places, 225 transitions, 457 flow [2025-03-14 01:36:07,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=231, PETRI_TRANSITIONS=225} [2025-03-14 01:36:07,929 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -12 predicate places. [2025-03-14 01:36:07,929 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 225 transitions, 457 flow [2025-03-14 01:36:07,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:07,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:07,930 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] [2025-03-14 01:36:07,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:36:07,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:07,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:07,931 INFO L85 PathProgramCache]: Analyzing trace with hash -104150938, now seen corresponding path program 1 times [2025-03-14 01:36:07,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:07,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007007314] [2025-03-14 01:36:07,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:07,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:07,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:36:07,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:36:07,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:07,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:36:07,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:07,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007007314] [2025-03-14 01:36:07,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007007314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:07,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:07,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:36:07,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009612454] [2025-03-14 01:36:07,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:07,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:36:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:07,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:36:07,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:36:07,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 240 [2025-03-14 01:36:07,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 225 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:07,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:07,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 240 [2025-03-14 01:36:07,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:08,026 INFO L124 PetriNetUnfolderBase]: 4/286 cut-off events. [2025-03-14 01:36:08,026 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:36:08,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 286 events. 4/286 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 268 event pairs, 4 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 250. Up to 15 conditions per place. [2025-03-14 01:36:08,027 INFO L140 encePairwiseOnDemand]: 238/240 looper letters, 7 selfloop transitions, 1 changer transitions 0/224 dead transitions. [2025-03-14 01:36:08,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 224 transitions, 471 flow [2025-03-14 01:36:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:36:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:36:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2025-03-14 01:36:08,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.975 [2025-03-14 01:36:08,028 INFO L175 Difference]: Start difference. First operand has 231 places, 225 transitions, 457 flow. Second operand 3 states and 702 transitions. [2025-03-14 01:36:08,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 224 transitions, 471 flow [2025-03-14 01:36:08,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 224 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:36:08,031 INFO L231 Difference]: Finished difference. Result has 230 places, 224 transitions, 453 flow [2025-03-14 01:36:08,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=230, PETRI_TRANSITIONS=224} [2025-03-14 01:36:08,031 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -13 predicate places. [2025-03-14 01:36:08,031 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 224 transitions, 453 flow [2025-03-14 01:36:08,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:08,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:08,032 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] [2025-03-14 01:36:08,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:36:08,032 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:08,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash -81037358, now seen corresponding path program 1 times [2025-03-14 01:36:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:08,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424908978] [2025-03-14 01:36:08,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:08,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:08,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-14 01:36:08,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-14 01:36:08,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:08,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:08,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:08,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424908978] [2025-03-14 01:36:08,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424908978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:08,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:08,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:08,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632019131] [2025-03-14 01:36:08,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:08,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:08,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:08,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:08,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:08,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 240 [2025-03-14 01:36:08,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 224 transitions, 453 flow. Second operand has 6 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:08,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:08,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 240 [2025-03-14 01:36:08,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:09,230 INFO L124 PetriNetUnfolderBase]: 316/1516 cut-off events. [2025-03-14 01:36:09,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:09,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2256 conditions, 1516 events. 316/1516 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9076 event pairs, 32 based on Foata normal form. 0/1425 useless extension candidates. Maximal degree in co-relation 2186. Up to 388 conditions per place. [2025-03-14 01:36:09,239 INFO L140 encePairwiseOnDemand]: 212/240 looper letters, 107 selfloop transitions, 70 changer transitions 0/336 dead transitions. [2025-03-14 01:36:09,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 336 transitions, 1031 flow [2025-03-14 01:36:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1229 transitions. [2025-03-14 01:36:09,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8534722222222222 [2025-03-14 01:36:09,243 INFO L175 Difference]: Start difference. First operand has 230 places, 224 transitions, 453 flow. Second operand 6 states and 1229 transitions. [2025-03-14 01:36:09,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 336 transitions, 1031 flow [2025-03-14 01:36:09,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 336 transitions, 1030 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:36:09,252 INFO L231 Difference]: Finished difference. Result has 238 places, 294 transitions, 930 flow [2025-03-14 01:36:09,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=930, PETRI_PLACES=238, PETRI_TRANSITIONS=294} [2025-03-14 01:36:09,255 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -5 predicate places. [2025-03-14 01:36:09,255 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 294 transitions, 930 flow [2025-03-14 01:36:09,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:09,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:09,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:09,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:36:09,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:09,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:09,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2111327143, now seen corresponding path program 1 times [2025-03-14 01:36:09,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:09,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086867416] [2025-03-14 01:36:09,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:09,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:09,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-14 01:36:09,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-14 01:36:09,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:09,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:09,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:09,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086867416] [2025-03-14 01:36:09,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086867416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:09,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:09,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:09,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960686737] [2025-03-14 01:36:09,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:09,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:09,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:09,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:09,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:09,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 240 [2025-03-14 01:36:09,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 294 transitions, 930 flow. Second operand has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:09,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:09,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 240 [2025-03-14 01:36:09,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:10,253 INFO L124 PetriNetUnfolderBase]: 588/2293 cut-off events. [2025-03-14 01:36:10,253 INFO L125 PetriNetUnfolderBase]: For 602/608 co-relation queries the response was YES. [2025-03-14 01:36:10,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4691 conditions, 2293 events. 588/2293 cut-off events. For 602/608 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 15234 event pairs, 222 based on Foata normal form. 0/2182 useless extension candidates. Maximal degree in co-relation 4619. Up to 1090 conditions per place. [2025-03-14 01:36:10,263 INFO L140 encePairwiseOnDemand]: 225/240 looper letters, 114 selfloop transitions, 48 changer transitions 0/345 dead transitions. [2025-03-14 01:36:10,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 345 transitions, 1426 flow [2025-03-14 01:36:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1166 transitions. [2025-03-14 01:36:10,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-03-14 01:36:10,266 INFO L175 Difference]: Start difference. First operand has 238 places, 294 transitions, 930 flow. Second operand 6 states and 1166 transitions. [2025-03-14 01:36:10,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 345 transitions, 1426 flow [2025-03-14 01:36:10,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 345 transitions, 1426 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:10,276 INFO L231 Difference]: Finished difference. Result has 248 places, 337 transitions, 1318 flow [2025-03-14 01:36:10,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1318, PETRI_PLACES=248, PETRI_TRANSITIONS=337} [2025-03-14 01:36:10,277 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 5 predicate places. [2025-03-14 01:36:10,277 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 337 transitions, 1318 flow [2025-03-14 01:36:10,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:10,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:10,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:10,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:36:10,278 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:10,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:10,279 INFO L85 PathProgramCache]: Analyzing trace with hash 418759068, now seen corresponding path program 1 times [2025-03-14 01:36:10,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:10,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214203389] [2025-03-14 01:36:10,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:10,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:10,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-14 01:36:10,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-14 01:36:10,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:10,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:10,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:10,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214203389] [2025-03-14 01:36:10,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214203389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:10,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:10,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:10,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422920577] [2025-03-14 01:36:10,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:10,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:10,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:10,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:10,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 240 [2025-03-14 01:36:10,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 337 transitions, 1318 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:10,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:10,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 240 [2025-03-14 01:36:10,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:11,417 INFO L124 PetriNetUnfolderBase]: 737/2863 cut-off events. [2025-03-14 01:36:11,417 INFO L125 PetriNetUnfolderBase]: For 1661/1714 co-relation queries the response was YES. [2025-03-14 01:36:11,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6646 conditions, 2863 events. 737/2863 cut-off events. For 1661/1714 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 20462 event pairs, 92 based on Foata normal form. 0/2768 useless extension candidates. Maximal degree in co-relation 6567. Up to 1028 conditions per place. [2025-03-14 01:36:11,432 INFO L140 encePairwiseOnDemand]: 217/240 looper letters, 136 selfloop transitions, 136 changer transitions 4/477 dead transitions. [2025-03-14 01:36:11,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 477 transitions, 2626 flow [2025-03-14 01:36:11,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1224 transitions. [2025-03-14 01:36:11,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-03-14 01:36:11,435 INFO L175 Difference]: Start difference. First operand has 248 places, 337 transitions, 1318 flow. Second operand 6 states and 1224 transitions. [2025-03-14 01:36:11,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 477 transitions, 2626 flow [2025-03-14 01:36:11,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 477 transitions, 2608 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:11,448 INFO L231 Difference]: Finished difference. Result has 258 places, 468 transitions, 2666 flow [2025-03-14 01:36:11,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2666, PETRI_PLACES=258, PETRI_TRANSITIONS=468} [2025-03-14 01:36:11,449 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 15 predicate places. [2025-03-14 01:36:11,449 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 468 transitions, 2666 flow [2025-03-14 01:36:11,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:11,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:11,450 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] [2025-03-14 01:36:11,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:36:11,450 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:11,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:11,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1130704427, now seen corresponding path program 1 times [2025-03-14 01:36:11,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:11,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270483501] [2025-03-14 01:36:11,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:11,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:11,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-14 01:36:11,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-14 01:36:11,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:11,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:11,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:11,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270483501] [2025-03-14 01:36:11,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270483501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:11,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:11,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:11,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571818331] [2025-03-14 01:36:11,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:11,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:11,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:11,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:11,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:12,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 240 [2025-03-14 01:36:12,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 468 transitions, 2666 flow. Second operand has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:12,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:12,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 240 [2025-03-14 01:36:12,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:12,517 INFO L124 PetriNetUnfolderBase]: 968/3386 cut-off events. [2025-03-14 01:36:12,517 INFO L125 PetriNetUnfolderBase]: For 3817/3888 co-relation queries the response was YES. [2025-03-14 01:36:12,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9627 conditions, 3386 events. 968/3386 cut-off events. For 3817/3888 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 24352 event pairs, 207 based on Foata normal form. 0/3298 useless extension candidates. Maximal degree in co-relation 9545. Up to 1565 conditions per place. [2025-03-14 01:36:12,535 INFO L140 encePairwiseOnDemand]: 225/240 looper letters, 239 selfloop transitions, 62 changer transitions 0/525 dead transitions. [2025-03-14 01:36:12,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 525 transitions, 3610 flow [2025-03-14 01:36:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1166 transitions. [2025-03-14 01:36:12,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-03-14 01:36:12,538 INFO L175 Difference]: Start difference. First operand has 258 places, 468 transitions, 2666 flow. Second operand 6 states and 1166 transitions. [2025-03-14 01:36:12,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 525 transitions, 3610 flow [2025-03-14 01:36:12,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 525 transitions, 3574 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:12,558 INFO L231 Difference]: Finished difference. Result has 268 places, 517 transitions, 3256 flow [2025-03-14 01:36:12,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3256, PETRI_PLACES=268, PETRI_TRANSITIONS=517} [2025-03-14 01:36:12,560 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 25 predicate places. [2025-03-14 01:36:12,560 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 517 transitions, 3256 flow [2025-03-14 01:36:12,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:12,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:12,561 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] [2025-03-14 01:36:12,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:36:12,561 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:12,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:12,562 INFO L85 PathProgramCache]: Analyzing trace with hash 493463353, now seen corresponding path program 1 times [2025-03-14 01:36:12,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:12,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966051900] [2025-03-14 01:36:12,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:12,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-14 01:36:12,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-14 01:36:12,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:12,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:13,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:13,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966051900] [2025-03-14 01:36:13,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966051900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:13,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:13,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:36:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634724807] [2025-03-14 01:36:13,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:13,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:36:13,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:13,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:36:13,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:36:14,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2025-03-14 01:36:14,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 517 transitions, 3256 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:14,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:14,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2025-03-14 01:36:14,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:15,932 INFO L124 PetriNetUnfolderBase]: 1512/5169 cut-off events. [2025-03-14 01:36:15,933 INFO L125 PetriNetUnfolderBase]: For 8719/8828 co-relation queries the response was YES. [2025-03-14 01:36:15,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16497 conditions, 5169 events. 1512/5169 cut-off events. For 8719/8828 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 42170 event pairs, 114 based on Foata normal form. 51/5124 useless extension candidates. Maximal degree in co-relation 16405. Up to 998 conditions per place. [2025-03-14 01:36:15,971 INFO L140 encePairwiseOnDemand]: 211/240 looper letters, 478 selfloop transitions, 172 changer transitions 0/843 dead transitions. [2025-03-14 01:36:15,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 843 transitions, 7206 flow [2025-03-14 01:36:15,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:36:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:36:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3314 transitions. [2025-03-14 01:36:15,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7267543859649123 [2025-03-14 01:36:15,977 INFO L175 Difference]: Start difference. First operand has 268 places, 517 transitions, 3256 flow. Second operand 19 states and 3314 transitions. [2025-03-14 01:36:15,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 843 transitions, 7206 flow [2025-03-14 01:36:16,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 843 transitions, 7024 flow, removed 91 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:16,018 INFO L231 Difference]: Finished difference. Result has 295 places, 640 transitions, 4992 flow [2025-03-14 01:36:16,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=3144, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4992, PETRI_PLACES=295, PETRI_TRANSITIONS=640} [2025-03-14 01:36:16,019 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 52 predicate places. [2025-03-14 01:36:16,019 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 640 transitions, 4992 flow [2025-03-14 01:36:16,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:16,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:16,020 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] [2025-03-14 01:36:16,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:36:16,020 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:16,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:16,021 INFO L85 PathProgramCache]: Analyzing trace with hash -156491665, now seen corresponding path program 1 times [2025-03-14 01:36:16,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:16,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184157517] [2025-03-14 01:36:16,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:16,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:16,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-14 01:36:16,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-14 01:36:16,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:16,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:16,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:16,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184157517] [2025-03-14 01:36:16,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184157517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:16,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:16,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:36:16,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668573954] [2025-03-14 01:36:16,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:16,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:36:16,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:16,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:36:16,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:36:17,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 240 [2025-03-14 01:36:17,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 640 transitions, 4992 flow. Second operand has 13 states, 13 states have (on average 168.69230769230768) internal successors, (2193), 13 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:17,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:17,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 240 [2025-03-14 01:36:17,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:18,794 INFO L124 PetriNetUnfolderBase]: 1698/5530 cut-off events. [2025-03-14 01:36:18,794 INFO L125 PetriNetUnfolderBase]: For 12660/12854 co-relation queries the response was YES. [2025-03-14 01:36:18,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19201 conditions, 5530 events. 1698/5530 cut-off events. For 12660/12854 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 44726 event pairs, 242 based on Foata normal form. 30/5463 useless extension candidates. Maximal degree in co-relation 19096. Up to 1283 conditions per place. [2025-03-14 01:36:18,828 INFO L140 encePairwiseOnDemand]: 219/240 looper letters, 408 selfloop transitions, 101 changer transitions 0/770 dead transitions. [2025-03-14 01:36:18,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 770 transitions, 7164 flow [2025-03-14 01:36:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 01:36:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 01:36:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2490 transitions. [2025-03-14 01:36:18,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7410714285714286 [2025-03-14 01:36:18,832 INFO L175 Difference]: Start difference. First operand has 295 places, 640 transitions, 4992 flow. Second operand 14 states and 2490 transitions. [2025-03-14 01:36:18,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 770 transitions, 7164 flow [2025-03-14 01:36:18,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 770 transitions, 7123 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:18,891 INFO L231 Difference]: Finished difference. Result has 308 places, 655 transitions, 5501 flow [2025-03-14 01:36:18,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=4951, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5501, PETRI_PLACES=308, PETRI_TRANSITIONS=655} [2025-03-14 01:36:18,892 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 65 predicate places. [2025-03-14 01:36:18,892 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 655 transitions, 5501 flow [2025-03-14 01:36:18,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 168.69230769230768) internal successors, (2193), 13 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:18,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:18,893 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] [2025-03-14 01:36:18,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:36:18,893 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:18,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:18,894 INFO L85 PathProgramCache]: Analyzing trace with hash -176694485, now seen corresponding path program 2 times [2025-03-14 01:36:18,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:18,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763778424] [2025-03-14 01:36:18,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:36:18,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:18,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-03-14 01:36:18,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 149 of 151 statements. [2025-03-14 01:36:18,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:36:18,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:19,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763778424] [2025-03-14 01:36:19,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763778424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:19,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:19,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 01:36:19,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966907278] [2025-03-14 01:36:19,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:19,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 01:36:19,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:19,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 01:36:19,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:36:20,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2025-03-14 01:36:20,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 655 transitions, 5501 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:20,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:20,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2025-03-14 01:36:20,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:22,103 INFO L124 PetriNetUnfolderBase]: 2124/7126 cut-off events. [2025-03-14 01:36:22,103 INFO L125 PetriNetUnfolderBase]: For 21531/21769 co-relation queries the response was YES. [2025-03-14 01:36:22,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26285 conditions, 7126 events. 2124/7126 cut-off events. For 21531/21769 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 64752 event pairs, 171 based on Foata normal form. 70/7082 useless extension candidates. Maximal degree in co-relation 26174. Up to 1624 conditions per place. [2025-03-14 01:36:22,151 INFO L140 encePairwiseOnDemand]: 203/240 looper letters, 447 selfloop transitions, 256 changer transitions 4/906 dead transitions. [2025-03-14 01:36:22,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 906 transitions, 9175 flow [2025-03-14 01:36:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 01:36:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 01:36:22,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2547 transitions. [2025-03-14 01:36:22,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7580357142857143 [2025-03-14 01:36:22,154 INFO L175 Difference]: Start difference. First operand has 308 places, 655 transitions, 5501 flow. Second operand 14 states and 2547 transitions. [2025-03-14 01:36:22,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 906 transitions, 9175 flow [2025-03-14 01:36:22,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 906 transitions, 9063 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-14 01:36:22,239 INFO L231 Difference]: Finished difference. Result has 323 places, 734 transitions, 7681 flow [2025-03-14 01:36:22,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=5463, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7681, PETRI_PLACES=323, PETRI_TRANSITIONS=734} [2025-03-14 01:36:22,241 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 80 predicate places. [2025-03-14 01:36:22,241 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 734 transitions, 7681 flow [2025-03-14 01:36:22,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:22,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:22,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:22,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:36:22,242 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:22,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash -348417879, now seen corresponding path program 3 times [2025-03-14 01:36:22,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:22,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12136870] [2025-03-14 01:36:22,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:36:22,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:22,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 151 statements into 2 equivalence classes. [2025-03-14 01:36:22,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-03-14 01:36:22,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:36:22,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:22,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:22,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12136870] [2025-03-14 01:36:22,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12136870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:36:22,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656217603] [2025-03-14 01:36:22,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:36:22,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:36:22,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:36:22,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:36:22,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 01:36:22,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 151 statements into 2 equivalence classes. [2025-03-14 01:36:23,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-03-14 01:36:23,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 01:36:23,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:23,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-14 01:36:23,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:36:23,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 01:36:23,998 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-14 01:36:23,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-14 01:36:24,067 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-14 01:36:24,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-14 01:36:24,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-14 01:36:24,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-14 01:36:24,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:24,118 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 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-14 01:36:24,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:24,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-14 01:36:24,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-14 01:36:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:24,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:36:26,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-03-14 01:36:26,127 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 6)) (.cse2 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) .cse2) 0))))) is different from false [2025-03-14 01:36:27,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:27,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2025-03-14 01:36:27,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:27,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2025-03-14 01:36:27,998 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-14 01:36:27,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-14 01:36:28,002 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-14 01:36:28,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-14 01:36:28,007 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-14 01:36:28,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-14 01:36:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:28,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656217603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:36:28,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:36:28,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2025-03-14 01:36:28,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125733100] [2025-03-14 01:36:28,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:36:28,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 01:36:28,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:28,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 01:36:28,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=204, Unknown=23, NotChecked=62, Total=342 [2025-03-14 01:36:28,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 240 [2025-03-14 01:36:28,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 734 transitions, 7681 flow. Second operand has 19 states, 19 states have (on average 129.3684210526316) internal successors, (2458), 19 states have internal predecessors, (2458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:28,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:28,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 240 [2025-03-14 01:36:28,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:31,411 INFO L124 PetriNetUnfolderBase]: 3578/9995 cut-off events. [2025-03-14 01:36:31,412 INFO L125 PetriNetUnfolderBase]: For 40313/40708 co-relation queries the response was YES. [2025-03-14 01:36:31,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40731 conditions, 9995 events. 3578/9995 cut-off events. For 40313/40708 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 88048 event pairs, 706 based on Foata normal form. 56/9838 useless extension candidates. Maximal degree in co-relation 40604. Up to 3182 conditions per place. [2025-03-14 01:36:31,481 INFO L140 encePairwiseOnDemand]: 219/240 looper letters, 748 selfloop transitions, 153 changer transitions 0/1019 dead transitions. [2025-03-14 01:36:31,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 1019 transitions, 11995 flow [2025-03-14 01:36:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 01:36:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 01:36:31,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2644 transitions. [2025-03-14 01:36:31,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5798245614035088 [2025-03-14 01:36:31,486 INFO L175 Difference]: Start difference. First operand has 323 places, 734 transitions, 7681 flow. Second operand 19 states and 2644 transitions. [2025-03-14 01:36:31,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 1019 transitions, 11995 flow [2025-03-14 01:36:31,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 1019 transitions, 11990 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 01:36:31,727 INFO L231 Difference]: Finished difference. Result has 347 places, 791 transitions, 8886 flow [2025-03-14 01:36:31,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=7676, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=8886, PETRI_PLACES=347, PETRI_TRANSITIONS=791} [2025-03-14 01:36:31,728 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 104 predicate places. [2025-03-14 01:36:31,728 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 791 transitions, 8886 flow [2025-03-14 01:36:31,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 129.3684210526316) internal successors, (2458), 19 states have internal predecessors, (2458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:31,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:31,729 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] [2025-03-14 01:36:31,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 01:36:31,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-14 01:36:31,930 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-14 01:36:31,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:31,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1622948007, now seen corresponding path program 4 times [2025-03-14 01:36:31,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:31,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059278007] [2025-03-14 01:36:31,931 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:36:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:31,951 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 151 statements into 2 equivalence classes. [2025-03-14 01:36:31,964 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 145 of 151 statements. [2025-03-14 01:36:31,965 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:36:31,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:32,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:32,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059278007] [2025-03-14 01:36:32,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059278007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:36:32,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132744821] [2025-03-14 01:36:32,531 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:36:32,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:36:32,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:36:32,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:36:32,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 01:36:32,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 151 statements into 2 equivalence classes. [2025-03-14 01:36:32,702 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 145 of 151 statements. [2025-03-14 01:36:32,703 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:36:32,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:32,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-14 01:36:32,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:36:32,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-14 01:36:32,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-14 01:36:32,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:32,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-14 01:36:32,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:32,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-14 01:36:33,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:36:33,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:36:33,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:36:33,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 01:36:33,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:33,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 49 [2025-03-14 01:36:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:33,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:36:53,124 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:36:53,127 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:36:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:53,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132744821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:36:53,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:36:53,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-14 01:36:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67647132] [2025-03-14 01:36:53,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:36:53,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-14 01:36:53,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:53,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-14 01:36:53,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=973, Unknown=4, NotChecked=0, Total=1122 [2025-03-14 01:36:57,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:02,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:05,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:07,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:11,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:13,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:18,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:23,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:27,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:31,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-14 01:37:36,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]