./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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/06-symbeq_04-funloop_hard1.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 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:15:45,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:15:45,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:15:45,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:15:45,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:15:45,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:15:45,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:15:45,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:15:45,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:15:45,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:15:45,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:15:45,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:15:45,612 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:15:45,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:15:45,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:15:45,612 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:15:45,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:15:45,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:15:45,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:15:45,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:15:45,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:15:45,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:15:45,613 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:15:45,613 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:15:45,613 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:15:45,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:15:45,613 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:15:45,613 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:15:45,613 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:15:45,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:15:45,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:15:45,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:15:45,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:15:45,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:15:45,614 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:15:45,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:15:45,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:15:45,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:15:45,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:15:45,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:15:45,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:15:45,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:15:45,615 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 -> 4d853145e48ada6aa212af657ef21b1dd6bc82cb156511f71c23f87b45f2510e [2025-03-13 22:15:45,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:15:45,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:15:45,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:15:45,836 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:15:45,836 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:15:45,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2025-03-13 22:15:47,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae39c0b6f/29346a6c308d4d5688e5bcc47716797a/FLAGdd3852d98 [2025-03-13 22:15:47,327 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:15:47,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_04-funloop_hard1.i [2025-03-13 22:15:47,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae39c0b6f/29346a6c308d4d5688e5bcc47716797a/FLAGdd3852d98 [2025-03-13 22:15:47,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae39c0b6f/29346a6c308d4d5688e5bcc47716797a [2025-03-13 22:15:47,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:15:47,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:15:47,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:15:47,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:15:47,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:15:47,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:15:47" (1/1) ... [2025-03-13 22:15:47,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eddaf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:47, skipping insertion in model container [2025-03-13 22:15:47,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:15:47" (1/1) ... [2025-03-13 22:15:47,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:15:47,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:15:47,956 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:15:48,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:15:48,059 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:15:48,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:48 WrapperNode [2025-03-13 22:15:48,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:15:48,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:15:48,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:15:48,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:15:48,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:48" (1/1) ... [2025-03-13 22:15:48,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:48" (1/1) ... [2025-03-13 22:15:48,102 INFO L138 Inliner]: procedures = 263, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2025-03-13 22:15:48,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:15:48,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:15:48,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:15:48,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:15:48,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:48" (1/1) ... [2025-03-13 22:15:48,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:48" (1/1) ... [2025-03-13 22:15:48,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:48" (1/1) ... [2025-03-13 22:15:48,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:48" (1/1) ... [2025-03-13 22:15:48,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:48" (1/1) ... [2025-03-13 22:15:48,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:48" (1/1) ... [2025-03-13 22:15:48,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:48" (1/1) ... [2025-03-13 22:15:48,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:48" (1/1) ... [2025-03-13 22:15:48,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:15:48,124 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:15:48,124 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:15:48,124 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:15:48,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:48" (1/1) ... [2025-03-13 22:15:48,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:15:48,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:48,155 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-13 22:15:48,157 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-13 22:15:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:15:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:15:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:15:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:15:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:15:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:15:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:15:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:15:48,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:15:48,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:15:48,174 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:15:48,271 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:15:48,273 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:15:48,524 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:15:48,524 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:15:48,524 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:15:48,547 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:15:48,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:15:48 BoogieIcfgContainer [2025-03-13 22:15:48,547 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:15:48,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:15:48,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:15:48,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:15:48,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:15:47" (1/3) ... [2025-03-13 22:15:48,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0ffdf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:15:48, skipping insertion in model container [2025-03-13 22:15:48,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:48" (2/3) ... [2025-03-13 22:15:48,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0ffdf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:15:48, skipping insertion in model container [2025-03-13 22:15:48,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:15:48" (3/3) ... [2025-03-13 22:15:48,553 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_04-funloop_hard1.i [2025-03-13 22:15:48,564 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:15:48,565 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_04-funloop_hard1.i that has 2 procedures, 180 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-13 22:15:48,565 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:15:48,644 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:15:48,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 182 transitions, 368 flow [2025-03-13 22:15:48,768 INFO L124 PetriNetUnfolderBase]: 3/181 cut-off events. [2025-03-13 22:15:48,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:15:48,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 181 events. 3/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 232 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2025-03-13 22:15:48,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 182 transitions, 368 flow [2025-03-13 22:15:48,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 181 transitions, 365 flow [2025-03-13 22:15:48,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:15:48,809 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;@1d94e0f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:15:48,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-13 22:15:48,842 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:15:48,842 INFO L124 PetriNetUnfolderBase]: 1/115 cut-off events. [2025-03-13 22:15:48,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:15:48,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:48,846 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] [2025-03-13 22:15:48,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:15:48,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash 398662977, now seen corresponding path program 1 times [2025-03-13 22:15:48,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:48,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250672944] [2025-03-13 22:15:48,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:48,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:48,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-13 22:15:48,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-13 22:15:48,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:48,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:49,215 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-13 22:15:49,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250672944] [2025-03-13 22:15:49,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250672944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:49,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:49,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:15:49,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766504995] [2025-03-13 22:15:49,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:49,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:15:49,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:49,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:15:49,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:15:49,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 182 [2025-03-13 22:15:49,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 181 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-13 22:15:49,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:49,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 182 [2025-03-13 22:15:49,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:49,371 INFO L124 PetriNetUnfolderBase]: 15/321 cut-off events. [2025-03-13 22:15:49,371 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:15:49,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 321 events. 15/321 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 914 event pairs, 10 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 266. Up to 36 conditions per place. [2025-03-13 22:15:49,374 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 12 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-03-13 22:15:49,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 182 transitions, 395 flow [2025-03-13 22:15:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:15:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:15:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2025-03-13 22:15:49,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9560439560439561 [2025-03-13 22:15:49,390 INFO L175 Difference]: Start difference. First operand has 182 places, 181 transitions, 365 flow. Second operand 3 states and 522 transitions. [2025-03-13 22:15:49,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 182 transitions, 395 flow [2025-03-13 22:15:49,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:15:49,399 INFO L231 Difference]: Finished difference. Result has 184 places, 182 transitions, 376 flow [2025-03-13 22:15:49,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=184, PETRI_TRANSITIONS=182} [2025-03-13 22:15:49,406 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 2 predicate places. [2025-03-13 22:15:49,407 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 182 transitions, 376 flow [2025-03-13 22:15:49,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-13 22:15:49,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:49,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:15:49,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:15:49,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:15:49,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:49,409 INFO L85 PathProgramCache]: Analyzing trace with hash 273525691, now seen corresponding path program 1 times [2025-03-13 22:15:49,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:49,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044264813] [2025-03-13 22:15:49,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:49,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:49,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:15:49,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:15:49,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:49,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:49,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044264813] [2025-03-13 22:15:49,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044264813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:15:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409735565] [2025-03-13 22:15:49,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:49,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:49,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:49,601 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-13 22:15:49,604 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-13 22:15:49,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:15:49,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:15:49,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:49,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:49,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-13 22:15:49,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:15:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:15:49,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:15:49,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409735565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:49,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 22:15:49,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-13 22:15:49,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502207619] [2025-03-13 22:15:49,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:49,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:15:49,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:49,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:15:49,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:49,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 182 [2025-03-13 22:15:49,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 182 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-13 22:15:49,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:49,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 182 [2025-03-13 22:15:49,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:49,822 INFO L124 PetriNetUnfolderBase]: 35/481 cut-off events. [2025-03-13 22:15:49,822 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:15:49,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 481 events. 35/481 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1726 event pairs, 10 based on Foata normal form. 3/450 useless extension candidates. Maximal degree in co-relation 481. Up to 51 conditions per place. [2025-03-13 22:15:49,829 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2025-03-13 22:15:49,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 187 transitions, 422 flow [2025-03-13 22:15:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:15:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:15:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-03-13 22:15:49,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633699633699634 [2025-03-13 22:15:49,831 INFO L175 Difference]: Start difference. First operand has 184 places, 182 transitions, 376 flow. Second operand 3 states and 526 transitions. [2025-03-13 22:15:49,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 187 transitions, 422 flow [2025-03-13 22:15:49,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 187 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:15:49,836 INFO L231 Difference]: Finished difference. Result has 186 places, 183 transitions, 386 flow [2025-03-13 22:15:49,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=186, PETRI_TRANSITIONS=183} [2025-03-13 22:15:49,836 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 4 predicate places. [2025-03-13 22:15:49,837 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 386 flow [2025-03-13 22:15:49,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-13 22:15:49,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:49,837 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] [2025-03-13 22:15:49,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 22:15:50,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:50,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:15:50,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2132139115, now seen corresponding path program 1 times [2025-03-13 22:15:50,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:50,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754344018] [2025-03-13 22:15:50,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:50,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:50,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-13 22:15:50,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 22:15:50,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:50,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:50,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:50,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754344018] [2025-03-13 22:15:50,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754344018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:15:50,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669287274] [2025-03-13 22:15:50,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:50,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:50,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:50,176 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-13 22:15:50,177 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-13 22:15:50,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-13 22:15:50,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 22:15:50,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:50,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:50,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 22:15:50,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:15:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:50,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:15:50,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:50,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669287274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:15:50,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:15:50,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 22:15:50,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333767595] [2025-03-13 22:15:50,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:15:50,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:15:50,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:50,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:15:50,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:15:50,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-03-13 22:15:50,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 183 transitions, 386 flow. Second operand has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 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-13 22:15:50,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:50,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-03-13 22:15:50,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:50,551 INFO L124 PetriNetUnfolderBase]: 24/489 cut-off events. [2025-03-13 22:15:50,551 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:15:50,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 489 events. 24/489 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1569 event pairs, 14 based on Foata normal form. 2/457 useless extension candidates. Maximal degree in co-relation 458. Up to 51 conditions per place. [2025-03-13 22:15:50,553 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 16 selfloop transitions, 9 changer transitions 0/191 dead transitions. [2025-03-13 22:15:50,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 191 transitions, 454 flow [2025-03-13 22:15:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:15:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:15:50,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1521 transitions. [2025-03-13 22:15:50,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285714285714286 [2025-03-13 22:15:50,555 INFO L175 Difference]: Start difference. First operand has 186 places, 183 transitions, 386 flow. Second operand 9 states and 1521 transitions. [2025-03-13 22:15:50,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 191 transitions, 454 flow [2025-03-13 22:15:50,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 191 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:15:50,558 INFO L231 Difference]: Finished difference. Result has 196 places, 189 transitions, 434 flow [2025-03-13 22:15:50,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=434, PETRI_PLACES=196, PETRI_TRANSITIONS=189} [2025-03-13 22:15:50,559 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 14 predicate places. [2025-03-13 22:15:50,559 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 189 transitions, 434 flow [2025-03-13 22:15:50,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 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-13 22:15:50,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:50,560 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:15:50,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 22:15:50,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-13 22:15:50,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:15:50,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:50,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1323425749, now seen corresponding path program 2 times [2025-03-13 22:15:50,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:50,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653805006] [2025-03-13 22:15:50,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:15:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:50,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-13 22:15:50,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 105 statements. [2025-03-13 22:15:50,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:15:50,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-13 22:15:51,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:51,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653805006] [2025-03-13 22:15:51,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653805006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:51,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:51,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:15:51,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173906086] [2025-03-13 22:15:51,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:51,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:15:51,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:51,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:15:51,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:51,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:15:51,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 189 transitions, 434 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 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-13 22:15:51,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:51,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:15:51,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:51,614 INFO L124 PetriNetUnfolderBase]: 333/1545 cut-off events. [2025-03-13 22:15:51,615 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:15:51,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2256 conditions, 1545 events. 333/1545 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10115 event pairs, 160 based on Foata normal form. 0/1455 useless extension candidates. Maximal degree in co-relation 2144. Up to 544 conditions per place. [2025-03-13 22:15:51,626 INFO L140 encePairwiseOnDemand]: 171/182 looper letters, 36 selfloop transitions, 22 changer transitions 0/218 dead transitions. [2025-03-13 22:15:51,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 218 transitions, 608 flow [2025-03-13 22:15:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:15:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:15:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 977 transitions. [2025-03-13 22:15:51,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8946886446886447 [2025-03-13 22:15:51,629 INFO L175 Difference]: Start difference. First operand has 196 places, 189 transitions, 434 flow. Second operand 6 states and 977 transitions. [2025-03-13 22:15:51,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 218 transitions, 608 flow [2025-03-13 22:15:51,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 218 transitions, 602 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:15:51,636 INFO L231 Difference]: Finished difference. Result has 205 places, 210 transitions, 578 flow [2025-03-13 22:15:51,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=205, PETRI_TRANSITIONS=210} [2025-03-13 22:15:51,637 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 23 predicate places. [2025-03-13 22:15:51,637 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 210 transitions, 578 flow [2025-03-13 22:15:51,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 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-13 22:15:51,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:51,638 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:15:51,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:15:51,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:15:51,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:51,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1407213627, now seen corresponding path program 1 times [2025-03-13 22:15:51,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:51,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578118715] [2025-03-13 22:15:51,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:51,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:51,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-13 22:15:51,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-13 22:15:51,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:51,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:51,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:51,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578118715] [2025-03-13 22:15:51,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578118715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:15:51,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520846906] [2025-03-13 22:15:51,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:51,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:51,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:51,810 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:15:51,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 22:15:51,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-13 22:15:51,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-13 22:15:51,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:51,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:51,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:15:51,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:15:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:51,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:15:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:52,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520846906] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:15:52,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:15:52,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-13 22:15:52,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546343830] [2025-03-13 22:15:52,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:15:52,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 22:15:52,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:52,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 22:15:52,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:15:52,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-03-13 22:15:52,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 210 transitions, 578 flow. Second operand has 18 states, 18 states have (on average 168.0) internal successors, (3024), 18 states have internal predecessors, (3024), 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-13 22:15:52,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:52,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-03-13 22:15:52,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:52,390 INFO L124 PetriNetUnfolderBase]: 118/1109 cut-off events. [2025-03-13 22:15:52,391 INFO L125 PetriNetUnfolderBase]: For 77/83 co-relation queries the response was YES. [2025-03-13 22:15:52,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 1109 events. 118/1109 cut-off events. For 77/83 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5898 event pairs, 24 based on Foata normal form. 4/1039 useless extension candidates. Maximal degree in co-relation 1418. Up to 133 conditions per place. [2025-03-13 22:15:52,398 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 20 selfloop transitions, 21 changer transitions 0/228 dead transitions. [2025-03-13 22:15:52,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 228 transitions, 748 flow [2025-03-13 22:15:52,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 22:15:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 22:15:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3531 transitions. [2025-03-13 22:15:52,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.923861852433281 [2025-03-13 22:15:52,406 INFO L175 Difference]: Start difference. First operand has 205 places, 210 transitions, 578 flow. Second operand 21 states and 3531 transitions. [2025-03-13 22:15:52,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 228 transitions, 748 flow [2025-03-13 22:15:52,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 228 transitions, 748 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:15:52,414 INFO L231 Difference]: Finished difference. Result has 230 places, 223 transitions, 708 flow [2025-03-13 22:15:52,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=708, PETRI_PLACES=230, PETRI_TRANSITIONS=223} [2025-03-13 22:15:52,417 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 48 predicate places. [2025-03-13 22:15:52,417 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 223 transitions, 708 flow [2025-03-13 22:15:52,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 168.0) internal successors, (3024), 18 states have internal predecessors, (3024), 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-13 22:15:52,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:52,419 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:15:52,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 22:15:52,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:52,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:15:52,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:52,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2067257275, now seen corresponding path program 2 times [2025-03-13 22:15:52,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:52,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162825265] [2025-03-13 22:15:52,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:15:52,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:52,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-03-13 22:15:52,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 90 of 125 statements. [2025-03-13 22:15:52,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:15:52,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-13 22:15:52,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:52,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162825265] [2025-03-13 22:15:52,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162825265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:52,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:52,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:15:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889846435] [2025-03-13 22:15:52,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:52,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:15:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:52,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:15:52,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:53,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:15:53,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 223 transitions, 708 flow. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 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-13 22:15:53,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:53,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:15:53,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:53,353 INFO L124 PetriNetUnfolderBase]: 505/2412 cut-off events. [2025-03-13 22:15:53,353 INFO L125 PetriNetUnfolderBase]: For 415/445 co-relation queries the response was YES. [2025-03-13 22:15:53,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 2412 events. 505/2412 cut-off events. For 415/445 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 17728 event pairs, 194 based on Foata normal form. 5/2276 useless extension candidates. Maximal degree in co-relation 3909. Up to 824 conditions per place. [2025-03-13 22:15:53,367 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 61 selfloop transitions, 46 changer transitions 0/284 dead transitions. [2025-03-13 22:15:53,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 284 transitions, 1086 flow [2025-03-13 22:15:53,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:15:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:15:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1001 transitions. [2025-03-13 22:15:53,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-03-13 22:15:53,370 INFO L175 Difference]: Start difference. First operand has 230 places, 223 transitions, 708 flow. Second operand 6 states and 1001 transitions. [2025-03-13 22:15:53,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 284 transitions, 1086 flow [2025-03-13 22:15:53,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 284 transitions, 1062 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-13 22:15:53,408 INFO L231 Difference]: Finished difference. Result has 234 places, 268 transitions, 1038 flow [2025-03-13 22:15:53,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1038, PETRI_PLACES=234, PETRI_TRANSITIONS=268} [2025-03-13 22:15:53,408 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 52 predicate places. [2025-03-13 22:15:53,410 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 268 transitions, 1038 flow [2025-03-13 22:15:53,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 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-13 22:15:53,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:53,411 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:15:53,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:15:53,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:15:53,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1078927013, now seen corresponding path program 1 times [2025-03-13 22:15:53,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932006174] [2025-03-13 22:15:53,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:53,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-13 22:15:53,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-13 22:15:53,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:53,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:53,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932006174] [2025-03-13 22:15:53,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932006174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:15:53,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713871281] [2025-03-13 22:15:53,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:53,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:53,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:53,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:15:53,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 22:15:53,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-13 22:15:53,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-13 22:15:53,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:53,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:53,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 22:15:53,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:15:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:53,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:15:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:15:54,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713871281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:15:54,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:15:54,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-13 22:15:54,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966569431] [2025-03-13 22:15:54,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:15:54,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 22:15:54,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:54,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 22:15:54,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-13 22:15:54,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 182 [2025-03-13 22:15:54,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 268 transitions, 1038 flow. Second operand has 23 states, 23 states have (on average 168.08695652173913) internal successors, (3866), 23 states have internal predecessors, (3866), 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-13 22:15:54,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:54,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 182 [2025-03-13 22:15:54,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:54,568 INFO L124 PetriNetUnfolderBase]: 264/1738 cut-off events. [2025-03-13 22:15:54,568 INFO L125 PetriNetUnfolderBase]: For 589/618 co-relation queries the response was YES. [2025-03-13 22:15:54,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3163 conditions, 1738 events. 264/1738 cut-off events. For 589/618 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 11608 event pairs, 40 based on Foata normal form. 13/1667 useless extension candidates. Maximal degree in co-relation 2886. Up to 204 conditions per place. [2025-03-13 22:15:54,579 INFO L140 encePairwiseOnDemand]: 176/182 looper letters, 23 selfloop transitions, 30 changer transitions 0/285 dead transitions. [2025-03-13 22:15:54,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 285 transitions, 1266 flow [2025-03-13 22:15:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-13 22:15:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-13 22:15:54,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5036 transitions. [2025-03-13 22:15:54,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9223443223443224 [2025-03-13 22:15:54,589 INFO L175 Difference]: Start difference. First operand has 234 places, 268 transitions, 1038 flow. Second operand 30 states and 5036 transitions. [2025-03-13 22:15:54,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 285 transitions, 1266 flow [2025-03-13 22:15:54,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 285 transitions, 1266 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:15:54,599 INFO L231 Difference]: Finished difference. Result has 267 places, 278 transitions, 1190 flow [2025-03-13 22:15:54,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1190, PETRI_PLACES=267, PETRI_TRANSITIONS=278} [2025-03-13 22:15:54,601 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 85 predicate places. [2025-03-13 22:15:54,601 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 278 transitions, 1190 flow [2025-03-13 22:15:54,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 168.08695652173913) internal successors, (3866), 23 states have internal predecessors, (3866), 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-13 22:15:54,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:54,603 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:15:54,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 22:15:54,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:54,803 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:15:54,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:54,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1427340449, now seen corresponding path program 2 times [2025-03-13 22:15:54,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:54,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850316896] [2025-03-13 22:15:54,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:15:54,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:54,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-03-13 22:15:54,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 148 statements. [2025-03-13 22:15:54,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:15:54,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:15:55,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:55,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850316896] [2025-03-13 22:15:55,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850316896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:55,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:55,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:15:55,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092486227] [2025-03-13 22:15:55,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:55,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:15:55,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:55,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:15:55,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:55,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2025-03-13 22:15:55,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 278 transitions, 1190 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 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-13 22:15:55,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:55,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2025-03-13 22:15:55,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:55,634 INFO L124 PetriNetUnfolderBase]: 949/3309 cut-off events. [2025-03-13 22:15:55,634 INFO L125 PetriNetUnfolderBase]: For 2058/2153 co-relation queries the response was YES. [2025-03-13 22:15:55,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7539 conditions, 3309 events. 949/3309 cut-off events. For 2058/2153 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 23816 event pairs, 303 based on Foata normal form. 20/3172 useless extension candidates. Maximal degree in co-relation 7261. Up to 1634 conditions per place. [2025-03-13 22:15:55,653 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 102 selfloop transitions, 57 changer transitions 0/333 dead transitions. [2025-03-13 22:15:55,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 333 transitions, 1752 flow [2025-03-13 22:15:55,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:15:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:15:55,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 943 transitions. [2025-03-13 22:15:55,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8635531135531136 [2025-03-13 22:15:55,657 INFO L175 Difference]: Start difference. First operand has 267 places, 278 transitions, 1190 flow. Second operand 6 states and 943 transitions. [2025-03-13 22:15:55,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 333 transitions, 1752 flow [2025-03-13 22:15:55,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 333 transitions, 1706 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-13 22:15:55,670 INFO L231 Difference]: Finished difference. Result has 259 places, 325 transitions, 1642 flow [2025-03-13 22:15:55,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1642, PETRI_PLACES=259, PETRI_TRANSITIONS=325} [2025-03-13 22:15:55,671 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 77 predicate places. [2025-03-13 22:15:55,671 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 325 transitions, 1642 flow [2025-03-13 22:15:55,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 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-13 22:15:55,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:55,671 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:15:55,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:15:55,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:15:55,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:55,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1670237187, now seen corresponding path program 1 times [2025-03-13 22:15:55,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:55,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466971767] [2025-03-13 22:15:55,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:55,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-13 22:15:55,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-13 22:15:55,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:55,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:15:55,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:55,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466971767] [2025-03-13 22:15:55,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466971767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:55,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:55,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:15:55,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823786036] [2025-03-13 22:15:55,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:55,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:15:55,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:55,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:15:55,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:56,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2025-03-13 22:15:56,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 325 transitions, 1642 flow. Second operand has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 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-13 22:15:56,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:56,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2025-03-13 22:15:56,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:56,770 INFO L124 PetriNetUnfolderBase]: 1319/4555 cut-off events. [2025-03-13 22:15:56,770 INFO L125 PetriNetUnfolderBase]: For 4859/4990 co-relation queries the response was YES. [2025-03-13 22:15:56,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11634 conditions, 4555 events. 1319/4555 cut-off events. For 4859/4990 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 35660 event pairs, 341 based on Foata normal form. 40/4406 useless extension candidates. Maximal degree in co-relation 11373. Up to 2190 conditions per place. [2025-03-13 22:15:56,801 INFO L140 encePairwiseOnDemand]: 159/182 looper letters, 143 selfloop transitions, 103 changer transitions 4/426 dead transitions. [2025-03-13 22:15:56,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 426 transitions, 2608 flow [2025-03-13 22:15:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:15:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:15:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 983 transitions. [2025-03-13 22:15:56,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9001831501831502 [2025-03-13 22:15:56,803 INFO L175 Difference]: Start difference. First operand has 259 places, 325 transitions, 1642 flow. Second operand 6 states and 983 transitions. [2025-03-13 22:15:56,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 426 transitions, 2608 flow [2025-03-13 22:15:56,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 426 transitions, 2544 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-03-13 22:15:56,820 INFO L231 Difference]: Finished difference. Result has 269 places, 410 transitions, 2494 flow [2025-03-13 22:15:56,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2494, PETRI_PLACES=269, PETRI_TRANSITIONS=410} [2025-03-13 22:15:56,821 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 87 predicate places. [2025-03-13 22:15:56,821 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 410 transitions, 2494 flow [2025-03-13 22:15:56,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 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-13 22:15:56,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:56,822 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:15:56,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:15:56,822 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:15:56,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:56,823 INFO L85 PathProgramCache]: Analyzing trace with hash 496308676, now seen corresponding path program 1 times [2025-03-13 22:15:56,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:56,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154884027] [2025-03-13 22:15:56,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:56,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:56,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-13 22:15:56,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:15:56,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:56,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:15:57,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:57,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154884027] [2025-03-13 22:15:57,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154884027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:57,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:57,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:15:57,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352564683] [2025-03-13 22:15:57,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:57,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:15:57,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:57,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:15:57,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:15:58,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:15:58,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 410 transitions, 2494 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:15:58,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:58,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:15:58,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:59,032 INFO L124 PetriNetUnfolderBase]: 1231/4917 cut-off events. [2025-03-13 22:15:59,032 INFO L125 PetriNetUnfolderBase]: For 6125/6264 co-relation queries the response was YES. [2025-03-13 22:15:59,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13121 conditions, 4917 events. 1231/4917 cut-off events. For 6125/6264 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 41564 event pairs, 180 based on Foata normal form. 37/4877 useless extension candidates. Maximal degree in co-relation 12843. Up to 712 conditions per place. [2025-03-13 22:15:59,109 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 73 selfloop transitions, 15 changer transitions 0/468 dead transitions. [2025-03-13 22:15:59,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 468 transitions, 2786 flow [2025-03-13 22:15:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:15:59,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:15:59,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1467 transitions. [2025-03-13 22:15:59,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8956043956043956 [2025-03-13 22:15:59,116 INFO L175 Difference]: Start difference. First operand has 269 places, 410 transitions, 2494 flow. Second operand 9 states and 1467 transitions. [2025-03-13 22:15:59,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 468 transitions, 2786 flow [2025-03-13 22:15:59,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 468 transitions, 2672 flow, removed 57 selfloop flow, removed 0 redundant places. [2025-03-13 22:15:59,150 INFO L231 Difference]: Finished difference. Result has 284 places, 424 transitions, 2492 flow [2025-03-13 22:15:59,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2380, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2492, PETRI_PLACES=284, PETRI_TRANSITIONS=424} [2025-03-13 22:15:59,152 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 102 predicate places. [2025-03-13 22:15:59,152 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 424 transitions, 2492 flow [2025-03-13 22:15:59,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:15:59,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:59,153 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:15:59,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:15:59,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:15:59,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:59,154 INFO L85 PathProgramCache]: Analyzing trace with hash 510152904, now seen corresponding path program 2 times [2025-03-13 22:15:59,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:59,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003891193] [2025-03-13 22:15:59,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:15:59,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:59,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-13 22:15:59,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-13 22:15:59,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:15:59,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:15:59,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003891193] [2025-03-13 22:15:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003891193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:59,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:59,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:15:59,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687079350] [2025-03-13 22:15:59,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:59,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:15:59,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:59,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:15:59,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:00,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:00,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 424 transitions, 2492 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:00,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:00,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:00,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:01,821 INFO L124 PetriNetUnfolderBase]: 2479/9316 cut-off events. [2025-03-13 22:16:01,821 INFO L125 PetriNetUnfolderBase]: For 12598/12898 co-relation queries the response was YES. [2025-03-13 22:16:01,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26480 conditions, 9316 events. 2479/9316 cut-off events. For 12598/12898 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 88651 event pairs, 325 based on Foata normal form. 99/9273 useless extension candidates. Maximal degree in co-relation 26194. Up to 1468 conditions per place. [2025-03-13 22:16:01,875 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 119 selfloop transitions, 20 changer transitions 4/523 dead transitions. [2025-03-13 22:16:01,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 523 transitions, 3210 flow [2025-03-13 22:16:01,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1475 transitions. [2025-03-13 22:16:01,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9004884004884005 [2025-03-13 22:16:01,877 INFO L175 Difference]: Start difference. First operand has 284 places, 424 transitions, 2492 flow. Second operand 9 states and 1475 transitions. [2025-03-13 22:16:01,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 523 transitions, 3210 flow [2025-03-13 22:16:01,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 523 transitions, 3200 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:16:01,931 INFO L231 Difference]: Finished difference. Result has 298 places, 441 transitions, 2671 flow [2025-03-13 22:16:01,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2490, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2671, PETRI_PLACES=298, PETRI_TRANSITIONS=441} [2025-03-13 22:16:01,932 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 116 predicate places. [2025-03-13 22:16:01,932 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 441 transitions, 2671 flow [2025-03-13 22:16:01,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:01,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:01,933 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:01,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:16:01,933 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:01,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1645867836, now seen corresponding path program 3 times [2025-03-13 22:16:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:01,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269446265] [2025-03-13 22:16:01,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:16:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:01,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:01,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-13 22:16:01,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 22:16:01,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:02,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:02,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269446265] [2025-03-13 22:16:02,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269446265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:02,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:02,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:02,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854106025] [2025-03-13 22:16:02,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:02,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:02,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:02,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:03,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:03,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 441 transitions, 2671 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:03,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:03,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:03,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:05,096 INFO L124 PetriNetUnfolderBase]: 2778/10527 cut-off events. [2025-03-13 22:16:05,096 INFO L125 PetriNetUnfolderBase]: For 16366/16818 co-relation queries the response was YES. [2025-03-13 22:16:05,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31099 conditions, 10527 events. 2778/10527 cut-off events. For 16366/16818 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 101812 event pairs, 352 based on Foata normal form. 106/10467 useless extension candidates. Maximal degree in co-relation 30805. Up to 1567 conditions per place. [2025-03-13 22:16:05,173 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 123 selfloop transitions, 22 changer transitions 0/525 dead transitions. [2025-03-13 22:16:05,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 525 transitions, 3459 flow [2025-03-13 22:16:05,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1472 transitions. [2025-03-13 22:16:05,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8986568986568987 [2025-03-13 22:16:05,175 INFO L175 Difference]: Start difference. First operand has 298 places, 441 transitions, 2671 flow. Second operand 9 states and 1472 transitions. [2025-03-13 22:16:05,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 525 transitions, 3459 flow [2025-03-13 22:16:05,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 525 transitions, 3421 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:05,255 INFO L231 Difference]: Finished difference. Result has 311 places, 453 transitions, 2840 flow [2025-03-13 22:16:05,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2840, PETRI_PLACES=311, PETRI_TRANSITIONS=453} [2025-03-13 22:16:05,257 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 129 predicate places. [2025-03-13 22:16:05,257 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 453 transitions, 2840 flow [2025-03-13 22:16:05,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:05,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:05,258 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:05,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:16:05,258 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:05,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1851917024, now seen corresponding path program 4 times [2025-03-13 22:16:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:05,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140941275] [2025-03-13 22:16:05,260 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:16:05,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:05,274 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-13 22:16:05,307 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:16:05,307 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 22:16:05,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:05,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:05,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140941275] [2025-03-13 22:16:05,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140941275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:05,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:05,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:16:05,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102161106] [2025-03-13 22:16:05,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:05,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:16:05,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:05,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:16:05,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:16:06,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:06,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 453 transitions, 2840 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 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-13 22:16:06,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:06,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:06,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:08,606 INFO L124 PetriNetUnfolderBase]: 3073/11395 cut-off events. [2025-03-13 22:16:08,607 INFO L125 PetriNetUnfolderBase]: For 20248/20704 co-relation queries the response was YES. [2025-03-13 22:16:08,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34824 conditions, 11395 events. 3073/11395 cut-off events. For 20248/20704 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 111221 event pairs, 346 based on Foata normal form. 119/11359 useless extension candidates. Maximal degree in co-relation 34524. Up to 1851 conditions per place. [2025-03-13 22:16:08,691 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 137 selfloop transitions, 28 changer transitions 4/549 dead transitions. [2025-03-13 22:16:08,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 549 transitions, 3825 flow [2025-03-13 22:16:08,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:16:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:16:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1631 transitions. [2025-03-13 22:16:08,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8961538461538462 [2025-03-13 22:16:08,693 INFO L175 Difference]: Start difference. First operand has 311 places, 453 transitions, 2840 flow. Second operand 10 states and 1631 transitions. [2025-03-13 22:16:08,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 549 transitions, 3825 flow [2025-03-13 22:16:08,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 549 transitions, 3746 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-13 22:16:08,792 INFO L231 Difference]: Finished difference. Result has 322 places, 465 transitions, 3021 flow [2025-03-13 22:16:08,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2814, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3021, PETRI_PLACES=322, PETRI_TRANSITIONS=465} [2025-03-13 22:16:08,793 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 140 predicate places. [2025-03-13 22:16:08,793 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 465 transitions, 3021 flow [2025-03-13 22:16:08,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 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-13 22:16:08,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:08,794 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:08,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:16:08,794 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:08,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:08,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1516329702, now seen corresponding path program 5 times [2025-03-13 22:16:08,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:08,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832542742] [2025-03-13 22:16:08,795 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:16:08,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:08,808 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:08,821 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:16:08,822 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-13 22:16:08,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-13 22:16:09,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:09,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832542742] [2025-03-13 22:16:09,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832542742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:16:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008853284] [2025-03-13 22:16:09,447 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:16:09,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:16:09,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:16:09,449 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:16:09,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 22:16:09,514 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:09,575 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:16:09,576 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-13 22:16:09,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:09,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-13 22:16:09,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:16:09,815 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-13 22:16:09,871 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:09,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:16:09,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008853284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:09,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 22:16:09,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-13 22:16:09,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944096016] [2025-03-13 22:16:09,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:09,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:16:09,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:09,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:16:09,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:16:10,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:10,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 465 transitions, 3021 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 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-13 22:16:10,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:10,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:10,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:12,594 INFO L124 PetriNetUnfolderBase]: 3406/12720 cut-off events. [2025-03-13 22:16:12,595 INFO L125 PetriNetUnfolderBase]: For 25302/25896 co-relation queries the response was YES. [2025-03-13 22:16:12,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39483 conditions, 12720 events. 3406/12720 cut-off events. For 25302/25896 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 126906 event pairs, 382 based on Foata normal form. 112/12645 useless extension candidates. Maximal degree in co-relation 39177. Up to 1959 conditions per place. [2025-03-13 22:16:12,720 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 136 selfloop transitions, 30 changer transitions 0/546 dead transitions. [2025-03-13 22:16:12,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 546 transitions, 4004 flow [2025-03-13 22:16:12,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:16:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:16:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1628 transitions. [2025-03-13 22:16:12,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8945054945054945 [2025-03-13 22:16:12,722 INFO L175 Difference]: Start difference. First operand has 322 places, 465 transitions, 3021 flow. Second operand 10 states and 1628 transitions. [2025-03-13 22:16:12,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 546 transitions, 4004 flow [2025-03-13 22:16:12,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 546 transitions, 3911 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-03-13 22:16:12,820 INFO L231 Difference]: Finished difference. Result has 333 places, 480 transitions, 3259 flow [2025-03-13 22:16:12,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=2978, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3259, PETRI_PLACES=333, PETRI_TRANSITIONS=480} [2025-03-13 22:16:12,821 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 151 predicate places. [2025-03-13 22:16:12,821 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 480 transitions, 3259 flow [2025-03-13 22:16:12,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 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-13 22:16:12,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:12,821 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:12,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-13 22:16:13,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-13 22:16:13,022 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:13,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:13,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1220419554, now seen corresponding path program 6 times [2025-03-13 22:16:13,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:13,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993219567] [2025-03-13 22:16:13,023 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 22:16:13,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:13,037 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:13,043 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-13 22:16:13,044 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 22:16:13,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:13,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:13,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993219567] [2025-03-13 22:16:13,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993219567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:13,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:13,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:13,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856279425] [2025-03-13 22:16:13,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:13,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:13,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:13,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:13,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:14,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:14,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 480 transitions, 3259 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:14,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:14,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:14,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:16,205 INFO L124 PetriNetUnfolderBase]: 3725/13728 cut-off events. [2025-03-13 22:16:16,206 INFO L125 PetriNetUnfolderBase]: For 31550/32164 co-relation queries the response was YES. [2025-03-13 22:16:16,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43944 conditions, 13728 events. 3725/13728 cut-off events. For 31550/32164 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 138859 event pairs, 386 based on Foata normal form. 120/13668 useless extension candidates. Maximal degree in co-relation 43632. Up to 2232 conditions per place. [2025-03-13 22:16:16,329 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 154 selfloop transitions, 34 changer transitions 2/570 dead transitions. [2025-03-13 22:16:16,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 570 transitions, 4410 flow [2025-03-13 22:16:16,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1479 transitions. [2025-03-13 22:16:16,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2025-03-13 22:16:16,331 INFO L175 Difference]: Start difference. First operand has 333 places, 480 transitions, 3259 flow. Second operand 9 states and 1479 transitions. [2025-03-13 22:16:16,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 570 transitions, 4410 flow [2025-03-13 22:16:16,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 570 transitions, 4312 flow, removed 27 selfloop flow, removed 3 redundant places. [2025-03-13 22:16:16,458 INFO L231 Difference]: Finished difference. Result has 344 places, 495 transitions, 3504 flow [2025-03-13 22:16:16,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3198, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3504, PETRI_PLACES=344, PETRI_TRANSITIONS=495} [2025-03-13 22:16:16,459 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 162 predicate places. [2025-03-13 22:16:16,459 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 495 transitions, 3504 flow [2025-03-13 22:16:16,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:16,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:16,460 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:16,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:16:16,460 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:16,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1576277874, now seen corresponding path program 7 times [2025-03-13 22:16:16,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:16,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31450578] [2025-03-13 22:16:16,461 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 22:16:16,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:16,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-13 22:16:16,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:16:16,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:16,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:16,686 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:16,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:16,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31450578] [2025-03-13 22:16:16,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31450578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:16,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:16,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:16,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843840537] [2025-03-13 22:16:16,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:16,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:16,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:16,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:16,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:17,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:17,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 495 transitions, 3504 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:17,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:17,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:17,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:19,811 INFO L124 PetriNetUnfolderBase]: 4068/15087 cut-off events. [2025-03-13 22:16:19,811 INFO L125 PetriNetUnfolderBase]: For 39976/40637 co-relation queries the response was YES. [2025-03-13 22:16:19,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49325 conditions, 15087 events. 4068/15087 cut-off events. For 39976/40637 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 155897 event pairs, 478 based on Foata normal form. 107/14981 useless extension candidates. Maximal degree in co-relation 49008. Up to 2363 conditions per place. [2025-03-13 22:16:19,943 INFO L140 encePairwiseOnDemand]: 168/182 looper letters, 150 selfloop transitions, 36 changer transitions 0/566 dead transitions. [2025-03-13 22:16:19,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 566 transitions, 4606 flow [2025-03-13 22:16:19,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1477 transitions. [2025-03-13 22:16:19,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9017094017094017 [2025-03-13 22:16:19,945 INFO L175 Difference]: Start difference. First operand has 344 places, 495 transitions, 3504 flow. Second operand 9 states and 1477 transitions. [2025-03-13 22:16:19,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 566 transitions, 4606 flow [2025-03-13 22:16:20,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 566 transitions, 4506 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-03-13 22:16:20,112 INFO L231 Difference]: Finished difference. Result has 357 places, 514 transitions, 3855 flow [2025-03-13 22:16:20,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3855, PETRI_PLACES=357, PETRI_TRANSITIONS=514} [2025-03-13 22:16:20,113 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 175 predicate places. [2025-03-13 22:16:20,113 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 514 transitions, 3855 flow [2025-03-13 22:16:20,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:20,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:20,113 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:20,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:16:20,114 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:20,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2116917232, now seen corresponding path program 8 times [2025-03-13 22:16:20,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:20,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090383879] [2025-03-13 22:16:20,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:16:20,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:20,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-13 22:16:20,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-13 22:16:20,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:16:20,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:20,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:20,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090383879] [2025-03-13 22:16:20,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090383879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:20,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:20,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:20,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869535051] [2025-03-13 22:16:20,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:20,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:20,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:20,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:20,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:20,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:20,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 514 transitions, 3855 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:20,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:20,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:20,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:23,753 INFO L124 PetriNetUnfolderBase]: 4671/16951 cut-off events. [2025-03-13 22:16:23,753 INFO L125 PetriNetUnfolderBase]: For 51043/51927 co-relation queries the response was YES. [2025-03-13 22:16:23,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57058 conditions, 16951 events. 4671/16951 cut-off events. For 51043/51927 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 179812 event pairs, 469 based on Foata normal form. 137/16875 useless extension candidates. Maximal degree in co-relation 56734. Up to 2778 conditions per place. [2025-03-13 22:16:23,887 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 173 selfloop transitions, 45 changer transitions 0/598 dead transitions. [2025-03-13 22:16:23,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 598 transitions, 5172 flow [2025-03-13 22:16:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1481 transitions. [2025-03-13 22:16:23,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9041514041514042 [2025-03-13 22:16:23,888 INFO L175 Difference]: Start difference. First operand has 357 places, 514 transitions, 3855 flow. Second operand 9 states and 1481 transitions. [2025-03-13 22:16:23,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 598 transitions, 5172 flow [2025-03-13 22:16:24,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 598 transitions, 5068 flow, removed 52 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:24,080 INFO L231 Difference]: Finished difference. Result has 372 places, 532 transitions, 4209 flow [2025-03-13 22:16:24,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=3751, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4209, PETRI_PLACES=372, PETRI_TRANSITIONS=532} [2025-03-13 22:16:24,081 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 190 predicate places. [2025-03-13 22:16:24,081 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 532 transitions, 4209 flow [2025-03-13 22:16:24,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:24,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:24,082 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:24,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:16:24,082 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:24,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:24,083 INFO L85 PathProgramCache]: Analyzing trace with hash 487230494, now seen corresponding path program 9 times [2025-03-13 22:16:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:24,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363638591] [2025-03-13 22:16:24,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:16:24,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:24,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:24,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-13 22:16:24,096 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 22:16:24,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:24,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:24,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363638591] [2025-03-13 22:16:24,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363638591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:24,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:24,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:24,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915999200] [2025-03-13 22:16:24,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:24,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:24,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:24,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:24,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:24,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:24,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 532 transitions, 4209 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:24,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:24,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:24,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:27,801 INFO L124 PetriNetUnfolderBase]: 4663/17065 cut-off events. [2025-03-13 22:16:27,801 INFO L125 PetriNetUnfolderBase]: For 56745/57647 co-relation queries the response was YES. [2025-03-13 22:16:27,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58128 conditions, 17065 events. 4663/17065 cut-off events. For 56745/57647 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 181799 event pairs, 445 based on Foata normal form. 223/17085 useless extension candidates. Maximal degree in co-relation 57796. Up to 2699 conditions per place. [2025-03-13 22:16:28,036 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 185 selfloop transitions, 58 changer transitions 0/623 dead transitions. [2025-03-13 22:16:28,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 623 transitions, 5535 flow [2025-03-13 22:16:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1470 transitions. [2025-03-13 22:16:28,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2025-03-13 22:16:28,038 INFO L175 Difference]: Start difference. First operand has 372 places, 532 transitions, 4209 flow. Second operand 9 states and 1470 transitions. [2025-03-13 22:16:28,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 623 transitions, 5535 flow [2025-03-13 22:16:28,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 623 transitions, 5447 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:28,298 INFO L231 Difference]: Finished difference. Result has 384 places, 544 transitions, 4449 flow [2025-03-13 22:16:28,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4123, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4449, PETRI_PLACES=384, PETRI_TRANSITIONS=544} [2025-03-13 22:16:28,299 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 202 predicate places. [2025-03-13 22:16:28,299 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 544 transitions, 4449 flow [2025-03-13 22:16:28,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:28,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:28,300 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:28,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:16:28,300 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:28,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:28,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1094714860, now seen corresponding path program 10 times [2025-03-13 22:16:28,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:28,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060519278] [2025-03-13 22:16:28,301 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:16:28,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:28,316 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-13 22:16:28,331 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:16:28,331 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 22:16:28,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:29,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:29,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060519278] [2025-03-13 22:16:29,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060519278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:29,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:29,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:16:29,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240259316] [2025-03-13 22:16:29,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:29,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:16:29,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:29,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:16:29,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:16:29,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:29,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 544 transitions, 4449 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 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-13 22:16:29,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:29,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:29,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:32,760 INFO L124 PetriNetUnfolderBase]: 4388/16276 cut-off events. [2025-03-13 22:16:32,760 INFO L125 PetriNetUnfolderBase]: For 58688/59591 co-relation queries the response was YES. [2025-03-13 22:16:32,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56085 conditions, 16276 events. 4388/16276 cut-off events. For 58688/59591 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 171668 event pairs, 426 based on Foata normal form. 205/16278 useless extension candidates. Maximal degree in co-relation 55748. Up to 2535 conditions per place. [2025-03-13 22:16:32,901 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 185 selfloop transitions, 55 changer transitions 0/620 dead transitions. [2025-03-13 22:16:32,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 620 transitions, 5663 flow [2025-03-13 22:16:32,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:16:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:16:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1621 transitions. [2025-03-13 22:16:32,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8906593406593407 [2025-03-13 22:16:32,902 INFO L175 Difference]: Start difference. First operand has 384 places, 544 transitions, 4449 flow. Second operand 10 states and 1621 transitions. [2025-03-13 22:16:32,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 620 transitions, 5663 flow [2025-03-13 22:16:33,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 620 transitions, 5481 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-03-13 22:16:33,113 INFO L231 Difference]: Finished difference. Result has 392 places, 547 transitions, 4483 flow [2025-03-13 22:16:33,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4279, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4483, PETRI_PLACES=392, PETRI_TRANSITIONS=547} [2025-03-13 22:16:33,113 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 210 predicate places. [2025-03-13 22:16:33,114 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 547 transitions, 4483 flow [2025-03-13 22:16:33,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 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-13 22:16:33,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:33,114 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:33,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:16:33,114 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:33,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:33,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1274962040, now seen corresponding path program 11 times [2025-03-13 22:16:33,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:33,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510400750] [2025-03-13 22:16:33,115 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:16:33,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:33,125 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:33,134 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:16:33,134 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-13 22:16:33,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-03-13 22:16:33,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:33,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510400750] [2025-03-13 22:16:33,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510400750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:16:33,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265404969] [2025-03-13 22:16:33,447 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:16:33,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:16:33,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:16:33,449 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:16:33,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 22:16:33,514 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:33,554 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:16:33,554 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-13 22:16:33,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:33,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-13 22:16:33,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:16:33,737 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-13 22:16:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:33,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:16:33,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265404969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:33,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 22:16:33,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-13 22:16:33,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051068293] [2025-03-13 22:16:33,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:33,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:16:33,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:33,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:16:33,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:16:34,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:34,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 547 transitions, 4483 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 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-13 22:16:34,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:34,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:34,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:37,577 INFO L124 PetriNetUnfolderBase]: 4390/16303 cut-off events. [2025-03-13 22:16:37,578 INFO L125 PetriNetUnfolderBase]: For 56430/57210 co-relation queries the response was YES. [2025-03-13 22:16:37,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56006 conditions, 16303 events. 4390/16303 cut-off events. For 56430/57210 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 171969 event pairs, 450 based on Foata normal form. 175/16273 useless extension candidates. Maximal degree in co-relation 55665. Up to 2566 conditions per place. [2025-03-13 22:16:37,735 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 179 selfloop transitions, 61 changer transitions 0/620 dead transitions. [2025-03-13 22:16:37,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 620 transitions, 5647 flow [2025-03-13 22:16:37,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:16:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:16:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1624 transitions. [2025-03-13 22:16:37,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8923076923076924 [2025-03-13 22:16:37,737 INFO L175 Difference]: Start difference. First operand has 392 places, 547 transitions, 4483 flow. Second operand 10 states and 1624 transitions. [2025-03-13 22:16:37,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 620 transitions, 5647 flow [2025-03-13 22:16:38,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 620 transitions, 5529 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-13 22:16:38,082 INFO L231 Difference]: Finished difference. Result has 400 places, 558 transitions, 4735 flow [2025-03-13 22:16:38,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4383, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=490, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4735, PETRI_PLACES=400, PETRI_TRANSITIONS=558} [2025-03-13 22:16:38,083 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 218 predicate places. [2025-03-13 22:16:38,083 INFO L471 AbstractCegarLoop]: Abstraction has has 400 places, 558 transitions, 4735 flow [2025-03-13 22:16:38,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 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-13 22:16:38,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:38,084 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:38,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 22:16:38,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:16:38,284 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:38,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:38,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2102762288, now seen corresponding path program 12 times [2025-03-13 22:16:38,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:38,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139147940] [2025-03-13 22:16:38,286 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 22:16:38,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:38,294 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:38,300 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-13 22:16:38,301 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 22:16:38,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:38,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:38,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139147940] [2025-03-13 22:16:38,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139147940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:38,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:38,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:38,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777179058] [2025-03-13 22:16:38,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:38,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:38,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:38,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:38,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:39,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:39,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 558 transitions, 4735 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:39,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:39,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:39,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:42,045 INFO L124 PetriNetUnfolderBase]: 4679/17288 cut-off events. [2025-03-13 22:16:42,045 INFO L125 PetriNetUnfolderBase]: For 63711/64533 co-relation queries the response was YES. [2025-03-13 22:16:42,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59966 conditions, 17288 events. 4679/17288 cut-off events. For 63711/64533 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 184587 event pairs, 475 based on Foata normal form. 163/17232 useless extension candidates. Maximal degree in co-relation 59620. Up to 2741 conditions per place. [2025-03-13 22:16:42,200 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 203 selfloop transitions, 49 changer transitions 0/632 dead transitions. [2025-03-13 22:16:42,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 632 transitions, 6071 flow [2025-03-13 22:16:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1479 transitions. [2025-03-13 22:16:42,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2025-03-13 22:16:42,202 INFO L175 Difference]: Start difference. First operand has 400 places, 558 transitions, 4735 flow. Second operand 9 states and 1479 transitions. [2025-03-13 22:16:42,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 632 transitions, 6071 flow [2025-03-13 22:16:42,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 632 transitions, 5865 flow, removed 73 selfloop flow, removed 4 redundant places. [2025-03-13 22:16:42,451 INFO L231 Difference]: Finished difference. Result has 408 places, 568 transitions, 4915 flow [2025-03-13 22:16:42,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4627, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4915, PETRI_PLACES=408, PETRI_TRANSITIONS=568} [2025-03-13 22:16:42,452 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 226 predicate places. [2025-03-13 22:16:42,452 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 568 transitions, 4915 flow [2025-03-13 22:16:42,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:42,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:42,453 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:42,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:16:42,453 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:42,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash -278668322, now seen corresponding path program 13 times [2025-03-13 22:16:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:42,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857310168] [2025-03-13 22:16:42,454 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 22:16:42,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:42,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-13 22:16:42,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:16:42,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:42,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:42,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:42,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857310168] [2025-03-13 22:16:42,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857310168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:42,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:42,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:42,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570814278] [2025-03-13 22:16:42,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:42,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:42,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:42,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:42,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:43,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:43,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 568 transitions, 4915 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:43,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:43,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:43,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:46,473 INFO L124 PetriNetUnfolderBase]: 4685/17399 cut-off events. [2025-03-13 22:16:46,473 INFO L125 PetriNetUnfolderBase]: For 62894/63727 co-relation queries the response was YES. [2025-03-13 22:16:46,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60279 conditions, 17399 events. 4685/17399 cut-off events. For 62894/63727 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 186392 event pairs, 453 based on Foata normal form. 184/17371 useless extension candidates. Maximal degree in co-relation 59930. Up to 2755 conditions per place. [2025-03-13 22:16:46,651 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 192 selfloop transitions, 66 changer transitions 0/638 dead transitions. [2025-03-13 22:16:46,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 638 transitions, 6128 flow [2025-03-13 22:16:46,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1473 transitions. [2025-03-13 22:16:46,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8992673992673993 [2025-03-13 22:16:46,652 INFO L175 Difference]: Start difference. First operand has 408 places, 568 transitions, 4915 flow. Second operand 9 states and 1473 transitions. [2025-03-13 22:16:46,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 638 transitions, 6128 flow [2025-03-13 22:16:46,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 638 transitions, 6031 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-03-13 22:16:46,937 INFO L231 Difference]: Finished difference. Result has 415 places, 577 transitions, 5143 flow [2025-03-13 22:16:46,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=4827, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5143, PETRI_PLACES=415, PETRI_TRANSITIONS=577} [2025-03-13 22:16:46,937 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 233 predicate places. [2025-03-13 22:16:46,937 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 577 transitions, 5143 flow [2025-03-13 22:16:46,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:46,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:46,938 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:46,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:16:46,939 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:46,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:46,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1673346218, now seen corresponding path program 14 times [2025-03-13 22:16:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:46,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100539515] [2025-03-13 22:16:46,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:16:46,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:46,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-13 22:16:46,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-13 22:16:46,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:16:46,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:47,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:47,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100539515] [2025-03-13 22:16:47,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100539515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:47,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:47,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:47,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093237775] [2025-03-13 22:16:47,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:47,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:47,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:47,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:47,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:47,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:47,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 577 transitions, 5143 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:47,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:47,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:47,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:50,990 INFO L124 PetriNetUnfolderBase]: 4684/17407 cut-off events. [2025-03-13 22:16:50,991 INFO L125 PetriNetUnfolderBase]: For 64298/65195 co-relation queries the response was YES. [2025-03-13 22:16:51,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60504 conditions, 17407 events. 4684/17407 cut-off events. For 64298/65195 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 186550 event pairs, 451 based on Foata normal form. 181/17374 useless extension candidates. Maximal degree in co-relation 60152. Up to 2755 conditions per place. [2025-03-13 22:16:51,174 INFO L140 encePairwiseOnDemand]: 167/182 looper letters, 202 selfloop transitions, 62 changer transitions 0/644 dead transitions. [2025-03-13 22:16:51,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 644 transitions, 6353 flow [2025-03-13 22:16:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1474 transitions. [2025-03-13 22:16:51,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8998778998778999 [2025-03-13 22:16:51,175 INFO L175 Difference]: Start difference. First operand has 415 places, 577 transitions, 5143 flow. Second operand 9 states and 1474 transitions. [2025-03-13 22:16:51,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 644 transitions, 6353 flow [2025-03-13 22:16:51,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 644 transitions, 6221 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-13 22:16:51,439 INFO L231 Difference]: Finished difference. Result has 422 places, 585 transitions, 5341 flow [2025-03-13 22:16:51,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=5019, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5341, PETRI_PLACES=422, PETRI_TRANSITIONS=585} [2025-03-13 22:16:51,440 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 240 predicate places. [2025-03-13 22:16:51,440 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 585 transitions, 5341 flow [2025-03-13 22:16:51,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:51,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:51,440 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:51,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:16:51,440 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:51,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1515371174, now seen corresponding path program 15 times [2025-03-13 22:16:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:51,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724852414] [2025-03-13 22:16:51,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:16:51,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:51,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:51,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-13 22:16:51,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 22:16:51,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:51,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:51,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724852414] [2025-03-13 22:16:51,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724852414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:51,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:51,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:51,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832898501] [2025-03-13 22:16:51,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:51,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:51,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:51,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:51,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:52,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:52,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 585 transitions, 5341 flow. Second operand has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:52,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:52,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:52,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:55,325 INFO L124 PetriNetUnfolderBase]: 4411/16574 cut-off events. [2025-03-13 22:16:55,325 INFO L125 PetriNetUnfolderBase]: For 61535/62336 co-relation queries the response was YES. [2025-03-13 22:16:55,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57539 conditions, 16574 events. 4411/16574 cut-off events. For 61535/62336 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 175856 event pairs, 450 based on Foata normal form. 164/16532 useless extension candidates. Maximal degree in co-relation 57183. Up to 2594 conditions per place. [2025-03-13 22:16:55,510 INFO L140 encePairwiseOnDemand]: 166/182 looper letters, 198 selfloop transitions, 64 changer transitions 0/642 dead transitions. [2025-03-13 22:16:55,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 642 transitions, 6405 flow [2025-03-13 22:16:55,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1476 transitions. [2025-03-13 22:16:55,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9010989010989011 [2025-03-13 22:16:55,512 INFO L175 Difference]: Start difference. First operand has 422 places, 585 transitions, 5341 flow. Second operand 9 states and 1476 transitions. [2025-03-13 22:16:55,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 642 transitions, 6405 flow [2025-03-13 22:16:55,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 642 transitions, 6289 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-03-13 22:16:55,805 INFO L231 Difference]: Finished difference. Result has 429 places, 592 transitions, 5531 flow [2025-03-13 22:16:55,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=5183, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5531, PETRI_PLACES=429, PETRI_TRANSITIONS=592} [2025-03-13 22:16:55,806 INFO L279 CegarLoopForPetriNet]: 182 programPoint places, 247 predicate places. [2025-03-13 22:16:55,806 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 592 transitions, 5531 flow [2025-03-13 22:16:55,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 154.77777777777777) internal successors, (1393), 9 states have internal predecessors, (1393), 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-13 22:16:55,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:55,807 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:16:55,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:16:55,807 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-13 22:16:55,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:55,808 INFO L85 PathProgramCache]: Analyzing trace with hash 321531544, now seen corresponding path program 16 times [2025-03-13 22:16:55,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:55,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150020185] [2025-03-13 22:16:55,808 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:16:55,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:55,818 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-13 22:16:55,829 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:16:55,829 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 22:16:55,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:16:56,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:56,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150020185] [2025-03-13 22:16:56,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150020185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:56,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:56,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:16:56,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131911919] [2025-03-13 22:16:56,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:56,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:16:56,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:56,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:16:56,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:16:57,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 182 [2025-03-13 22:16:57,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 592 transitions, 5531 flow. Second operand has 10 states, 10 states have (on average 154.6) internal successors, (1546), 10 states have internal predecessors, (1546), 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-13 22:16:57,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:57,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 182 [2025-03-13 22:16:57,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand