./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.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_02-funloop_norace.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 ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:15:43,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:15:43,970 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:43,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:15:43,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:15:43,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:15:43,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:15:43,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:15:43,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:15:43,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:15:43,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:15:43,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:15:43,990 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:15:43,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:15:43,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:15:43,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:15:43,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:15:43,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:15:43,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:15:43,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:15:43,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:15:43,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:15:43,992 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:15:43,992 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:15:43,992 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:15:43,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:15:43,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:15:43,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:15:43,993 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:15:43,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:15:43,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:15:43,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:15:43,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:15:43,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:15:43,993 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:15:43,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:15:43,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:15:43,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:15:43,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:15:43,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:15:43,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:15:43,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:15:43,994 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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 [2025-03-13 22:15:44,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:15:44,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:15:44,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:15:44,235 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:15:44,235 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:15:44,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2025-03-13 22:15:45,387 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4890efa6d/b794b8257cd047388aeb38e9b985fc41/FLAG04ff178f2 [2025-03-13 22:15:45,696 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:15:45,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_02-funloop_norace.i [2025-03-13 22:15:45,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4890efa6d/b794b8257cd047388aeb38e9b985fc41/FLAG04ff178f2 [2025-03-13 22:15:45,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4890efa6d/b794b8257cd047388aeb38e9b985fc41 [2025-03-13 22:15:45,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:15:45,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:15:45,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:15:45,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:15:45,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:15:45,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:15:45" (1/1) ... [2025-03-13 22:15:45,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bcc66c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:45, skipping insertion in model container [2025-03-13 22:15:45,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:15:45" (1/1) ... [2025-03-13 22:15:45,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:15:46,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:15:46,359 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:15:46,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:15:46,427 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:15:46,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:46 WrapperNode [2025-03-13 22:15:46,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:15:46,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:15:46,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:15:46,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:15:46,433 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:46" (1/1) ... [2025-03-13 22:15:46,441 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:46" (1/1) ... [2025-03-13 22:15:46,464 INFO L138 Inliner]: procedures = 263, calls = 70, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 147 [2025-03-13 22:15:46,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:15:46,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:15:46,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:15:46,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:15:46,469 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:46" (1/1) ... [2025-03-13 22:15:46,471 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:46" (1/1) ... [2025-03-13 22:15:46,473 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:46" (1/1) ... [2025-03-13 22:15:46,476 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:46" (1/1) ... [2025-03-13 22:15:46,487 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:46" (1/1) ... [2025-03-13 22:15:46,488 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:46" (1/1) ... [2025-03-13 22:15:46,489 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:46" (1/1) ... [2025-03-13 22:15:46,494 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:46" (1/1) ... [2025-03-13 22:15:46,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:15:46,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:15:46,496 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:15:46,496 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:15:46,497 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:46" (1/1) ... [2025-03-13 22:15:46,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:15:46,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:46,523 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:46,525 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:46,539 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:15:46,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:15:46,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:15:46,540 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:15:46,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:15:46,540 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:15:46,540 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:15:46,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:15:46,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:15:46,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:15:46,541 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:46,625 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:15:46,627 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:15:46,881 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:15:46,881 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:15:46,881 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:15:46,905 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:15:46,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:15:46 BoogieIcfgContainer [2025-03-13 22:15:46,907 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:15:46,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:15:46,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:15:46,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:15:46,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:15:45" (1/3) ... [2025-03-13 22:15:46,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161817b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:15:46, skipping insertion in model container [2025-03-13 22:15:46,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:15:46" (2/3) ... [2025-03-13 22:15:46,913 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161817b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:15:46, skipping insertion in model container [2025-03-13 22:15:46,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:15:46" (3/3) ... [2025-03-13 22:15:46,915 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2025-03-13 22:15:46,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:15:46,928 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_02-funloop_norace.i that has 2 procedures, 157 locations, 1 initial locations, 3 loop locations, and 4 error locations. [2025-03-13 22:15:46,929 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:15:46,988 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:15:47,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 159 transitions, 322 flow [2025-03-13 22:15:47,072 INFO L124 PetriNetUnfolderBase]: 3/158 cut-off events. [2025-03-13 22:15:47,074 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:15:47,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 158 events. 3/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 129 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2025-03-13 22:15:47,080 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 159 transitions, 322 flow [2025-03-13 22:15:47,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 158 transitions, 319 flow [2025-03-13 22:15:47,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:15:47,109 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;@1ab06dab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:15:47,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-13 22:15:47,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:15:47,139 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-03-13 22:15:47,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:15:47,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:47,140 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] [2025-03-13 22:15:47,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:47,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:47,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1988920771, now seen corresponding path program 1 times [2025-03-13 22:15:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:47,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375720889] [2025-03-13 22:15:47,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:47,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:47,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-13 22:15:47,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-13 22:15:47,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:47,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:47,481 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:47,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:47,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375720889] [2025-03-13 22:15:47,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375720889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:47,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:47,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:15:47,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564391580] [2025-03-13 22:15:47,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:47,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:15:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:47,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:15:47,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:15:47,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 159 [2025-03-13 22:15:47,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 158 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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:47,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:47,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 159 [2025-03-13 22:15:47,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:47,619 INFO L124 PetriNetUnfolderBase]: 11/244 cut-off events. [2025-03-13 22:15:47,622 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:15:47,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 244 events. 11/244 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 411 event pairs, 6 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 179. Up to 26 conditions per place. [2025-03-13 22:15:47,625 INFO L140 encePairwiseOnDemand]: 156/159 looper letters, 10 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-03-13 22:15:47,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 159 transitions, 345 flow [2025-03-13 22:15:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:15:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:15:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2025-03-13 22:15:47,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9580712788259959 [2025-03-13 22:15:47,638 INFO L175 Difference]: Start difference. First operand has 159 places, 158 transitions, 319 flow. Second operand 3 states and 457 transitions. [2025-03-13 22:15:47,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 159 transitions, 345 flow [2025-03-13 22:15:47,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 159 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:15:47,648 INFO L231 Difference]: Finished difference. Result has 161 places, 159 transitions, 330 flow [2025-03-13 22:15:47,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=161, PETRI_TRANSITIONS=159} [2025-03-13 22:15:47,653 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 2 predicate places. [2025-03-13 22:15:47,654 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 330 flow [2025-03-13 22:15:47,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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:47,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:47,655 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:47,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:15:47,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:47,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash 433133351, now seen corresponding path program 1 times [2025-03-13 22:15:47,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:47,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580764497] [2025-03-13 22:15:47,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:47,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:47,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-13 22:15:47,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 22:15:47,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:47,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:47,830 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:47,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580764497] [2025-03-13 22:15:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580764497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:15:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828252285] [2025-03-13 22:15:47,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:47,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:47,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:47,832 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:47,834 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:47,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-13 22:15:47,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-13 22:15:47,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:47,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:47,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 22:15:47,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:15:47,947 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:47,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:15:47,987 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:47,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828252285] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:15:47,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:15:47,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 22:15:47,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105411409] [2025-03-13 22:15:47,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:15:47,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:15:47,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:47,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:15:47,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:15:48,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 159 [2025-03-13 22:15:48,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 159 transitions, 330 flow. Second operand has 10 states, 10 states have (on average 147.0) internal successors, (1470), 10 states have internal predecessors, (1470), 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:48,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:48,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 159 [2025-03-13 22:15:48,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:48,143 INFO L124 PetriNetUnfolderBase]: 11/251 cut-off events. [2025-03-13 22:15:48,143 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:15:48,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 251 events. 11/251 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 400 event pairs, 6 based on Foata normal form. 2/238 useless extension candidates. Maximal degree in co-relation 217. Up to 26 conditions per place. [2025-03-13 22:15:48,147 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 14 selfloop transitions, 9 changer transitions 0/167 dead transitions. [2025-03-13 22:15:48,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 167 transitions, 394 flow [2025-03-13 22:15:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:15:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:15:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1330 transitions. [2025-03-13 22:15:48,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9294199860237596 [2025-03-13 22:15:48,151 INFO L175 Difference]: Start difference. First operand has 161 places, 159 transitions, 330 flow. Second operand 9 states and 1330 transitions. [2025-03-13 22:15:48,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 167 transitions, 394 flow [2025-03-13 22:15:48,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 167 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:15:48,155 INFO L231 Difference]: Finished difference. Result has 171 places, 165 transitions, 378 flow [2025-03-13 22:15:48,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=378, PETRI_PLACES=171, PETRI_TRANSITIONS=165} [2025-03-13 22:15:48,157 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 12 predicate places. [2025-03-13 22:15:48,157 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 165 transitions, 378 flow [2025-03-13 22:15:48,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 147.0) internal successors, (1470), 10 states have internal predecessors, (1470), 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:48,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:48,159 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:48,166 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:48,360 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:48,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:48,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:48,361 INFO L85 PathProgramCache]: Analyzing trace with hash 188541095, now seen corresponding path program 2 times [2025-03-13 22:15:48,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:48,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755594144] [2025-03-13 22:15:48,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:15:48,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:48,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-13 22:15:48,379 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:48,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:15:48,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:48,847 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:48,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:48,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755594144] [2025-03-13 22:15:48,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755594144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:48,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:48,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:15:48,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857643383] [2025-03-13 22:15:48,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:48,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:15:48,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:48,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:15:48,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:48,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 159 [2025-03-13 22:15:48,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 165 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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:48,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:48,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 159 [2025-03-13 22:15:48,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:49,145 INFO L124 PetriNetUnfolderBase]: 150/828 cut-off events. [2025-03-13 22:15:49,145 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:15:49,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 828 events. 150/828 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4582 event pairs, 62 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1045. Up to 240 conditions per place. [2025-03-13 22:15:49,152 INFO L140 encePairwiseOnDemand]: 148/159 looper letters, 30 selfloop transitions, 22 changer transitions 0/194 dead transitions. [2025-03-13 22:15:49,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 194 transitions, 540 flow [2025-03-13 22:15:49,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:15:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:15:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 869 transitions. [2025-03-13 22:15:49,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2025-03-13 22:15:49,155 INFO L175 Difference]: Start difference. First operand has 171 places, 165 transitions, 378 flow. Second operand 6 states and 869 transitions. [2025-03-13 22:15:49,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 194 transitions, 540 flow [2025-03-13 22:15:49,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 194 transitions, 534 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:15:49,163 INFO L231 Difference]: Finished difference. Result has 180 places, 186 transitions, 522 flow [2025-03-13 22:15:49,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=522, PETRI_PLACES=180, PETRI_TRANSITIONS=186} [2025-03-13 22:15:49,163 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 21 predicate places. [2025-03-13 22:15:49,163 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 186 transitions, 522 flow [2025-03-13 22:15:49,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:49,164 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:49,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:15:49,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:49,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash 525716816, now seen corresponding path program 1 times [2025-03-13 22:15:49,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:49,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380091204] [2025-03-13 22:15:49,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:49,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-13 22:15:49,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-13 22:15:49,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:49,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:49,346 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:49,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:49,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380091204] [2025-03-13 22:15:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380091204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:15:49,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144147494] [2025-03-13 22:15:49,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:49,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:49,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:49,350 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:49,351 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:49,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-13 22:15:49,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-13 22:15:49,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:49,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:49,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:15:49,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:15:49,476 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:49,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:15:49,571 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:49,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144147494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:15:49,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:15:49,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-13 22:15:49,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192638508] [2025-03-13 22:15:49,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:15:49,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 22:15:49,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:49,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 22:15:49,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:15:49,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 159 [2025-03-13 22:15:49,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 186 transitions, 522 flow. Second operand has 18 states, 18 states have (on average 147.0) internal successors, (2646), 18 states have internal predecessors, (2646), 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,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:49,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 159 [2025-03-13 22:15:49,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:49,822 INFO L124 PetriNetUnfolderBase]: 58/571 cut-off events. [2025-03-13 22:15:49,822 INFO L125 PetriNetUnfolderBase]: For 50/53 co-relation queries the response was YES. [2025-03-13 22:15:49,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 571 events. 58/571 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2200 event pairs, 11 based on Foata normal form. 4/540 useless extension candidates. Maximal degree in co-relation 669. Up to 63 conditions per place. [2025-03-13 22:15:49,826 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 18 selfloop transitions, 21 changer transitions 0/204 dead transitions. [2025-03-13 22:15:49,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 204 transitions, 688 flow [2025-03-13 22:15:49,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 22:15:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 22:15:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3088 transitions. [2025-03-13 22:15:49,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9248277927523211 [2025-03-13 22:15:49,833 INFO L175 Difference]: Start difference. First operand has 180 places, 186 transitions, 522 flow. Second operand 21 states and 3088 transitions. [2025-03-13 22:15:49,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 204 transitions, 688 flow [2025-03-13 22:15:49,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 204 transitions, 688 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:15:49,839 INFO L231 Difference]: Finished difference. Result has 205 places, 199 transitions, 652 flow [2025-03-13 22:15:49,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=652, PETRI_PLACES=205, PETRI_TRANSITIONS=199} [2025-03-13 22:15:49,840 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 46 predicate places. [2025-03-13 22:15:49,841 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 199 transitions, 652 flow [2025-03-13 22:15:49,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 147.0) internal successors, (2646), 18 states have internal predecessors, (2646), 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,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:49,842 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:49,849 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,046 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,SelfDestructingSolverStorable3 [2025-03-13 22:15:50,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:50,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash -367144880, now seen corresponding path program 2 times [2025-03-13 22:15:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:50,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598766998] [2025-03-13 22:15:50,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:15:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:50,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-03-13 22:15:50,074 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:50,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:15:50,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:50,332 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:50,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:50,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598766998] [2025-03-13 22:15:50,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598766998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:50,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:50,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:15:50,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832109582] [2025-03-13 22:15:50,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:50,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:15:50,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:50,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:15:50,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:50,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 159 [2025-03-13 22:15:50,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 199 transitions, 652 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:50,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 159 [2025-03-13 22:15:50,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:50,625 INFO L124 PetriNetUnfolderBase]: 206/1098 cut-off events. [2025-03-13 22:15:50,626 INFO L125 PetriNetUnfolderBase]: For 224/244 co-relation queries the response was YES. [2025-03-13 22:15:50,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1098 events. 206/1098 cut-off events. For 224/244 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6584 event pairs, 62 based on Foata normal form. 5/1041 useless extension candidates. Maximal degree in co-relation 1691. Up to 330 conditions per place. [2025-03-13 22:15:50,631 INFO L140 encePairwiseOnDemand]: 148/159 looper letters, 47 selfloop transitions, 30 changer transitions 0/236 dead transitions. [2025-03-13 22:15:50,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 236 transitions, 922 flow [2025-03-13 22:15:50,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:15:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:15:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 869 transitions. [2025-03-13 22:15:50,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910901467505241 [2025-03-13 22:15:50,633 INFO L175 Difference]: Start difference. First operand has 205 places, 199 transitions, 652 flow. Second operand 6 states and 869 transitions. [2025-03-13 22:15:50,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 236 transitions, 922 flow [2025-03-13 22:15:50,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 236 transitions, 898 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-13 22:15:50,638 INFO L231 Difference]: Finished difference. Result has 209 places, 228 transitions, 878 flow [2025-03-13 22:15:50,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=878, PETRI_PLACES=209, PETRI_TRANSITIONS=228} [2025-03-13 22:15:50,638 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 50 predicate places. [2025-03-13 22:15:50,639 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 228 transitions, 878 flow [2025-03-13 22:15:50,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:50,639 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:50,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:15:50,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:50,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash -129760487, now seen corresponding path program 1 times [2025-03-13 22:15:50,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:50,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785492606] [2025-03-13 22:15:50,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:50,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:50,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-13 22:15:50,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-13 22:15:50,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:50,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:50,948 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:50,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:50,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785492606] [2025-03-13 22:15:50,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785492606] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:15:50,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638731715] [2025-03-13 22:15:50,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:50,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:50,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:15:50,951 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:50,952 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,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-13 22:15:51,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-13 22:15:51,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:51,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:51,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 22:15:51,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:15:51,125 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:51,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:15:51,295 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:51,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638731715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:15:51,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:15:51,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-13 22:15:51,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589007119] [2025-03-13 22:15:51,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:15:51,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 22:15:51,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:51,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 22:15:51,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-13 22:15:51,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 159 [2025-03-13 22:15:51,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 228 transitions, 878 flow. Second operand has 23 states, 23 states have (on average 147.08695652173913) internal successors, (3383), 23 states have internal predecessors, (3383), 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,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:51,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 159 [2025-03-13 22:15:51,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:51,670 INFO L124 PetriNetUnfolderBase]: 114/841 cut-off events. [2025-03-13 22:15:51,670 INFO L125 PetriNetUnfolderBase]: For 345/358 co-relation queries the response was YES. [2025-03-13 22:15:51,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 841 events. 114/841 cut-off events. For 345/358 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4317 event pairs, 14 based on Foata normal form. 8/811 useless extension candidates. Maximal degree in co-relation 1300. Up to 84 conditions per place. [2025-03-13 22:15:51,675 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 21 selfloop transitions, 30 changer transitions 0/245 dead transitions. [2025-03-13 22:15:51,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 245 transitions, 1102 flow [2025-03-13 22:15:51,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-13 22:15:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-13 22:15:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4404 transitions. [2025-03-13 22:15:51,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9232704402515723 [2025-03-13 22:15:51,681 INFO L175 Difference]: Start difference. First operand has 209 places, 228 transitions, 878 flow. Second operand 30 states and 4404 transitions. [2025-03-13 22:15:51,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 245 transitions, 1102 flow [2025-03-13 22:15:51,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 245 transitions, 1102 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:15:51,687 INFO L231 Difference]: Finished difference. Result has 242 places, 238 transitions, 1030 flow [2025-03-13 22:15:51,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1030, PETRI_PLACES=242, PETRI_TRANSITIONS=238} [2025-03-13 22:15:51,688 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 83 predicate places. [2025-03-13 22:15:51,688 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 238 transitions, 1030 flow [2025-03-13 22:15:51,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 147.08695652173913) internal successors, (3383), 23 states have internal predecessors, (3383), 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,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:51,690 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:51,696 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:51,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:15:51,890 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:51,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:51,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1886927285, now seen corresponding path program 2 times [2025-03-13 22:15:51,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:51,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775004568] [2025-03-13 22:15:51,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:15:51,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:51,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-03-13 22:15:51,907 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:51,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:15:51,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:52,126 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:52,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:52,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775004568] [2025-03-13 22:15:52,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775004568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:52,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:52,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:15:52,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936139014] [2025-03-13 22:15:52,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:52,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:15:52,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:52,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:15:52,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:52,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 159 [2025-03-13 22:15:52,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 238 transitions, 1030 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:52,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 159 [2025-03-13 22:15:52,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:52,481 INFO L124 PetriNetUnfolderBase]: 422/1653 cut-off events. [2025-03-13 22:15:52,482 INFO L125 PetriNetUnfolderBase]: For 1006/1048 co-relation queries the response was YES. [2025-03-13 22:15:52,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 1653 events. 422/1653 cut-off events. For 1006/1048 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 10549 event pairs, 107 based on Foata normal form. 12/1574 useless extension candidates. Maximal degree in co-relation 3386. Up to 718 conditions per place. [2025-03-13 22:15:52,489 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 76 selfloop transitions, 57 changer transitions 0/293 dead transitions. [2025-03-13 22:15:52,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 293 transitions, 1540 flow [2025-03-13 22:15:52,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:15:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:15:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2025-03-13 22:15:52,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2025-03-13 22:15:52,492 INFO L175 Difference]: Start difference. First operand has 242 places, 238 transitions, 1030 flow. Second operand 6 states and 855 transitions. [2025-03-13 22:15:52,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 293 transitions, 1540 flow [2025-03-13 22:15:52,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 293 transitions, 1494 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-13 22:15:52,499 INFO L231 Difference]: Finished difference. Result has 234 places, 285 transitions, 1482 flow [2025-03-13 22:15:52,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1482, PETRI_PLACES=234, PETRI_TRANSITIONS=285} [2025-03-13 22:15:52,500 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 75 predicate places. [2025-03-13 22:15:52,500 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 285 transitions, 1482 flow [2025-03-13 22:15:52,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:52,500 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:52,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:15:52,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:52,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:52,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2013589520, now seen corresponding path program 1 times [2025-03-13 22:15:52,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:52,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560020471] [2025-03-13 22:15:52,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:52,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:52,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-13 22:15:52,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-13 22:15:52,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:52,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:52,864 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:52,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:52,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560020471] [2025-03-13 22:15:52,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560020471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:52,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:52,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:15:52,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656759124] [2025-03-13 22:15:52,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:52,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:15:52,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:52,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:15:52,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:15:52,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 159 [2025-03-13 22:15:52,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 285 transitions, 1482 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:52,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 159 [2025-03-13 22:15:52,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:53,249 INFO L124 PetriNetUnfolderBase]: 542/2093 cut-off events. [2025-03-13 22:15:53,249 INFO L125 PetriNetUnfolderBase]: For 2297/2353 co-relation queries the response was YES. [2025-03-13 22:15:53,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5260 conditions, 2093 events. 542/2093 cut-off events. For 2297/2353 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14590 event pairs, 113 based on Foata normal form. 13/2020 useless extension candidates. Maximal degree in co-relation 5000. Up to 894 conditions per place. [2025-03-13 22:15:53,260 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 113 selfloop transitions, 71 changer transitions 0/346 dead transitions. [2025-03-13 22:15:53,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 346 transitions, 2204 flow [2025-03-13 22:15:53,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:15:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:15:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2025-03-13 22:15:53,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2025-03-13 22:15:53,262 INFO L175 Difference]: Start difference. First operand has 234 places, 285 transitions, 1482 flow. Second operand 6 states and 855 transitions. [2025-03-13 22:15:53,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 346 transitions, 2204 flow [2025-03-13 22:15:53,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 346 transitions, 2140 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-03-13 22:15:53,274 INFO L231 Difference]: Finished difference. Result has 244 places, 338 transitions, 2094 flow [2025-03-13 22:15:53,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2094, PETRI_PLACES=244, PETRI_TRANSITIONS=338} [2025-03-13 22:15:53,275 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 85 predicate places. [2025-03-13 22:15:53,275 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 338 transitions, 2094 flow [2025-03-13 22:15:53,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:53,276 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:53,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:15:53,276 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:53,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash 476073459, now seen corresponding path program 1 times [2025-03-13 22:15:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:53,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633754288] [2025-03-13 22:15:53,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:15:53,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:53,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-13 22:15:53,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:15:53,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:15:53,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:53,651 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:53,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:53,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633754288] [2025-03-13 22:15:53,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633754288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:53,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:53,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:15:53,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132943245] [2025-03-13 22:15:53,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:53,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:15:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:53,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:15:53,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:15:54,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:15:54,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 338 transitions, 2094 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:54,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:15:54,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:55,244 INFO L124 PetriNetUnfolderBase]: 1064/4158 cut-off events. [2025-03-13 22:15:55,245 INFO L125 PetriNetUnfolderBase]: For 5423/5551 co-relation queries the response was YES. [2025-03-13 22:15:55,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11502 conditions, 4158 events. 1064/4158 cut-off events. For 5423/5551 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 33116 event pairs, 151 based on Foata normal form. 45/4180 useless extension candidates. Maximal degree in co-relation 11225. Up to 580 conditions per place. [2025-03-13 22:15:55,273 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 68 selfloop transitions, 15 changer transitions 3/397 dead transitions. [2025-03-13 22:15:55,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 397 transitions, 2384 flow [2025-03-13 22:15:55,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:15:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:15:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1277 transitions. [2025-03-13 22:15:55,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8923829489867225 [2025-03-13 22:15:55,276 INFO L175 Difference]: Start difference. First operand has 244 places, 338 transitions, 2094 flow. Second operand 9 states and 1277 transitions. [2025-03-13 22:15:55,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 397 transitions, 2384 flow [2025-03-13 22:15:55,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 397 transitions, 2302 flow, removed 41 selfloop flow, removed 0 redundant places. [2025-03-13 22:15:55,309 INFO L231 Difference]: Finished difference. Result has 259 places, 353 transitions, 2130 flow [2025-03-13 22:15:55,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2130, PETRI_PLACES=259, PETRI_TRANSITIONS=353} [2025-03-13 22:15:55,310 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 100 predicate places. [2025-03-13 22:15:55,310 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 353 transitions, 2130 flow [2025-03-13 22:15:55,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:55,311 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:55,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:15:55,311 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:55,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1884975981, now seen corresponding path program 2 times [2025-03-13 22:15:55,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:55,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888836884] [2025-03-13 22:15:55,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:15:55,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:55,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-13 22:15:55,334 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:55,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:15:55,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:55,656 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,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:55,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888836884] [2025-03-13 22:15:55,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888836884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:55,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:55,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:15:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636657378] [2025-03-13 22:15:55,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:55,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:15:55,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:55,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:15:55,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:15:56,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:15:56,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 353 transitions, 2130 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:56,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:15:56,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:15:57,591 INFO L124 PetriNetUnfolderBase]: 2043/7618 cut-off events. [2025-03-13 22:15:57,592 INFO L125 PetriNetUnfolderBase]: For 10660/10922 co-relation queries the response was YES. [2025-03-13 22:15:57,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22390 conditions, 7618 events. 2043/7618 cut-off events. For 10660/10922 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 68419 event pairs, 280 based on Foata normal form. 85/7653 useless extension candidates. Maximal degree in co-relation 22105. Up to 1204 conditions per place. [2025-03-13 22:15:57,643 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 107 selfloop transitions, 20 changer transitions 6/444 dead transitions. [2025-03-13 22:15:57,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 444 transitions, 2796 flow [2025-03-13 22:15:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:15:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:15:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1276 transitions. [2025-03-13 22:15:57,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8916841369671559 [2025-03-13 22:15:57,646 INFO L175 Difference]: Start difference. First operand has 259 places, 353 transitions, 2130 flow. Second operand 9 states and 1276 transitions. [2025-03-13 22:15:57,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 444 transitions, 2796 flow [2025-03-13 22:15:57,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 444 transitions, 2796 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:15:57,692 INFO L231 Difference]: Finished difference. Result has 274 places, 370 transitions, 2310 flow [2025-03-13 22:15:57,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2310, PETRI_PLACES=274, PETRI_TRANSITIONS=370} [2025-03-13 22:15:57,694 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 115 predicate places. [2025-03-13 22:15:57,694 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 370 transitions, 2310 flow [2025-03-13 22:15:57,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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:57,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:15:57,695 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:57,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:15:57,695 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:15:57,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:15:57,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1125012511, now seen corresponding path program 3 times [2025-03-13 22:15:57,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:15:57,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002685091] [2025-03-13 22:15:57,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:15:57,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:15:57,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:15:57,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-13 22:15:57,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 22:15:57,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:15:58,046 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:58,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:15:58,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002685091] [2025-03-13 22:15:58,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002685091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:15:58,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:15:58,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:15:58,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854503251] [2025-03-13 22:15:58,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:15:58,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:15:58,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:15:58,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:15:58,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:15:59,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:15:59,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 370 transitions, 2310 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:15:59,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:15:59,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:00,352 INFO L124 PetriNetUnfolderBase]: 2340/8659 cut-off events. [2025-03-13 22:16:00,352 INFO L125 PetriNetUnfolderBase]: For 14349/14746 co-relation queries the response was YES. [2025-03-13 22:16:00,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26794 conditions, 8659 events. 2340/8659 cut-off events. For 14349/14746 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 79094 event pairs, 290 based on Foata normal form. 94/8697 useless extension candidates. Maximal degree in co-relation 26501. Up to 1318 conditions per place. [2025-03-13 22:16:00,420 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 119 selfloop transitions, 22 changer transitions 2/454 dead transitions. [2025-03-13 22:16:00,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 454 transitions, 3094 flow [2025-03-13 22:16:00,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:00,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1281 transitions. [2025-03-13 22:16:00,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951781970649895 [2025-03-13 22:16:00,424 INFO L175 Difference]: Start difference. First operand has 274 places, 370 transitions, 2310 flow. Second operand 9 states and 1281 transitions. [2025-03-13 22:16:00,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 454 transitions, 3094 flow [2025-03-13 22:16:00,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 454 transitions, 3056 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:00,498 INFO L231 Difference]: Finished difference. Result has 287 places, 382 transitions, 2479 flow [2025-03-13 22:16:00,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2296, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2479, PETRI_PLACES=287, PETRI_TRANSITIONS=382} [2025-03-13 22:16:00,499 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 128 predicate places. [2025-03-13 22:16:00,499 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 382 transitions, 2479 flow [2025-03-13 22:16:00,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:00,500 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:00,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:16:00,500 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:00,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1620779797, now seen corresponding path program 4 times [2025-03-13 22:16:00,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:00,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151533587] [2025-03-13 22:16:00,501 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:16:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:00,627 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-13 22:16:00,643 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:00,644 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 22:16:00,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:01,642 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:01,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:01,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151533587] [2025-03-13 22:16:01,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151533587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:01,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:01,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-13 22:16:01,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062269079] [2025-03-13 22:16:01,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:01,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 22:16:01,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:01,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 22:16:01,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-13 22:16:02,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 159 [2025-03-13 22:16:02,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 382 transitions, 2479 flow. Second operand has 15 states, 15 states have (on average 117.53333333333333) internal successors, (1763), 15 states have internal predecessors, (1763), 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:02,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:02,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 159 [2025-03-13 22:16:02,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:05,583 INFO L124 PetriNetUnfolderBase]: 4335/12704 cut-off events. [2025-03-13 22:16:05,584 INFO L125 PetriNetUnfolderBase]: For 34829/35231 co-relation queries the response was YES. [2025-03-13 22:16:05,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46187 conditions, 12704 events. 4335/12704 cut-off events. For 34829/35231 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 113798 event pairs, 834 based on Foata normal form. 151/12748 useless extension candidates. Maximal degree in co-relation 45888. Up to 3023 conditions per place. [2025-03-13 22:16:05,669 INFO L140 encePairwiseOnDemand]: 132/159 looper letters, 612 selfloop transitions, 143 changer transitions 6/931 dead transitions. [2025-03-13 22:16:05,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 931 transitions, 8571 flow [2025-03-13 22:16:05,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 22:16:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 22:16:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2255 transitions. [2025-03-13 22:16:05,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8342582315945246 [2025-03-13 22:16:05,672 INFO L175 Difference]: Start difference. First operand has 287 places, 382 transitions, 2479 flow. Second operand 17 states and 2255 transitions. [2025-03-13 22:16:05,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 931 transitions, 8571 flow [2025-03-13 22:16:05,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 931 transitions, 8426 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-13 22:16:05,780 INFO L231 Difference]: Finished difference. Result has 313 places, 511 transitions, 4454 flow [2025-03-13 22:16:05,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4454, PETRI_PLACES=313, PETRI_TRANSITIONS=511} [2025-03-13 22:16:05,782 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 154 predicate places. [2025-03-13 22:16:05,783 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 511 transitions, 4454 flow [2025-03-13 22:16:05,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 117.53333333333333) internal successors, (1763), 15 states have internal predecessors, (1763), 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,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:05,784 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,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:16:05,784 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:05,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:05,785 INFO L85 PathProgramCache]: Analyzing trace with hash -579763471, now seen corresponding path program 1 times [2025-03-13 22:16:05,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:05,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105152881] [2025-03-13 22:16:05,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:16:05,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:05,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-13 22:16:05,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:16:05,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:05,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:06,053 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:06,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:06,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105152881] [2025-03-13 22:16:06,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105152881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:06,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:06,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:06,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192908187] [2025-03-13 22:16:06,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:06,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:06,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:06,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:06,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:06,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:16:06,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 511 transitions, 4454 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:06,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:16:06,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:08,595 INFO L124 PetriNetUnfolderBase]: 3085/11186 cut-off events. [2025-03-13 22:16:08,595 INFO L125 PetriNetUnfolderBase]: For 34656/35415 co-relation queries the response was YES. [2025-03-13 22:16:08,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38952 conditions, 11186 events. 3085/11186 cut-off events. For 34656/35415 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 107972 event pairs, 310 based on Foata normal form. 143/11237 useless extension candidates. Maximal degree in co-relation 38641. Up to 1753 conditions per place. [2025-03-13 22:16:08,671 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 142 selfloop transitions, 42 changer transitions 1/594 dead transitions. [2025-03-13 22:16:08,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 594 transitions, 5518 flow [2025-03-13 22:16:08,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1284 transitions. [2025-03-13 22:16:08,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8972746331236897 [2025-03-13 22:16:08,788 INFO L175 Difference]: Start difference. First operand has 313 places, 511 transitions, 4454 flow. Second operand 9 states and 1284 transitions. [2025-03-13 22:16:08,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 594 transitions, 5518 flow [2025-03-13 22:16:08,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 594 transitions, 5414 flow, removed 23 selfloop flow, removed 2 redundant places. [2025-03-13 22:16:08,923 INFO L231 Difference]: Finished difference. Result has 325 places, 527 transitions, 4729 flow [2025-03-13 22:16:08,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4393, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4729, PETRI_PLACES=325, PETRI_TRANSITIONS=527} [2025-03-13 22:16:08,923 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 166 predicate places. [2025-03-13 22:16:08,923 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 527 transitions, 4729 flow [2025-03-13 22:16:08,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:08,924 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,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:16:08,924 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:08,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash -215192421, now seen corresponding path program 5 times [2025-03-13 22:16:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:08,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69433417] [2025-03-13 22:16:08,925 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:16:08,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:08,935 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:08,946 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,946 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-13 22:16:08,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:09,395 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,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:09,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69433417] [2025-03-13 22:16:09,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69433417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:16:09,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219899959] [2025-03-13 22:16:09,395 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:16:09,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:16:09,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:16:09,397 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:16:09,399 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:16:09,459 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:09,508 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,509 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-13 22:16:09,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:09,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-13 22:16:09,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:16:09,722 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,797 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,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:16:09,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219899959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:09,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 22:16:09,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-13 22:16:09,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106815743] [2025-03-13 22:16:09,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:09,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:16:09,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:09,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:16:09,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:16:10,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:16:10,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 527 transitions, 4729 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:10,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:16:10,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:12,822 INFO L124 PetriNetUnfolderBase]: 3411/12435 cut-off events. [2025-03-13 22:16:12,822 INFO L125 PetriNetUnfolderBase]: For 42620/43369 co-relation queries the response was YES. [2025-03-13 22:16:12,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44350 conditions, 12435 events. 3411/12435 cut-off events. For 42620/43369 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 123195 event pairs, 334 based on Foata normal form. 148/12490 useless extension candidates. Maximal degree in co-relation 44032. Up to 2022 conditions per place. [2025-03-13 22:16:12,966 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 159 selfloop transitions, 44 changer transitions 2/614 dead transitions. [2025-03-13 22:16:12,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 614 transitions, 5929 flow [2025-03-13 22:16:12,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:16:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:16:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1416 transitions. [2025-03-13 22:16:12,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905660377358491 [2025-03-13 22:16:12,967 INFO L175 Difference]: Start difference. First operand has 325 places, 527 transitions, 4729 flow. Second operand 10 states and 1416 transitions. [2025-03-13 22:16:12,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 614 transitions, 5929 flow [2025-03-13 22:16:13,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 614 transitions, 5816 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-03-13 22:16:13,180 INFO L231 Difference]: Finished difference. Result has 338 places, 545 transitions, 5017 flow [2025-03-13 22:16:13,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4651, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5017, PETRI_PLACES=338, PETRI_TRANSITIONS=545} [2025-03-13 22:16:13,181 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 179 predicate places. [2025-03-13 22:16:13,181 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 545 transitions, 5017 flow [2025-03-13 22:16:13,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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:13,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:13,181 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:13,188 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:16:13,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:16:13,382 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:13,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash -522124029, now seen corresponding path program 6 times [2025-03-13 22:16:13,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:13,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099648660] [2025-03-13 22:16:13,383 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 22:16:13,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:13,397 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:13,403 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,403 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 22:16:13,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:13,640 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,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:13,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099648660] [2025-03-13 22:16:13,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099648660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:13,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:13,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:13,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11304670] [2025-03-13 22:16:13,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:13,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:13,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:13,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:13,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:14,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:16:14,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 545 transitions, 5017 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:14,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:16:14,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:16,646 INFO L124 PetriNetUnfolderBase]: 3770/13637 cut-off events. [2025-03-13 22:16:16,646 INFO L125 PetriNetUnfolderBase]: For 51778/52691 co-relation queries the response was YES. [2025-03-13 22:16:16,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49697 conditions, 13637 events. 3770/13637 cut-off events. For 51778/52691 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 137997 event pairs, 416 based on Foata normal form. 153/13668 useless extension candidates. Maximal degree in co-relation 49372. Up to 2177 conditions per place. [2025-03-13 22:16:16,782 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 158 selfloop transitions, 53 changer transitions 0/620 dead transitions. [2025-03-13 22:16:16,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 620 transitions, 6229 flow [2025-03-13 22:16:16,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2025-03-13 22:16:16,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8986722571628232 [2025-03-13 22:16:16,783 INFO L175 Difference]: Start difference. First operand has 338 places, 545 transitions, 5017 flow. Second operand 9 states and 1286 transitions. [2025-03-13 22:16:16,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 620 transitions, 6229 flow [2025-03-13 22:16:17,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 620 transitions, 6141 flow, removed 19 selfloop flow, removed 3 redundant places. [2025-03-13 22:16:17,017 INFO L231 Difference]: Finished difference. Result has 350 places, 568 transitions, 5486 flow [2025-03-13 22:16:17,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=4951, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5486, PETRI_PLACES=350, PETRI_TRANSITIONS=568} [2025-03-13 22:16:17,018 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 191 predicate places. [2025-03-13 22:16:17,018 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 568 transitions, 5486 flow [2025-03-13 22:16:17,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:17,019 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:17,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:16:17,019 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:17,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:17,020 INFO L85 PathProgramCache]: Analyzing trace with hash -702967217, now seen corresponding path program 7 times [2025-03-13 22:16:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:17,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905269021] [2025-03-13 22:16:17,020 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 22:16:17,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:17,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-13 22:16:17,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:16:17,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:17,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:17,220 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:17,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:17,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905269021] [2025-03-13 22:16:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905269021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:17,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799058961] [2025-03-13 22:16:17,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:17,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:17,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:17,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:17,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:17,654 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:16:17,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 568 transitions, 5486 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:17,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:16:17,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:19,896 INFO L124 PetriNetUnfolderBase]: 4376/15596 cut-off events. [2025-03-13 22:16:19,896 INFO L125 PetriNetUnfolderBase]: For 65697/66731 co-relation queries the response was YES. [2025-03-13 22:16:20,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58157 conditions, 15596 events. 4376/15596 cut-off events. For 65697/66731 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 163209 event pairs, 427 based on Foata normal form. 184/15644 useless extension candidates. Maximal degree in co-relation 57826. Up to 2559 conditions per place. [2025-03-13 22:16:20,049 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 185 selfloop transitions, 58 changer transitions 0/652 dead transitions. [2025-03-13 22:16:20,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 652 transitions, 6901 flow [2025-03-13 22:16:20,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1288 transitions. [2025-03-13 22:16:20,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9000698812019566 [2025-03-13 22:16:20,051 INFO L175 Difference]: Start difference. First operand has 350 places, 568 transitions, 5486 flow. Second operand 9 states and 1288 transitions. [2025-03-13 22:16:20,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 652 transitions, 6901 flow [2025-03-13 22:16:20,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 652 transitions, 6803 flow, removed 49 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:20,330 INFO L231 Difference]: Finished difference. Result has 365 places, 586 transitions, 5906 flow [2025-03-13 22:16:20,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=5388, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=568, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5906, PETRI_PLACES=365, PETRI_TRANSITIONS=586} [2025-03-13 22:16:20,330 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 206 predicate places. [2025-03-13 22:16:20,330 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 586 transitions, 5906 flow [2025-03-13 22:16:20,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:20,331 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,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:16:20,331 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:20,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:20,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1403960185, now seen corresponding path program 8 times [2025-03-13 22:16:20,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:20,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509154662] [2025-03-13 22:16:20,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:16:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:20,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-13 22:16:20,344 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,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:16:20,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:20,485 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,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:20,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509154662] [2025-03-13 22:16:20,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509154662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:20,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:20,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:20,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273582090] [2025-03-13 22:16:20,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:20,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:20,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:20,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:20,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:21,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:16:21,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 586 transitions, 5906 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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:21,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:21,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:16:21,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:23,435 INFO L124 PetriNetUnfolderBase]: 4386/15633 cut-off events. [2025-03-13 22:16:23,435 INFO L125 PetriNetUnfolderBase]: For 72248/73424 co-relation queries the response was YES. [2025-03-13 22:16:23,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59365 conditions, 15633 events. 4386/15633 cut-off events. For 72248/73424 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 163949 event pairs, 378 based on Foata normal form. 281/15799 useless extension candidates. Maximal degree in co-relation 59026. Up to 2511 conditions per place. [2025-03-13 22:16:23,592 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 193 selfloop transitions, 75 changer transitions 2/679 dead transitions. [2025-03-13 22:16:23,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 679 transitions, 7320 flow [2025-03-13 22:16:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:23,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1279 transitions. [2025-03-13 22:16:23,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.893780573025856 [2025-03-13 22:16:23,594 INFO L175 Difference]: Start difference. First operand has 365 places, 586 transitions, 5906 flow. Second operand 9 states and 1279 transitions. [2025-03-13 22:16:23,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 679 transitions, 7320 flow [2025-03-13 22:16:23,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 679 transitions, 7230 flow, removed 45 selfloop flow, removed 0 redundant places. [2025-03-13 22:16:23,912 INFO L231 Difference]: Finished difference. Result has 377 places, 598 transitions, 6178 flow [2025-03-13 22:16:23,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=5818, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6178, PETRI_PLACES=377, PETRI_TRANSITIONS=598} [2025-03-13 22:16:23,913 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 218 predicate places. [2025-03-13 22:16:23,913 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 598 transitions, 6178 flow [2025-03-13 22:16:23,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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:23,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:23,913 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:23,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:16:23,913 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:23,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:23,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1762530997, now seen corresponding path program 9 times [2025-03-13 22:16:23,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:23,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38979580] [2025-03-13 22:16:23,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:16:23,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:23,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:23,927 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:23,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 22:16:23,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:24,072 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,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:24,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38979580] [2025-03-13 22:16:24,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38979580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:24,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:24,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:24,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369757924] [2025-03-13 22:16:24,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:24,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:24,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:24,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:24,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:24,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:16:24,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 598 transitions, 6178 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:24,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:16:24,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:27,131 INFO L124 PetriNetUnfolderBase]: 4105/14817 cut-off events. [2025-03-13 22:16:27,131 INFO L125 PetriNetUnfolderBase]: For 73672/74743 co-relation queries the response was YES. [2025-03-13 22:16:27,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57107 conditions, 14817 events. 4105/14817 cut-off events. For 73672/74743 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 153497 event pairs, 370 based on Foata normal form. 244/14955 useless extension candidates. Maximal degree in co-relation 56763. Up to 2341 conditions per place. [2025-03-13 22:16:27,335 INFO L140 encePairwiseOnDemand]: 145/159 looper letters, 194 selfloop transitions, 71 changer transitions 2/676 dead transitions. [2025-03-13 22:16:27,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 676 transitions, 7478 flow [2025-03-13 22:16:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1277 transitions. [2025-03-13 22:16:27,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8923829489867225 [2025-03-13 22:16:27,337 INFO L175 Difference]: Start difference. First operand has 377 places, 598 transitions, 6178 flow. Second operand 9 states and 1277 transitions. [2025-03-13 22:16:27,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 676 transitions, 7478 flow [2025-03-13 22:16:27,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 676 transitions, 7262 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-03-13 22:16:27,648 INFO L231 Difference]: Finished difference. Result has 384 places, 601 transitions, 6210 flow [2025-03-13 22:16:27,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=5974, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6210, PETRI_PLACES=384, PETRI_TRANSITIONS=601} [2025-03-13 22:16:27,649 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 225 predicate places. [2025-03-13 22:16:27,649 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 601 transitions, 6210 flow [2025-03-13 22:16:27,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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:27,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:27,649 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:27,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:16:27,649 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:27,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash -892664877, now seen corresponding path program 10 times [2025-03-13 22:16:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:27,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140486362] [2025-03-13 22:16:27,651 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:16:27,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:27,660 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-13 22:16:27,668 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:27,668 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 22:16:27,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:28,095 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:28,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:28,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140486362] [2025-03-13 22:16:28,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140486362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:28,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:28,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-13 22:16:28,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806134112] [2025-03-13 22:16:28,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:28,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 22:16:28,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:28,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 22:16:28,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-13 22:16:28,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 159 [2025-03-13 22:16:28,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 601 transitions, 6210 flow. Second operand has 15 states, 15 states have (on average 118.46666666666667) internal successors, (1777), 15 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:28,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:28,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 159 [2025-03-13 22:16:28,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:32,910 INFO L124 PetriNetUnfolderBase]: 6452/19074 cut-off events. [2025-03-13 22:16:32,910 INFO L125 PetriNetUnfolderBase]: For 127202/128477 co-relation queries the response was YES. [2025-03-13 22:16:33,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85166 conditions, 19074 events. 6452/19074 cut-off events. For 127202/128477 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 188051 event pairs, 1066 based on Foata normal form. 453/19393 useless extension candidates. Maximal degree in co-relation 84819. Up to 5840 conditions per place. [2025-03-13 22:16:33,073 INFO L140 encePairwiseOnDemand]: 132/159 looper letters, 745 selfloop transitions, 315 changer transitions 3/1235 dead transitions. [2025-03-13 22:16:33,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 1235 transitions, 15081 flow [2025-03-13 22:16:33,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-13 22:16:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-13 22:16:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2615 transitions. [2025-03-13 22:16:33,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8223270440251572 [2025-03-13 22:16:33,075 INFO L175 Difference]: Start difference. First operand has 384 places, 601 transitions, 6210 flow. Second operand 20 states and 2615 transitions. [2025-03-13 22:16:33,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 1235 transitions, 15081 flow [2025-03-13 22:16:33,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 1235 transitions, 14855 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-13 22:16:33,495 INFO L231 Difference]: Finished difference. Result has 413 places, 796 transitions, 9926 flow [2025-03-13 22:16:33,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=6078, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=9926, PETRI_PLACES=413, PETRI_TRANSITIONS=796} [2025-03-13 22:16:33,496 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 254 predicate places. [2025-03-13 22:16:33,496 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 796 transitions, 9926 flow [2025-03-13 22:16:33,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 118.46666666666667) internal successors, (1777), 15 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:16:33,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:33,496 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,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:16:33,497 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:33,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:33,497 INFO L85 PathProgramCache]: Analyzing trace with hash 663405053, now seen corresponding path program 11 times [2025-03-13 22:16:33,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:33,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463847428] [2025-03-13 22:16:33,498 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:16:33,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:33,506 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:33,511 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,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-13 22:16:33,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:33,829 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,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:33,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463847428] [2025-03-13 22:16:33,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463847428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:16:33,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380327958] [2025-03-13 22:16:33,830 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:16:33,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:16:33,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:16:33,832 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:33,834 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:33,903 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:33,945 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,945 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-13 22:16:33,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:33,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-13 22:16:33,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:16:34,122 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:34,168 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:34,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:16:34,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380327958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:34,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 22:16:34,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-13 22:16:34,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200103497] [2025-03-13 22:16:34,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:34,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:16:34,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:34,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:16:34,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:16:34,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:16:34,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 796 transitions, 9926 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:34,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:16:34,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:38,281 INFO L124 PetriNetUnfolderBase]: 4570/16424 cut-off events. [2025-03-13 22:16:38,281 INFO L125 PetriNetUnfolderBase]: For 104535/105928 co-relation queries the response was YES. [2025-03-13 22:16:38,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67594 conditions, 16424 events. 4570/16424 cut-off events. For 104535/105928 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 173808 event pairs, 403 based on Foata normal form. 222/16507 useless extension candidates. Maximal degree in co-relation 67232. Up to 2632 conditions per place. [2025-03-13 22:16:38,412 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 217 selfloop transitions, 91 changer transitions 1/874 dead transitions. [2025-03-13 22:16:38,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 874 transitions, 11471 flow [2025-03-13 22:16:38,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:16:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:16:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1420 transitions. [2025-03-13 22:16:38,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8930817610062893 [2025-03-13 22:16:38,413 INFO L175 Difference]: Start difference. First operand has 413 places, 796 transitions, 9926 flow. Second operand 10 states and 1420 transitions. [2025-03-13 22:16:38,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 874 transitions, 11471 flow [2025-03-13 22:16:38,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 874 transitions, 11166 flow, removed 122 selfloop flow, removed 1 redundant places. [2025-03-13 22:16:38,944 INFO L231 Difference]: Finished difference. Result has 425 places, 808 transitions, 10161 flow [2025-03-13 22:16:38,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=9727, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10161, PETRI_PLACES=425, PETRI_TRANSITIONS=808} [2025-03-13 22:16:38,945 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 266 predicate places. [2025-03-13 22:16:38,945 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 808 transitions, 10161 flow [2025-03-13 22:16:38,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:38,946 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,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 22:16:39,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:16:39,146 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:39,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:39,147 INFO L85 PathProgramCache]: Analyzing trace with hash 394643653, now seen corresponding path program 12 times [2025-03-13 22:16:39,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:39,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71271511] [2025-03-13 22:16:39,148 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 22:16:39,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:39,155 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:39,159 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:39,159 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 22:16:39,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:39,293 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:39,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:39,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71271511] [2025-03-13 22:16:39,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71271511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:39,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:39,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:39,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055141475] [2025-03-13 22:16:39,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:39,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:39,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:39,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:39,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:39,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:16:39,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 808 transitions, 10161 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:39,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:16:39,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:43,329 INFO L124 PetriNetUnfolderBase]: 4450/16066 cut-off events. [2025-03-13 22:16:43,329 INFO L125 PetriNetUnfolderBase]: For 100929/102287 co-relation queries the response was YES. [2025-03-13 22:16:43,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65866 conditions, 16066 events. 4450/16066 cut-off events. For 100929/102287 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 169387 event pairs, 379 based on Foata normal form. 280/16215 useless extension candidates. Maximal degree in co-relation 65498. Up to 2545 conditions per place. [2025-03-13 22:16:43,474 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 197 selfloop transitions, 105 changer transitions 1/813 dead transitions. [2025-03-13 22:16:43,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 813 transitions, 10529 flow [2025-03-13 22:16:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1280 transitions. [2025-03-13 22:16:43,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8944793850454228 [2025-03-13 22:16:43,475 INFO L175 Difference]: Start difference. First operand has 425 places, 808 transitions, 10161 flow. Second operand 9 states and 1280 transitions. [2025-03-13 22:16:43,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 813 transitions, 10529 flow [2025-03-13 22:16:44,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 813 transitions, 10248 flow, removed 49 selfloop flow, removed 7 redundant places. [2025-03-13 22:16:44,010 INFO L231 Difference]: Finished difference. Result has 424 places, 745 transitions, 9178 flow [2025-03-13 22:16:44,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=8908, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9178, PETRI_PLACES=424, PETRI_TRANSITIONS=745} [2025-03-13 22:16:44,011 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 265 predicate places. [2025-03-13 22:16:44,011 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 745 transitions, 9178 flow [2025-03-13 22:16:44,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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:44,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:44,011 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:44,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:16:44,012 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:44,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:44,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1505031011, now seen corresponding path program 13 times [2025-03-13 22:16:44,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:44,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795431204] [2025-03-13 22:16:44,013 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 22:16:44,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:44,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-13 22:16:44,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:16:44,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:16:44,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:44,323 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:44,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:44,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795431204] [2025-03-13 22:16:44,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795431204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:44,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:44,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623710871] [2025-03-13 22:16:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:44,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:44,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:44,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:44,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:44,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:16:44,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 745 transitions, 9178 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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:44,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:44,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:16:44,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:47,961 INFO L124 PetriNetUnfolderBase]: 4432/16061 cut-off events. [2025-03-13 22:16:47,961 INFO L125 PetriNetUnfolderBase]: For 95673/96738 co-relation queries the response was YES. [2025-03-13 22:16:48,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65285 conditions, 16061 events. 4432/16061 cut-off events. For 95673/96738 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 169490 event pairs, 398 based on Foata normal form. 189/16122 useless extension candidates. Maximal degree in co-relation 64918. Up to 2556 conditions per place. [2025-03-13 22:16:48,118 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 208 selfloop transitions, 94 changer transitions 1/813 dead transitions. [2025-03-13 22:16:48,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 813 transitions, 10489 flow [2025-03-13 22:16:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1283 transitions. [2025-03-13 22:16:48,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.896575821104123 [2025-03-13 22:16:48,119 INFO L175 Difference]: Start difference. First operand has 424 places, 745 transitions, 9178 flow. Second operand 9 states and 1283 transitions. [2025-03-13 22:16:48,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 813 transitions, 10489 flow [2025-03-13 22:16:48,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 813 transitions, 10269 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-13 22:16:48,546 INFO L231 Difference]: Finished difference. Result has 428 places, 753 transitions, 9362 flow [2025-03-13 22:16:48,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=8977, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9362, PETRI_PLACES=428, PETRI_TRANSITIONS=753} [2025-03-13 22:16:48,547 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 269 predicate places. [2025-03-13 22:16:48,547 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 753 transitions, 9362 flow [2025-03-13 22:16:48,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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:48,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:48,548 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:48,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-13 22:16:48,548 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:48,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash 687431925, now seen corresponding path program 14 times [2025-03-13 22:16:48,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:48,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249493255] [2025-03-13 22:16:48,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:16:48,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:48,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 159 statements into 2 equivalence classes. [2025-03-13 22:16:48,564 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:48,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:16:48,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:48,687 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:48,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:48,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249493255] [2025-03-13 22:16:48,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249493255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:48,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:48,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:48,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003107130] [2025-03-13 22:16:48,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:48,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:48,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:48,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:48,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:49,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:16:49,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 753 transitions, 9362 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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:49,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:49,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:16:49,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:52,797 INFO L124 PetriNetUnfolderBase]: 4441/16165 cut-off events. [2025-03-13 22:16:52,798 INFO L125 PetriNetUnfolderBase]: For 98028/99066 co-relation queries the response was YES. [2025-03-13 22:16:52,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65877 conditions, 16165 events. 4441/16165 cut-off events. For 98028/99066 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 171196 event pairs, 383 based on Foata normal form. 194/16236 useless extension candidates. Maximal degree in co-relation 65508. Up to 2565 conditions per place. [2025-03-13 22:16:52,933 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 205 selfloop transitions, 104 changer transitions 1/820 dead transitions. [2025-03-13 22:16:52,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 820 transitions, 10708 flow [2025-03-13 22:16:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1282 transitions. [2025-03-13 22:16:52,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8958770090845563 [2025-03-13 22:16:52,934 INFO L175 Difference]: Start difference. First operand has 428 places, 753 transitions, 9362 flow. Second operand 9 states and 1282 transitions. [2025-03-13 22:16:52,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 820 transitions, 10708 flow [2025-03-13 22:16:53,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 820 transitions, 10523 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-03-13 22:16:53,379 INFO L231 Difference]: Finished difference. Result has 435 places, 762 transitions, 9629 flow [2025-03-13 22:16:53,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=9185, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9629, PETRI_PLACES=435, PETRI_TRANSITIONS=762} [2025-03-13 22:16:53,380 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 276 predicate places. [2025-03-13 22:16:53,380 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 762 transitions, 9629 flow [2025-03-13 22:16:53,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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:53,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:53,381 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:53,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-13 22:16:53,381 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:53,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash 649501825, now seen corresponding path program 15 times [2025-03-13 22:16:53,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:53,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228653948] [2025-03-13 22:16:53,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 22:16:53,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:53,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:16:53,394 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:53,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 22:16:53,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:53,520 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:53,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:53,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228653948] [2025-03-13 22:16:53,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228653948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:53,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:53,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:16:53,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397798360] [2025-03-13 22:16:53,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:53,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:16:53,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:53,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:16:53,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:16:54,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:16:54,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 762 transitions, 9629 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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:54,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:54,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:16:54,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:16:57,206 INFO L124 PetriNetUnfolderBase]: 4162/15316 cut-off events. [2025-03-13 22:16:57,206 INFO L125 PetriNetUnfolderBase]: For 92820/93882 co-relation queries the response was YES. [2025-03-13 22:16:57,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62356 conditions, 15316 events. 4162/15316 cut-off events. For 92820/93882 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 160156 event pairs, 388 based on Foata normal form. 191/15378 useless extension candidates. Maximal degree in co-relation 61984. Up to 2403 conditions per place. [2025-03-13 22:16:57,328 INFO L140 encePairwiseOnDemand]: 143/159 looper letters, 208 selfloop transitions, 99 changer transitions 1/818 dead transitions. [2025-03-13 22:16:57,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 818 transitions, 10777 flow [2025-03-13 22:16:57,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:16:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:16:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1285 transitions. [2025-03-13 22:16:57,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8979734451432565 [2025-03-13 22:16:57,329 INFO L175 Difference]: Start difference. First operand has 435 places, 762 transitions, 9629 flow. Second operand 9 states and 1285 transitions. [2025-03-13 22:16:57,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 818 transitions, 10777 flow [2025-03-13 22:16:57,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 818 transitions, 10562 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-03-13 22:16:57,755 INFO L231 Difference]: Finished difference. Result has 441 places, 767 transitions, 9764 flow [2025-03-13 22:16:57,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=9330, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9764, PETRI_PLACES=441, PETRI_TRANSITIONS=767} [2025-03-13 22:16:57,756 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 282 predicate places. [2025-03-13 22:16:57,756 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 767 transitions, 9764 flow [2025-03-13 22:16:57,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:16:57,756 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:57,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 22:16:57,756 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:16:57,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:16:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash 503828937, now seen corresponding path program 16 times [2025-03-13 22:16:57,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:16:57,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23994102] [2025-03-13 22:16:57,758 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 22:16:57,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:16:57,765 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 159 statements into 2 equivalence classes. [2025-03-13 22:16:57,773 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:57,773 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 22:16:57,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:16:58,089 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:58,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:16:58,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23994102] [2025-03-13 22:16:58,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23994102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:16:58,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:16:58,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-13 22:16:58,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792499633] [2025-03-13 22:16:58,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:16:58,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:16:58,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:16:58,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:16:58,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:16:58,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:16:58,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 767 transitions, 9764 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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:58,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:16:58,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:16:58,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:02,363 INFO L124 PetriNetUnfolderBase]: 3871/14326 cut-off events. [2025-03-13 22:17:02,363 INFO L125 PetriNetUnfolderBase]: For 85998/86980 co-relation queries the response was YES. [2025-03-13 22:17:02,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58138 conditions, 14326 events. 3871/14326 cut-off events. For 85998/86980 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 147109 event pairs, 378 based on Foata normal form. 164/14367 useless extension candidates. Maximal degree in co-relation 57763. Up to 2226 conditions per place. [2025-03-13 22:17:02,509 INFO L140 encePairwiseOnDemand]: 142/159 looper letters, 212 selfloop transitions, 96 changer transitions 1/780 dead transitions. [2025-03-13 22:17:02,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 780 transitions, 10239 flow [2025-03-13 22:17:02,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:17:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:17:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1419 transitions. [2025-03-13 22:17:02,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8924528301886793 [2025-03-13 22:17:02,511 INFO L175 Difference]: Start difference. First operand has 441 places, 767 transitions, 9764 flow. Second operand 10 states and 1419 transitions. [2025-03-13 22:17:02,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 780 transitions, 10239 flow [2025-03-13 22:17:02,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 780 transitions, 9935 flow, removed 68 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:02,940 INFO L231 Difference]: Finished difference. Result has 447 places, 732 transitions, 9144 flow [2025-03-13 22:17:02,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=8733, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9144, PETRI_PLACES=447, PETRI_TRANSITIONS=732} [2025-03-13 22:17:02,941 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 288 predicate places. [2025-03-13 22:17:02,941 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 732 transitions, 9144 flow [2025-03-13 22:17:02,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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:17:02,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:02,941 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:17:02,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-13 22:17:02,941 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:17:02,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash -412757507, now seen corresponding path program 17 times [2025-03-13 22:17:02,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:02,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167232211] [2025-03-13 22:17:02,943 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:17:02,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:02,950 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:17:02,957 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:17:02,957 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-13 22:17:02,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:03,431 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:17:03,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:03,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167232211] [2025-03-13 22:17:03,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167232211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:03,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208837809] [2025-03-13 22:17:03,432 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 22:17:03,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:03,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:03,433 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:17:03,434 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:17:03,504 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:17:03,551 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 159 of 159 statements. [2025-03-13 22:17:03,551 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-13 22:17:03,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:03,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-13 22:17:03,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:03,707 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:17:03,756 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:17:03,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 22:17:03,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208837809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:03,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 22:17:03,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-13 22:17:03,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563128057] [2025-03-13 22:17:03,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:03,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:17:03,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:03,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:17:03,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:17:04,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:17:04,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 732 transitions, 9144 flow. Second operand has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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:17:04,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:04,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:17:04,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:07,279 INFO L124 PetriNetUnfolderBase]: 3877/14359 cut-off events. [2025-03-13 22:17:07,279 INFO L125 PetriNetUnfolderBase]: For 84487/85455 co-relation queries the response was YES. [2025-03-13 22:17:07,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58104 conditions, 14359 events. 3877/14359 cut-off events. For 84487/85455 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 147846 event pairs, 400 based on Foata normal form. 202/14442 useless extension candidates. Maximal degree in co-relation 57725. Up to 2235 conditions per place. [2025-03-13 22:17:07,454 INFO L140 encePairwiseOnDemand]: 144/159 looper letters, 212 selfloop transitions, 106 changer transitions 0/789 dead transitions. [2025-03-13 22:17:07,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 789 transitions, 10403 flow [2025-03-13 22:17:07,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 22:17:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 22:17:07,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1412 transitions. [2025-03-13 22:17:07,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8880503144654088 [2025-03-13 22:17:07,455 INFO L175 Difference]: Start difference. First operand has 447 places, 732 transitions, 9144 flow. Second operand 10 states and 1412 transitions. [2025-03-13 22:17:07,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 789 transitions, 10403 flow [2025-03-13 22:17:07,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 789 transitions, 10158 flow, removed 30 selfloop flow, removed 6 redundant places. [2025-03-13 22:17:07,898 INFO L231 Difference]: Finished difference. Result has 456 places, 745 transitions, 9492 flow [2025-03-13 22:17:07,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=8917, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9492, PETRI_PLACES=456, PETRI_TRANSITIONS=745} [2025-03-13 22:17:07,898 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 297 predicate places. [2025-03-13 22:17:07,899 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 745 transitions, 9492 flow [2025-03-13 22:17:07,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 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:17:07,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:07,899 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:17:07,905 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:17:08,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-13 22:17:08,099 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-13 22:17:08,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:08,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1983089003, now seen corresponding path program 18 times [2025-03-13 22:17:08,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:08,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018439135] [2025-03-13 22:17:08,101 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 22:17:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:08,108 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 159 statements into 11 equivalence classes. [2025-03-13 22:17:08,112 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 109 of 159 statements. [2025-03-13 22:17:08,112 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 22:17:08,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:08,231 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:17:08,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:08,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018439135] [2025-03-13 22:17:08,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018439135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:08,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:08,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-13 22:17:08,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817061164] [2025-03-13 22:17:08,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:08,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-13 22:17:08,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:08,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-13 22:17:08,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-13 22:17:08,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 159 [2025-03-13 22:17:08,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 745 transitions, 9492 flow. Second operand has 9 states, 9 states have (on average 133.77777777777777) internal successors, (1204), 9 states have internal predecessors, (1204), 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:17:08,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:08,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 159 [2025-03-13 22:17:08,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand